A polynomial-time algorithm for a class of linear complementarity problems
Authors:
- 1 May 1989
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 44 (1-3) , 1-26
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- A note on degeneracy in linear programmingMathematical Programming, 1986
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- Simple computable bounds for solutions of linear complementarity problems and linear programs1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A variable dimension algorithm for the linear complementarity problemMathematical Programming, 1980
- On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduationMathematical Programming, 1979
- Computational complexity of LCPs associated with positive definite symmetric matricesMathematical Programming, 1979
- Computational complexity of complementary pivot methods1978