Short Steps with Karmarkar’s Projective Algorithm for Linear Programming

DOI10.1137/0804011zbMATH Open0799.90085OpenAlexW2109514698MaRDI QIDQ4294752FDOQ4294752

Authors Jean-Philippe Vial, Jean-Louis Goffin

Publication date 17 November 1994

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

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

zbMATH Keywords

interior point methodpath-followingprojective algorithmsduality gap reductionspotential reductions

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
• Updating lower bounds when using Karmarkar's projective algorithm for linear programming
• Karmarkar's linear programming algorithm and Newton's method
• A Centered Projective Algorithm for Linear Programming

Cited in

(11)

• A monotonic projective algorithm for fractional linear programming
• Karmarkar's algorithm with improved steps
• Improving complexity of Karmarkar's approach for linear programming
• Updating lower bounds when using Karmarkar's projective algorithm for linear programming
• Todd's low-complexity algorithm is a predictor-corrector path-following method
• A Centered Projective Algorithm for Linear Programming
• On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
• A path-following version of the Todd-Burrell procedure for linear programming
• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
• The Worst-Case Step in Karmarkar's Algorithm
• An experimental approach to karmarkar’s projective method for linear programming

This page was built for publication: Short Steps with Karmarkar’s Projective Algorithm for Linear Programming

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