Convergence behavior of interior-point algorithms
- 1 June 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 60 (2) , 215-228
- https://doi.org/10.1007/bf01580610
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Theoretical convergence of large-step primal—dual interior point algorithms for linear programmingMathematical Programming, 1993
- Long steps in an O(n 3 L) algorithm for linear programmingMathematical Programming, 1992
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential functionMathematical Programming, 1991
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction MethodSIAM Journal on Optimization, 1991
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function MethodSIAM Journal on Optimization, 1991
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- A Unified Approach to Interior Point Algorithms for Linear Complementarity ProblemsPublished by Springer Nature ,1991
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984