An O(n 3 L) adaptive path following algorithm for a linear complementarity problem
- 1 May 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 52 (3) , 587-595
- https://doi.org/10.1007/bf01582906
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A new polynomial time method for a linear complementarity problemMathematical Programming, 1992
- 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
- 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
- PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMSJournal of the Operations Research Society of Japan, 1989
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965