๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complementarity and nondegeneracy in semidefinite programming

โœ Scribed by Farid Alizadeh; Jean-Pierre A. Haeberly; Michael L. Overton

Book ID
110591428
Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
683 KB
Volume
77
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Positive semidefinite matrix completions
Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming
โœ Houduo Qi ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 179 KB

Let G = (V , E) be a graph. In matrix completion theory, it is known that the following two conditions are equivalent: (i) G is a chordal graph; (ii) Every G-partial positive semidefinite matrix has a positive semidefinite matrix completion. In this paper, we relate these two conditions to constrain

Semidefinite programming and matrix scal
Semidefinite programming and matrix scaling over the semidefinite cone
โœ Bahman Kalantari ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 269 KB

Let E be the Hilbert space of real symmetric matrices with block diagonal form diag(A, M), where A is n ร— n, and M is an l ร— l diagonal matrix, with the inner product x, y โ‰ก Trace(xy). We assume n + l 1, i.e. allow n = 0 or l = 0. Given x โˆˆ E, we write x 0 (x 0) if it is positive semidefinite (posit