Abstract
In [2] we characterized the class of matrices with nonnegative principla minors for which the linear-complementarity problem always has a solution. That class is contained in the one we study here. Our main result gives a finitely testable set of necessary and sufficient conditions under which a matrix with nonnegative principal minors has the property that if a corresponding linear complementarity problem is feasible then it is solvable. In short, we constructively characterize the matrix class known asQ o ∩P o .
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Aganagić and R.W. Cottle, “OnQ-matrices”, Technical Report SOL 78-9, Systems Optimization Laboratory, Department of Operations Research, Stanford University (Stanford, CA, 1978).
M. Aganagić and R.W. Cottle, “A note onQ-matrices”,Mathematical Programming 16 (1979) 374–377.
F.A. Al-Khayyal, “Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classesQ andQ o ”, Technical Report PDRC 85-05, Production and Distribution Center, Georgia Institute of Technology (Atlanta, November 1985).
R.W. Cottle, “The principal pivoting method of quadratic programming”, in: G.B. Dantzig and A.F. Veinott, Jr., eds.,Mathematics of the Decision Sciences, Part I, (American Mathematical Society, Providence, RI, 1968) pp. 144–168.
R.W. Cottle, “Some recent developments in linear complementarity theory”, in: R.W. Cottle, F. Giannessi, and J.L. Lions, eds.,Variational Inequalities and Complementarity Problems (John Wiley & Sons, Chichester, 1980) pp. 97–104.
R.D. Doverspike and C.E. Lemke, “A partial characterization of a class of matrices defined by solutions to the linear complementarity problem”,Mathematics of Operations Research 7 (1982) 272–294.
B.C. Eaves, “The linear complementarity problem”,Management Science 17 (1971) 612–634.
M. Fiedler and V. Pták, “Some generalizations of positive definiteness and monotonicity”,Numerische Mathematik 9 (1966) 163–172.
J.T. Fredericksen, L.T. Watson, and K.G. Murty, “A finite characterization ofK-matrices in dimensions less than four”,Mathematical Programming 35 (1986) 17–31.
C.B. Garcia, “Some classes of matrices in linear complementarity theory”,Mathematical Programming 5 (1973), 299–310.
A.W. Ingelton, “A problem in linear inequalities”,Proceedings of the London Mathematical Society 16 (1966) 519–536.
S. Karamardian, “The complementarity problem”,Mathematical Programming 2 (1972) 107–129.
C.E. Lemke, “Some pivot schemes for the linear complementarity problem”,Mathematical Programming Study 7 (1978) 15–35.
J.S. Pang, “A note on an open problem in linear complementarity”,Mathematical Programming 13 (1977) 360–363.
F.J. Pereira R., “On characterizations of copositive matrices”, Ph.D. Thesis and Technical Report No. 72-8, Department of Operations Research, Stanford University (Stanford, CA, May 1972).
Author information
Authors and Affiliations
Additional information
Research partially supported by the National Science Foundation Grant DMS-8420623 and U.S. Department of Energy Contract DE-AA03-76SF00326, PA # DE-AS03-76ER72018.
Rights and permissions
About this article
Cite this article
Aganagić, M., Cottle, R.W. A constructive characterization ofQ o-matrices with nonnegative principal minors. Mathematical Programming 37, 223–231 (1987). https://doi.org/10.1007/BF02591696
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02591696