The linear complimentarity problem, sufficient matrices, and the criss-cross method
- 1 July 1993
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 187, 1-14
- https://doi.org/10.1016/0024-3795(93)90124-7
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Two characterizations of sufficient matricesLinear Algebra and its Applications, 1992
- An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problemsMathematical Programming, 1991
- The principal pivoting method revisitedMathematical Programming, 1990
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroidsCombinatorica, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Sufficient matrices and the linear complementarity problemLinear Algebra and its Applications, 1989
- Symmetry and Positive Definiteness in Oriented MatroidsEuropean Journal of Combinatorics, 1988
- A constructive characterization ofQ o-matrices with nonnegative principal minorsMathematical Programming, 1987
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- Bimatrix Equilibrium Points and Mathematical ProgrammingManagement Science, 1965