On the finite convergence of interior-point algorithms for linear programming
- 1 May 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 57 (1) , 325-335
- https://doi.org/10.1007/bf01581087
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Convergence behavior of interior-point algorithmsMathematical Programming, 1993
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- On Finding Primal- and Dual-Optimal BasesINFORMS Journal on Computing, 1991
- Dual ellipsoids and degeneracy in the projective algorithm for linear programmingContemporary Mathematics, 1990
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithmAlgorithmica, 1986
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984