An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
- 1 August 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 2 (3), 349-359
- https://doi.org/10.1137/0802017
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A Low Complexity Interior-Point Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1992
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updatingOperations Research Letters, 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
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- Interior path following primal-dual algorithms. part II: Convex quadratic programmingMathematical Programming, 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
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984