A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 2 (1) , 55-70
- https://doi.org/10.1137/0802005
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A potential-reduction variant of Renegar's short-step path-following method for linear programmingLinear Algebra and its Applications, 1991
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991
- An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operationsMathematical Programming, 1990
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A duality theorem for non-linear programmingQuarterly of Applied Mathematics, 1961