Skip to main content
Log in

On semidefinite linear complementarity problems

  • Published:
Mathematical Programming Submit manuscript

Abstract.

Given a linear transformation L:?n→?n and a matrix Q∈?n, where ?n is the space of all symmetric real n×n matrices, we consider the semidefinite linear complementarity problem SDLCP(L,?n +,Q) over the cone ?n + of symmetric n×n positive semidefinite matrices. For such problems, we introduce the P-property and its variants, Q- and GUS-properties. For a matrix AR n×n, we consider the linear transformation L A :?n→?n defined by L A (X):=AX+XA T and show that the P- and Q-properties for L A are equivalent to A being positive stable, i.e., real parts of eigenvalues of A are positive. As a special case of this equivalence, we deduce a theorem of Lyapunov.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: March 1999 / Accepted: November 1999¶Published online April 20, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gowda, M., Song, Y. On semidefinite linear complementarity problems. Math. Program. 88, 575–587 (2000). https://doi.org/10.1007/PL00011387

Download citation

  • Issue Date:

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

Navigation