Improving the rate of convergence of interior point methods for linear programming

DOI10.1007/BF01582901zbMath0744.90054MaRDI QIDQ1181911

Vera V. Kovacevic-Vujcic

Publication date: 27 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

rate of convergenceinterior point methodsaffine scaling

Mathematics Subject Classification ID

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

Related Items

On the convergence of a predictor-corrector variant algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• On the asymptotic behavior of the projective rescaling algorithm for linear programming
• A new polynomial-time algorithm for linear programming
• Asymptotic behaviour of Karmarkar's method for linear programming
• A multiplicative barrier function method for linear programming
• Global convergence of the affine scaling methods for degenerate linear programming problems
• Unified complexity analysis for Newton LP methods
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Local Convergence Properties of New Methods in Linear Programming
• The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming
• On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms