๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Complexity of Semidefinite Programs

โœ Scribed by Lorant Porkolab; Leonid Khachiyan

Book ID
110260100
Publisher
Springer US
Year
1997
Tongue
English
Weight
163 KB
Volume
10
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Conditioning of semidefinite programs
Conditioning of semidefinite programs
โœ Madhu V. Nayakkankuppam; Michael L. Overton ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 137 KB
On parametric semidefinite programming
On parametric semidefinite programming
โœ D. Goldfarb; K. Scheinberg ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 869 KB

In this paper we consider a semidefinite programming (SDP) problem in which the objective function depends linearly on a scalar parameter. We study the properties of the optimal objective function value as a function of that parameter and extend the concept of the optimal partition and its range in

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)