A Path-Following Projective Interior Point Method for Linear Programming

DOI10.1137/0804003MaRDI QIDQ4294744zbMATH OpenOpenAlexFDO

Authors Donald Goldfarb, Dong X. Shaw

Publication date 1994

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0804003

zbMATH Keywords

polynomial-time complexitypath-following algorithmsprojective interior point methodexpected number of iterationscentral trajectory

Mathematics Subject Classification ID

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

Recommendations

• A Centered Projective Algorithm for Linear Programming
• On the Complexity of a Class of Projective Interior Point Methods
• Interior path following primal-dual algorithms. I: Linear programming
• New trajectory-following polynomial-time algorithm for linear programming problems
• A primal projective interior point method for linear programming

Cited in

(9)

• Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
• A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
• A Centered Projective Algorithm for Linear Programming
• Path-Following Methods for Linear Programming
• On the Complexity of a Class of Projective Interior Point Methods
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• Todd's low-complexity algorithm is a predictor-corrector path-following method
• A path-following version of the Todd-Burrell procedure for linear programming
• scientific article; zbMATH DE number 432999 (Why is no real title available?)

This page was built for publication: A Path-Following Projective Interior Point Method for Linear Programming

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