A cutting plane algorithm for convex programming that uses analytic centers
- 1 July 1995
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 69 (1-3) , 1-43
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A scaling technique for finding the weighted analytic center of a polytopeMathematical Programming, 1992
- A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear ProgrammingMathematics of Operations Research, 1991
- Practical Aspects of an Interior-Point Method for Convex Programming1991
- Interior-Point Methods for Convex Programming1990
- Cutting planes and column generation techniques with the projective algorithmJournal of Optimization Theory and Applications, 1990
- An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operationsMathematical Programming, 1990
- A new algorithm for minimizing convex functions over convex sets1989
- Geometric Algorithms and Combinatorial Optimization1988
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984