A logarithmic barrier cutting plane method for convex programming
- 1 March 1995
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 58 (2) , 67-98
- https://doi.org/10.1007/bf02032162
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- A central-cutting-plane algorithm for semi-infinite programming problemsPublished by Springer Nature ,2005
- On numerical analysis in semi-infinite programmingPublished by Springer Nature ,2005
- Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programmingDiscrete Applied Mathematics, 1994
- Computational experience with a primal-dual interior-point method for smooth convex programmingOptimization Methods and Software, 1994
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming ProblemsSIAM Journal on Optimization, 1993
- Semi-Infinite Programming: Theory, Methods, and ApplicationsSIAM Review, 1993
- A build-up variant of the logarithmic barrier method for LPOperations Research Letters, 1992
- A second order affine scaling algorithm for the geometric programming dual with logarithmic barrierOptimization, 1992
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959