Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- 1 April 1995
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 85 (1), 187-199
- https://doi.org/10.1007/bf02192304
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear ProgrammingMathematics of Operations Research, 1993
- On the Superlinear Convergence of Interior-Point Algorithms for a General Class of ProblemsSIAM Journal on Optimization, 1993
- Large-Step Interior Point Algorithms for Linear Complementarity ProblemsSIAM Journal on Optimization, 1993
- A new polynomial time method for a linear complementarity problemMathematical Programming, 1992
- An interior point potential reduction algorithm for the linear complementarity problemMathematical Programming, 1992
- An Interior-point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity ProblemsPublished by Defense Technical Information Center (DTIC) ,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
- AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEMJournal of the Operations Research Society of Japan, 1990
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989