✦ LIBER ✦

Conditioning of semidefinite programs

✍ Scribed by Madhu V. Nayakkankuppam; Michael L. Overton

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 137 KB
Volume: 85
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070050070

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A refined theorem concerning the conditi

A refined theorem concerning the conditioning of semidefinite programs

✍ Ioannis K. Argyros 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 177 KB

Optimality conditions for nonconvex semi

Optimality conditions for nonconvex semidefinite programming

✍ Anders Forsgren 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 188 KB

Equivalence of Two Nondegeneracy Conditi

Equivalence of Two Nondegeneracy Conditions for Semidefinite Programs

✍ M. L. Flegel; C. Kanzow 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 402 KB

Symmetry in semidefinite programs

✍ Frank Vallentin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Sequential Lagrangian Conditions for Con

Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite Programming

✍ N. Dinh; V. Jeyakumar; G. M. Lee 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 170 KB

Applications of semidefinite programming

✍ Lieven Vandenberghe; Stephen Boyd 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 871 KB

A wide variety of nonlinear convex optimization problems can be cast as problems involving linear matrix inequalities (LMIs), and hence efficiently solved using recently developed interior-point methods. In this paper, we will consider two classes of optimization problems with LMI constraints: (1)