Computational complexity of LCPs associated with positive definite symmetric matrices
- 1 December 1979
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 17 (1) , 335-344
- https://doi.org/10.1007/bf01588254
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Digraph Models of Bard-Type Algorithms for the Linear Complementarity ProblemMathematics of Operations Research, 1978
- Computational complexity of complementary pivot methodsPublished by Springer Nature ,1978
- Monotone solutions of the parametric linear complementarity problemMathematical Programming, 1972
- On the number of solutions to the complementarity problem and spanning properties of complementary conesLinear Algebra and its Applications, 1972
- On a Characterization ofP-MatricesSIAM Journal on Applied Mathematics, 1971
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965