Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming

DOI10.1287/moor.16.4.842zbMath0748.90041OpenAlexW2090279609MaRDI QIDQ3989820

Renato D. C. Monteiro

Publication date: 28 June 1992

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.16.4.842

zbMATH Keywords

affine scalingprojective scaling algorithmconvergence and boundary behaviour

Mathematics Subject Classification ID

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

Related Items

Analysis of some interior point continuous trajectories for convex programming, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data, A study of the dual affine scaling continuous trajectories for linear programming, Improving the rate of convergence of interior point methods for linear programming, Asymptotic behavior of the central path for a special class of degenerate SDP problems, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, Degeneracy in interior point methods for linear programming: A survey, An interior point parameterized central path following algorithm for linearly constrained convex programming