Sufficient matrices and the linear complementarity problem

[1]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[2]  H. Samelson,et al.  A partition theorem for Euclidean $n$-space , 1958 .

[3]  M. Fiedler,et al.  On matrices with non-positive off-diagonal elements and positive principal minors , 1962 .

[4]  R. Cottle.  Note on a Fundamental Theorem in Quadratic Programming , 1964 .

[5]  D. Gale,et al.  The Jacobian matrix and global univalence of mappings , 1965 .

[6]  C. E. Lemke,et al.  Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[7]  M. Fiedler,et al.  Some generalizations of positive definiteness and monotonicity , 1966 .

[8]  Richaard W. Cottle.  Nonlinear Programs with Positively Bounded Jacobians , 1966 .

[9]  R. Cottle.  On a Problem in Linear Inequalities , 1968 .

[10]  G. Dantzig,et al.  COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[11]  A. Ingleton.  The Linear Complementarity Problem , 1970 .

[12]  B. Eaves.  The Linear Complementarity Problem , 1971 .

[13]  Katta G. Murty,et al.  On the number of solutions to the complementarity problem and spanning properties of complementary cones , 1972 .

[14]  I. Adler,et al.  On the Solutions of the Positive Semi-Definite Complementarity Problem. , 1975 .

[15]  Existence of solution rays for linear complementarity problems with Z -matrices , 1978 .

[16]  R. Cottle,et al.  On solving linear complementarity problems as linear programs , 1978 .

[17]  M. J. M. Jansen.  On the structure of the solution set of a linear complementarity problem , 1981 .

[18]  Richard W. Cottle,et al.  A constructive characterization ofQo-matrices with nonnegative principal minors , 1987, Math. Program..