A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- 1 December 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 62 (1) , 233-252
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential FunctionSIAM Journal on Optimization, 1994
- A primal—dual infeasible-interior-point algorithm for linear programmingMathematical Programming, 1993
- Average Performance of a Self–Dual Interior Point Algorithm for Linear Programming1993
- Path-Following Methods for Linear ProgrammingSIAM Review, 1992
- Computational experience with a primal-dual interior point method for linear programmingLinear Algebra and its Applications, 1991
- An $O(\sqrt n L)$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- On the Performance of Karmarkar’s Algorithm over a Sequence of IterationsSIAM Journal on Optimization, 1991
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A Primal-Dual Interior Point Algorithm for Linear Programming1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984