𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The algebraic degree of semidefinite programming

✍ Scribed by Jiawang Nie; Kristian Ranestad; Bernd Sturmfels

Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
617 KB
Volume
122
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Applications of semidefinite programming
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)

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

Conditioning of semidefinite programs
Conditioning of semidefinite programs
✍ Madhu V. Nayakkankuppam; Michael L. Overton πŸ“‚ Article πŸ“… 1999 πŸ› Springer-Verlag 🌐 English βš– 137 KB