Convex relaxations for quadratic distance problems

@article{Garulli2008ConvexRF,
  title={Convex relaxations for quadratic distance problems},
  author={Andrea Garulli and Alfio Masi and Antonio Vicino},
  journal={2008 47th IEEE Conference on Decision and Control},
  year={2008},
  pages={5444-5449}
}
Convex relaxations of nonconvex problems are a powerful tool for the analysis and design of control systems. An important family of nonconvex problems that are relevant to the control field is that of quadratic distance problems. In this paper, several convex relaxations are presented for quadratic distance problems which are based on the sum-of squares representation of positive polynomials. Relationships among the considered relaxations are discussed and numerical comparisons are presented… CONTINUE READING