Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
- 1 May 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 4 (2) , 247-261
- https://doi.org/10.1137/0804014
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear ProgrammingMathematics of Operations Research, 1993
- 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(n 3 L) adaptive path following algorithm for a linear complementarity problemMathematical Programming, 1991
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Boundary Behavior of Interior Point Algorithms in Linear ProgrammingMathematics of Operations Research, 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
- A multiplicative barrier function method for linear programmingAlgorithmica, 1986