Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method

DOI10.1137/0801019zbMath0754.90036OpenAlexW2031527878MaRDI QIDQ4012425

Clóvis C. Gonzaga

Publication date: 27 September 1992

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0801019

zbMATH Keywords

lower boundsinterior point methodsKarmarkar's algorithmaffine polynomial potential reduction method

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Rank-one techniques in log-barrier function methods for linear programming, Interior-point algorithms for semi-infinite programming, Potential-reduction methods in mathematical programming, Some variants of the Todd low-complexity algorithm, Large step volumetric potential reduction algorithms for linear programming, A cutting plane method from analytic centers for stochastic programming, A combined phase I-phase II scaled potential algorithm for linear programming, A survey of search directions in interior point methods for linear programming, Long steps in an \(O(n^ 3L)\) algorithm for linear programming, On interior algorithms for linear programming with no regularity assumptions, An active-set strategy in an interior point method for linear programming, Convergence behavior of interior-point algorithms, Degeneracy in interior point methods for linear programming: A survey, Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming, A potential-reduction variant of Renegar's short-step path-following method for linear programming