✦ LIBER ✦

Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming

✍ Scribed by Le Han, Shujun Bi, Shaohua Pan

Book ID: 118807627
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 587 KB
Volume: 62
Category: Article
ISSN: 1017-1398
DOI: 10.1007/s11075-012-9567-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Constraint Nondegeneracy, Strong Regular

Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming

✍ Chan, Zi Xian; Sun, Defeng 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 286 KB

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

An equivalency condition of nonsingulari

An equivalency condition of nonsingularity in nonlinear semidefinite programming

✍ Chengjin Li; Wenyu Sun; Raimundo J. B. de Sampaio 📂 Article 📅 2010 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 169 KB