On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations

DOI10.1137/0801003zbMath0752.90044OpenAlexW2038981176MaRDI QIDQ4017636

Kurt M. Anstreicher

Publication date: 16 January 1993

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

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

zbMATH Keywords

potential functionworst caseKarmarkar's projective algorithmexact linesearch

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Potential-reduction methods in mathematical programming ⋮ Log-Barrier Interior Point Methods Are Not Strongly Polynomial ⋮ A lower bound on the number of iterations of long-step primal-dual linear programming algorithms ⋮ Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm ⋮ On the number of iterations of Karmarkar's algorithm for linear programming

This page was built for publication: On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations