On the Complexity of a Class of Projective Interior Point Methods

DOI10.1287/MOOR.20.1.116MaRDI QIDQ4835389zbMATH OpenOpenAlexFDO

Authors Donald Goldfarb, Dong X. Shaw

Publication date 31 July 1995

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

Full work available at URL https://semanticscholar.org/paper/50e61b2f4cd31a185af4d34c23d708dcf855e542

zbMATH Keywords

generic projective interior point algorithmworst case iteration bound

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Karmarkar's projective method for linear programming: a computational survey
• A Path-Following Projective Interior Point Method for Linear Programming
• scientific article; zbMATH DE number 223544
• On the finite convergence of interior-point algorithms for linear programming
• A new polynomial-time algorithm for linear programming

Cited in

(4)

• Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
• On the finite convergence of interior-point algorithms for linear programming
• A Centered Projective Algorithm for Linear Programming
• Extension of a projective interior point method for linearly constrained convex programming

This page was built for publication: On the Complexity of a Class of Projective Interior Point Methods

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