𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming

✍ Scribed by Chan, Zi Xian; Sun, Defeng

Book ID
118203484
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
286 KB
Volume
19
Category
Article
ISSN
1052-6234

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