Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CDC
2008
IEEE

favoriteEmaildiscussreport

121views Control Systems» more CDC 2008»

Convex relaxations for quadratic distance problems

13 years 11 months ago

Convex relaxations for quadratic distance problems

Download ftp.ing.unisi.it

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

Real-time Traffic

CDC 2008 | Control Systems | Convex Relaxations | Quadratic Distance Problems | Robust Control Systems |

claim paper

Related Content

» Evaluation of a convex relaxation to a quadratic assignment matching approach for relation...

» Quadratic programming relaxations for metric labeling and Markov random field MAP estimati...

» Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets

» Convex relaxation approach to the identification of the WienerHammerstein model

» Convex Quadratic Programming for Object Localization

» Probabilistic Subgraph Matching Based on Convex Relaxation

» On convex relaxations of quadrilinear terms

» Learning a Distance Metric from Relative Comparisons

» An Analysis of Convex Relaxations for MAP Estimation

Post Info
More Details (n/a)

Added	29 May 2010
Updated	29 May 2010
Type	Conference
Year	2008
Where	CDC
Authors	Andrea Garulli, Alfio Masi, Antonio Vicino

Comments (0)