Sciweavers

CDC
2008
IEEE

Convex relaxations for quadratic distance problems

14 years 6 months ago
Convex relaxations for quadratic distance problems
This paper deals with convex relaxations for quadratic distance problems, a class of optimization problems relevant to several important topics in the analysis and synthesis of robust control systems. Some classes of convex relaxations are investigated, using the sum-of squares paradigm for the representation of positive polynomials. Relationships among the considered relaxations are discussed and numerical comparisons are presented, highlighting their degree of conservatism.
Andrea Garulli, Alfio Masi, Antonio Vicino
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where CDC
Authors Andrea Garulli, Alfio Masi, Antonio Vicino
Comments (0)