Abstract
In a recent paper [1], Aganagic and Cottle have established a constructive characterization for aP 0-matrix to be aQ-matrix. Among the principal results in this paper, we show that the same characterization holds for anL-matrix as well, and that the symmetric copositive-plusQ-matrices are precisely those which are strictly copositive.
This is a preview of subscription content, log in via an institution to check access.
References
M. Aganagic and R.W. Cottle, “A note onQ-matrices”, Tech. Rept. SOL78-5, Systems Optimization Laboratory, Department of Operations Research, Stanford University (March, 1978).
R.W. Cottle, G.J. Habetber and C.E. Lemke, “Quadratic forms semi-definite over convex cones”,Proceedings of the international symposium on mathematical programming, Princeton, 1967, pp. 551–565.
B.C. Eaves, “The linear complementarity problem”,Management Science 17 (1971) 621–634.
M. Fiedler and V. Ptak, “Some generalizations of positive definiteness and monotonicity”,Numerische Mathematik 9 (1966) 163–172.
S. Karamardian, “The complementarity problem”,Mathematical Programming 2 (1972) 107–129.
O.L. Mangasarian,Nonlinear programming (McGraw-Hill, New York, 1969).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pang, JS. OnQ-matrices. Mathematical Programming 17, 243–247 (1979). https://doi.org/10.1007/BF01588247
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588247