A Homological Characterization of Q-Matrices

A real square matrix M is said to be a Q-matrix if the linear complementarity problem (q, M) has a solution for every vector q. There is, as yet, no characterization of Q-matrices which makes it easy to determine whether or not a given matrix is Q. Ideas from topology, in particular degreetheory, have previously been used to obtain sufficient conditions for when a matrix is Q. In this paper we will apply some other ideas from topology to give a homological characterization of Q-matrices. Continuing to borrow from topology, we define the nerve of a matrix which, along with our characterization, leads to an algorithm for checking whether or not a matrix is Q. This algorithm has smaller bounds on its worst-case time complexity than previous methods.

[1]  A. Seireg,et al.  A Mathematical Programming Method for Design of Elastic Bodies in Contact , 1971 .

[2]  R. S. Sacher,et al.  On the solution of large, structured linear complementarity problems: The block partitioned case , 1977 .

[3]  G. Dantzig,et al.  A generalization of the linear complementarity problem , 1970 .

[4]  A. S. Manne.  On the Formulation and Solution of Economic Equilibrium Models , 1985 .

[5]  L. Watson,et al.  Q-matrices and spherical geometry , 1979 .

[6]  Micha Sharir,et al.  On the Zone Theorem for Hyperplane Arrangements , 1991, SIAM J. Comput..

[7]  F. J. Gould,et al.  Relations Between PL Maps, Complementary Cones, and Degree in Linear Complementarity Problems , 1983 .

[8]  Cu Duong Ha,et al.  Application of Degree Theory in Stability of the Complementarity Problem , 1987, Math. Oper. Res..

[9]  Richard Steinberg,et al.  The Prevalence of Paradoxes in Transportation Equilibrium Problems , 1988, Transp. Sci..

[10]  Walter D. Morris.  Counterexamples to Q-matrix conjectures , 1988 .

[11]  Gregory E. Coxson,et al.  The P-matrix problem is co-NP-complete , 1994, Math. Program..

[12]  M. Balinski,et al.  Complementarity and fixed point problems , 1978 .

[13]  Jesús A. De Loera,et al.  Q-matrix recognition via secondary and universal polytopes , 1999, Math. Program..

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

[15]  H. D. Brunk,et al.  The Isotonic Regression Problem and its Dual , 1972 .

[16]  Katta G. Murty,et al.  A finite characterization ofK-matrices in dimensions less than four , 1986, Math. Program..

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

[18]  Walter D. Morris.  On the Maximum Degree of an LCP Map , 1990, Math. Oper. Res..

[19]  R. Howe.  Linear Complementarity and the Degree of Mappings , 1983 .

[20]  K. Borsuk.  On the imbedding of systems of compacta in simplicial complexes , 1948 .

[21]  Roger Howe.  On a Class of Linear Complementarity Problems of Variable Degree , 1983 .

[22]  C. B. García,et al.  Some classes of matrices in linear complementarity theory , 1973, Math. Program..

[23]  F. J. Gould,et al.  Homotopy methods and global convergence , 1983 .

[24]  Raimund Seidel,et al.  Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..

[25]  Laurence A. Wolsey,et al.  Chapter VI Integer programming , 1989 .