A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
- 1 February 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 2 (1) , 71-87
- https://doi.org/10.1137/0802006
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Long steps in an O(n 3 L) algorithm for linear programmingMathematical Programming, 1992
- An O(n 3 L) potential reduction algorithm for linear programmingMathematical Programming, 1991
- A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithmMathematical Programming, 1990
- An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operationsMathematical Programming, 1990
- 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
- An Algorithm for Solving Linear Programming Problems in O(n 3 L) OperationsPublished by Springer Nature ,1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- 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