A Path-Following Projective Interior Point Method for Linear Programming

DOI10.1137/0804003zbMath0799.90084OpenAlexW2041365890MaRDI QIDQ4294744

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

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

Related Items (3)

A path-following version of the Todd-Burrell procedure for linear programming ⋮ Todd's low-complexity algorithm is a predictor-corrector path-following method ⋮ Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming

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