Theoretical convergence of large-step primal—dual interior point algorithms for linear programming
- 1 March 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 59 (1-3) , 1-21
- https://doi.org/10.1007/bf01581234
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- An interior point potential reduction algorithm for the linear complementarity problemMathematical Programming, 1992
- Homotopy Continuation Methods for Nonlinear Complementarity ProblemsMathematics of Operations Research, 1991
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential functionMathematical Programming, 1991
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity ProblemsSIAM Journal on Optimization, 1991
- A Unified Approach to Interior Point Algorithms for Linear Complementarity ProblemsPublished by Springer Nature ,1991
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A Primal-Dual Interior Point Algorithm for Linear ProgrammingPublished by Springer Nature ,1989
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986