Relationships among different SOS-based relaxations for quadratic distance problems

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 6, Issue PART 1, 2009, Pages 66-71

  Garulli, Andrea ^a   Masi, Alfio ^a   Vicino, Antonio ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; ECONOMIC AND SOCIAL EFFECTS; ROBUST CONTROL;

COMPUTATIONAL BURDEN; CONVEX RELAXATION; HOMOGENEOUS FORMS; MINIMUM DISTANCE PROBLEMS; POLYNOMIAL SURFACE; POSITIVSTELLENSATZ; SUM OF SQUARES; TRADE OFF;

RELAXATION PROCESSES;

EID: 78149262256     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20090616-3-IL-2002.00012     Document Type: Conference Paper

References (19)

1. S. P. Bhattacharyya, H. Chapellat, and L. H. Keel. Robust Control: The Parametric Approach. Prentice Hall, NJ, 1995.
2. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge (UK), 2004.
3. G. Chesi. On the gap between positive polynomials and SOS of polynomials. IEEE Trans. on Automatic Control, 52(6):1066-1072, 2007. (Pubitemid 47034034)
4. G. Chesi, A. Tesi, A. Vicino, and R. Genesio. A convex approach to a class of minimum norm problems. In A. Garulli, A. Tesi, and A. Vicino, editors, Robustness in Identification and Control, pages 359-372. Springer- Verlag, London, 1999.
5. G. Chesi, A. Garulli, A. Tesi, and A. Vicino. Solving quadratic distance problems: an LMI-based approach. IEEE Trans. on Automatic Control, 48(2):200-212, 2003.
6. M. Choi, T. Lam, and B. Reznick. Sums of squares of real polynomials. In Proc. of Symposia in Pure Mathematics, pages 103-126, 1995.
7. A. Garulli, A. Masi, and A. Vicino. Convex relaxations for quadratic distance problems. In Proc. of 47-th IEEE Conf. on Decision and Control, pages 5444-5449, Cancun (Mexico), December 2008.
8. G. Hardy, J. E. Littlewood, and G. Pólya. Inequalities: Second edition. Cambridge University Press, Cambridge, 1988.
9. D. Henrion and A. Garulli, editors. Positive Polynomials in Control, volume 312 of Lecture Notes in Control and Information Sciences. Springer, London, 2005.
10. D. Hershkowitz. Recent directions in matrix stability. Linear Alg. Appl., 171:161-186, 1992.
11. Z. Jarvis-Wloszek, R. Feeley, W. Tan, K. Sun, and A. Packard. Control application of sum of squares programming. In D. Henrion and A. Garulli, editors, Positive Polynomials in Control, number 312 in Lecture Notes in Control and Information Sciences, pages 3-22. Springer-Verlag, London, 2005. (Pubitemid 40171267)
12. T. S. Motzkin. The arithmetic-geometric inequality. In O. Shisha, editor, Inequalities. New York: Academic, 1967.
13. Y. Nesterov and A. Nemirovsky. Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia, 1993.
14. P. A. Parrilo. Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. PhD thesis, California Institute of Technology, Pasadena, CA, 2000.
15. V. Powers and T. Wörmann. An algorithm for sums of squares of real polynomials. Journal of Pure and Applied Linear Algebra, 127:99-104, 1998. (Pubitemid 128177544)
16. M. Putinar. Positive polynomials on compact semialgebraic sets. Ind. Univ. Math., 42:969-984, 1993.
17. B. Reznick. On Hilbert's construction of positive polynomials. ArXiv:0707.2156, 2007.
18. K. Schmüdgen. The K-moment problem for compact semialgebraic sets. Mathematische Annalen, 289:203-206, 1991.
19. A. J. van der Schaft. L2-gain analysis of nonlinear state feedback H∞-control. IEEE Trans. on Automatic Control, 37(6):770-784, 1992.