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

DOI10.1137/0801019MaRDI QIDQ4012425zbMATH OpenOpenAlexFDO

Authors C. 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

interior point methodslower boundsKarmarkar's algorithmaffine polynomial potential reduction method

Mathematics Subject Classification ID

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

Recommendations

• A potential-reduction variant of Renegar's short-step path-following method for linear programming
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
• Large step volumetric potential reduction algorithms for linear programming
• scientific article; zbMATH DE number 4197744
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming

Cited in

(19)

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

This page was built for publication: Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012425)