An alternative derivation of the projective interior point method for linear programming through the least squares approach

DOI10.1080/02331939408844007zbMath0820.90065OpenAlexW2014982704MaRDI QIDQ4764596

Z. Y. Cheng, John E. Mitchell

Publication date: 8 May 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408844007

zbMATH Keywords

interior point methodleast squares approachaffine-centering direction

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• A monotonic projective algorithm for fractional linear programming
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A survey of search directions in interior point methods for linear programming
• Search directions for interior linear-programming methods
• 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
• Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
• Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems

This page was built for publication: An alternative derivation of the projective interior point method for linear programming through the least squares approach