General central path and the largest step general central path following algorithm for linear programming

DOI10.1007/BF02677372zbMath1027.90056MaRDI QIDQ5949520

Wen-Bao Ai, Ke-Cun Zhang

Publication date: 21 November 2001

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

zbMATH Keywords

linear programminginterior point methodspolynomial-time convergencequadratic convergence general central path following method

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• Convergence behavior of interior-point algorithms
• Interior path following primal-dual algorithms. I: Linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A new polynomial time method for a linear complementarity problem
• The largest step path following algorithm for monotone linear complementarity problems
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
• Path-Following Methods for Linear Programming