Skip to main content
SpringerLink
Log in

Completely- matrices

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

Abstract

A

matrix is a real square matrixM such that for everyq the linear complementarity problem: Findw andz satisfyingw = q + Mz, w ≥ 0, z ≥ 0, w T z = 0, has a solution. We characterize the class of completely-

matrices, defined here as the class of

-matrices all of whose nonempty principal submatrices are also

-matrices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. M. Aganagic and R.W. Cottle, “OnQ-matrices”, Tech. Rep. SOL 78-9, Department of Operations Research, Stanford University (September 1978).

  2. 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: Theory and applications (Wiley, London) to appear.

  3. R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming”,Linear Algebra and Its Applications 1 (1968) 103–125.

    Google Scholar 

  4. R.W. Cottle and R. von Randow, “OnQ-matrices, centroids, and simplotopes”, Tech. Rep. 79-10, Department of Operations Research, Stanford University (June 1979).

  5. B.C. Eaves, “The linear complementarity problem”,Management Science 17 (1971) 612–634.

    Google Scholar 

  6. C.B. Garcia, “Some classes of matrices in linear complementarity theory”,Mathematical Programming 5 (1973) 299–310.

    Google Scholar 

  7. S. Karamardian, “The complementarity problem”,Mathematical Programming 2 (1972) 107–129.

    Google Scholar 

  8. L.M. Kelly and L.T. Watson, “Q-matrices and spherical geometry”,Linear Algebra and Its Applications 25 (1979) 175–189.

    Google Scholar 

  9. C.E. Lemke, “Bimatrix equilibrium points and mathematical programming”,Management Science 11 (1965) 681–689.

    Google Scholar 

  10. C.E. Lemke, “Recent results on complementarity problems”, in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1970) pp. 349–384.

    Google Scholar 

  11. K.G. Murty, “On the number of solutions to the complementarity problem and the spanning properties of complementary cones”,Linear Algebra and Its Applications 5 (1972) 65–108.

    Google Scholar 

  12. J.-S. Pang, “A note on an open problem in linear complementarity”,Mathematical Programming 13 (1977) 360–363.

    Google Scholar 

  13. F. Pereira, “On characterizations of copositive matrices”, Doctoral Dissertation (and Tech. Rept. 72-8), Department of Operations Research, Stanford University (May 1972).

  14. L. Van der Heyden, “A variable dimension algorithm for the linear complementarity problem,”Mathematical Programming 19 (1980) 328–346 [this issue].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, Stanford, CA, USA

    Richard W. Cottle

Authors
  1. Richard W. Cottle
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research on this paper was partially supported by the Office of Naval Research Contract N00014-75-C-0267 and National Science Foundation Grant MCS76-81259 A01.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cottle, R.W. Completely- matrices. Mathematical Programming 19, 347–351 (1980). https://doi.org/10.1007/BF01581653

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01581653

Key words

Search

Navigation