✦ LIBER ✦

On sensitivity of central solutions in semidefinite programming

✍ Scribed by J.F. Sturm; S. Zhang

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 186 KB
Volume: 90
Category: Article
ISSN: 0025-5610
DOI: 10.1007/pl00011422

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sensitivity analysis in linear programmi

Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

✍ E. Alper Yıldırım; Michael Todd 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 277 KB

A class of semidefinite programs with ra

A class of semidefinite programs with rank-one solutions

✍ Guillaume Sagnol 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Symmetricity of the solution of semidefi

Symmetricity of the solution of semidefinite programming

✍ Y. Kanno; M. Ohsaki; N. Katoh 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 743 KB

On a special class of regularized centra

On a special class of regularized central paths for semidefinite programs

✍ Anhua Lin 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 252 KB

Analyticity of weighted central paths an

Analyticity of weighted central paths and error bounds for semidefinite programming

✍ Chek Beng Chua 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 344 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