On the number of iterations of Karmarkar's algorithm for linear programming

DOI10.1007/BF01585165zbMath0804.90092OpenAlexW2052200991MaRDI QIDQ1321670

M. J. D. Powell

Publication date: 28 April 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585165

zbMATH Keywords

semi-infinite programminginterior point methodsKarmarkar's algorithm

Mathematics Subject Classification ID

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

Related Items

Interior-point algorithms for semi-infinite programming, 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

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program
• Interior point algorithms for linear programming with inequality constraints
• An implementation of Karmarkar's algorithm for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
• On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations