On the asymptotic behavior of the projective rescaling algorithm for linear programming

DOI10.1016/0885-064X(87)90015-XzbMath0713.90049MaRDI QIDQ750290

Michael Shub

Publication date: 1987

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

asymptotic rate of approachinterior orbitprojective rescaling vector fieldtangent

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items

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

Cites Work

• A new polynomial-time algorithm for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials

This page was built for publication: On the asymptotic behavior of the projective rescaling algorithm for linear programming