The Worst-Case Step in Karmarkar's Algorithm

DOI10.1287/MOOR.14.2.294MaRDI QIDQ3829348zbMATH OpenOpenAlexFDO

Authors Kurt M. Anstreicher

Publication date 1989

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

Full work available at URL https://doi.org/10.1287/moor.14.2.294

zbMATH Keywords

Karmarkar's projective algorithmtight boundsworst-case reduction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
• Short Steps with Karmarkar’s Projective Algorithm for Linear Programming
• Karmarkar's algorithm with improved steps
• On the improvement per iteration in Karmarkar's algorithm for linear programming
• On the number of iterations of Karmarkar's algorithm for linear programming

Cited in

(8)

• Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program
• Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
• Convergence in Karmarkar's algorithm: a review
• A Modified Termination Rule for Karmarkar’s Algorithm
• Probabilistic bounds on one step objective/potential function improvement in Karmarkar's algorithm
• Karmarkar's algorithm with improved steps
• On the improvement per iteration in Karmarkar's algorithm for linear programming

This page was built for publication: The Worst-Case Step in Karmarkar's Algorithm

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