Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
- 1 May 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 1 (2) , 280-292
- https://doi.org/10.1137/0801019
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- 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
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- Polynomial affine algorithms for linear programmingMathematical Programming, 1990
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- Pathways to the Optimal Set in Linear ProgrammingPublished by Springer Nature ,1989
- An Algorithm for Solving Linear Programming Problems in O(n 3 L) OperationsPublished by Springer Nature ,1989
- Conical projection algorithms for linear programmingMathematical Programming, 1989
- On the convexity of the multiplicative version of Karmarkar's potential functionMathematical Programming, 1988
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984