Abstract
Recently, Jeter and Pye gave an example to show that Pang's conjecture, thatL 1 ⋂Q \( \subseteq R_0 \), is false. We show in this article that the above conjecture is true for symmetric matrices. Specifically, we show that a symmetric copositive matrix is inQ if and only if it is strictly copositive.
This is a preview of subscription content, log in via an institution to check access.
References
M. Aganagić and R.W. Cottle, “A note onQ-matrices,”Mathematical Programming 16 (1979) 374–377.
M.W. Jeter and W.C. Pye, “An example of a nonregular semimonotoneQ-matrix,”Mathematical Programming 44 (1989) 351–356.
M.W. Jeter and W.C. Pye, “Some properties ofQ-matrices,”Linear Algebra and its Applications 57 (1984) 169–180.
M.W. Jeter and W.C. Pye “Some remarks on copositiveQ-matrices and on a conjecture of Pang,”Industrial Mathematics 35, part I (1985) 75–80.
O.L. Mangasarian,Nonlinear Programming (McGraw-Hill, New York, 1969),
K.G. Murty, “On the number of solutions to the complementarity problems and spanning properties of complementary cones,”Linear Algebra and its Applications 5 (1972) 65–108.
J.S. Pang, “OnQ-matrices,”Mathematical Programming 17 (1979) 243–247.
F.J. Pereira, “On characterizations of copositive matrices,” Technical Report SOL 72-8, Department of Operations Research, Stanford University (Stanford, CA, 1972).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gowda, M.S. OnQ-matrices. Mathematical Programming 49, 139–141 (1990). https://doi.org/10.1007/BF01588783
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588783