# Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization

@inproceedings{Parrilo2000StructuredSP, title={Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization}, author={P. Parrilo}, year={2000} }

In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be characterized exactly. This family corresponds to the case where the associated linear operator maps the cone of positive semidefinite matrices onto itself. In this case, the optimal value equals the spectral radius of the operator. It is shown that some rank minimization problems, as well as generalizations of the structured singular value ($mu$) LMIs, have exactly… Expand

#### Figures and Tables from this paper

#### 1,967 Citations

Exact relaxation for the semidefinite matrix rank minimization problem with extended Lyapunov equation constraint

- Mathematics
- 2014

The semidefinite matrix rank minimization, which has a broad range of applications in system control, statistics, network localization, econometrics and so on, is computationally NPhard in general… Expand

Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns

- Mathematics
- 2012

One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the… Expand

Generic Properties for Semialgebraic Programs

- Computer Science, Mathematics
- SIAM J. Optim.
- 2017

In this paper we study genericity for the class of semialgebraic optimization problems with equality and inequality constraints, in which every problem of the class is obtained by linear… Expand

Stability and Genericity for Semi-algebraic Compact Programs

- Mathematics, Computer Science
- J. Optim. Theory Appl.
- 2016

It is shown that, for almost every problem in the class of polynomial optimization problems over semi-algebraic compact sets, there is a unique optimal solution for which the global quadratic growth condition and the strong second-order sufficient conditions hold. Expand

LMI Approximations for Cones of Positive Semidefinite Forms

- Computer Science, Mathematics
- SIAM J. Optim.
- 2006

This work derives a novel approximation to the cone of copositive forms, that is, the cones of forms that are positive semidefinite over the nonnegative orthant, which opens the possibility of using linear programming technology in optimization problems over these cones. Expand

Preprint : LMI Relaxations in Robust Control

- 2005

The purpose of this tutorial paper is to discuss the important role of robust linear matrix inequalities with rational dependence on uncertainties in robust control. We review how various classical… Expand

Global optimization of rational functions: a semidefinite programming approach

- Mathematics, Computer Science
- Math. Program.
- 2006

It is shown that in the univariate case (n = 1), these problems have exact reformulations as semidefinite programming (SDP) problems, by using reformulations introduced in the PhD thesis of Jibetean [16]. Expand

Convex algebraic geometry and semidefinite optimization

- Mathematics, Computer Science
- ISSAC '13
- 2013

This tutorial will focus on basic and recent developments in convex algebraic geometry, and the associated computational methods based on semidefinite programming for optimization problems involving polynomial equations and inequalities. Expand

Stable Rank-One Matrix Completion is Solved by the Level 2 Lasserre Relaxation

- Computer Science, Mathematics
- Found. Comput. Math.
- 2021

This paper studies the problem of deterministic rank-one matrix completion. It is known that the simplest semidefinite programming relaxation, involving minimization of the nuclear norm, does not in… Expand

Stable rank one matrix completion is solved by two rounds of semidefinite programming relaxation

- Mathematics
- 2017

This paper studies the problem of deterministic rank-one matrix completion. It is known that the simplest semidefinite programming relaxation, involving minimization of the nuclear norm, does not in… Expand

#### References

SHOWING 1-10 OF 122 REFERENCES

A bisection method for computing the H∞ norm of a transfer matrix and related problems

- Mathematics, Computer Science
- Math. Control. Signals Syst.
- 1989

The bisection method is far more efficient than algorithms which involve a search over frequencies, and the usual problems associated with such methods (such as determining how fine the search should be) do not arise. Expand

Semidefinite Programming

- Computer Science
- SIAM Rev.
- 1996

A survey of the theory and applications of semidefinite programs and an introduction to primaldual interior-point methods for their solution are given. Expand

On the rank minimization problem over a positive semidefinite linear matrix inequality

- Mathematics, Computer Science
- IEEE Trans. Autom. Control.
- 1997

We consider the problem of minimizing the rank of a positive semidefinite matrix, subject to the constraint that an affine transformation of it is also positive semidefinite. Our method for solving… Expand

Nonlinear optimal control: an enhanced quasi-LPV approach

- Mathematics
- 1999

Realistic models of physical systems are often nonlinear. Our objective is to synthesize controllers for nonlinear systems that not only provide stability, but also deliver good closed-loop… Expand

A linear matrix inequality approach to H∞ control

- Mathematics
- 1994

The continuous- and discrete-time H∞ control problems are solved via elementary manipulations on linear matrix inequalities (LMI). Two interesting new features emerge through this approach:… Expand

A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems

- Computer Science
- SIAM J. Discret. Math.
- 1990

It is shown that the strength of the resulting reformulation depends on the degree of the terms used to produce the polynomial program at the intermediate step of this method, and a hierarchy of sharper representations is obtained with the final relaxation representing the convex hull of feasible solutions. Expand

A hierarchy of relaxation between the continuous and convex hull representations

- Mathematics
- 1990

In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a zero-one polynomial programming problem, and then relinearizes it into… Expand

Least squares stationary optimal control and the algebraic Riccati equation

- Mathematics
- 1971

The optimal control of linear systems with respect to quadratic performance criteria over an infinite time interval is treated. Both the case in which the terminal state is free and that in which the… Expand

Output feedback stabilization and related problems-solution via decision methods

- Mathematics
- 1975

Given an unstable finite-dimensional linear system, the output feedback problem is, first, to decide whether it is possible by memoryless linear feedback of the output to stabilize the system, and,… Expand

On the stability domain estimation via a quadratic Lyapunov function: convexity and optimality properties for polynomial systems

- Computer Science, Mathematics
- IEEE Trans. Autom. Control.
- 1996

The problem of estimating the stability domain of the origin of an n-order polynomial system is considered. Exploiting the structure of this class of systems it is shown that, for a given quadratic… Expand