From coefficients to samples: A new approach to SOS optimization

Proceedings of the IEEE Conference on Decision and Control

Volumn 3, Issue , 2004, Pages 3154-3159

  Löfberg, Johan ^a   Parrilo, Pablo A ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

FINITE SETS; QUADRATIC FORM; SUM OF SQUARES (SOS) DECOMPOSITION; TOEPLITZ STRUCTURES;

POLYNOMIALS;

EID: 14244264785     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2004.1428957     Document Type: Conference Paper

References (20)

1. B. Alkire and L. Vandenberghe. Convex optimization problems involving finite autocorrelation sequences. Mathematical Programming Ser. A, 93(3):331-359, 2002.
2. S. Benson, Y. Ye, and X. Zhang. DSDP, A Dual Scaling Algorithm for Positive Semidefinite Programming. Available from http://www-unix.mcs.anl.gov/ ~benson/dsdp/.
3. E. de Klerk. Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications, volume 65 of Applied Optimization. Kluwer Academic Publishers, 2002.
4. D. den Hertog. Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity. Mathematics and Its Applications. Kluwer Academic Publishers, 1994.
5. A. V. Fiacco and G. P. McCormick. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Systems & Control: Foundations and Applications. John Wiley and Sons, 1968.
6. A. Garulli and D. Henrion. Positive polynomials in Control. Springer Lecture Notes in Computer Science, to appear, 2004.
7. M. Gasca and T. Sauer. Polynomial interpolation in several variables. Adv. Comput. Math., 12(4):377-410, 2000.
8. Y. Genin, Y. Hachez, Y. Nesterov, and P. V. Dooren. Optimization problems over positive pseudopolynomial matrices. SIAM J. Matrix Anal. Appl. 25(1):57-79 (electronic), 2003.
9. th IEEE Conference on Decision and Control, pages 4676-4681, 2003.
10. J. B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM J. Optim., 11(3):796-817, 2001.
11. J. Löfberg. YALMIP 3, 2004. http://control.ee.ethz.ch/~joloef/ yalmip.msql.
12. B. Mourrain and V. Y. Pan. Multivariate polynomials, duality, and structured matrices. J. Complexity, 16(1):110-180, 2000. Real computation and complexity (Schloss Dagstuhl, 1998).
13. B. Mourrain and V. Y. Pan. Multivariate polynomials, duality, and structured matrices. J. Complexity, 16(1):110-180, 2000. Real computation and complexity (Schloss Dagstuhl, 1998).
14. th IEEE Conference on Decision and Control, 2002.
15. th IEEE Conference on Decision and Control, 2003.
16. P. A. Parrilo. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology, May 2000. Available at http://www.cds.caltech.edu/ ~pablo/.
17. P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Math. Prog., 96(2, Ser. B):293-320, 2003.
18. S. Prajna and A. Papachristodoulou. Analysis of switched and hybrid systems - beyond piecewise quadratic methods. In Proceedings of the American Control Conference, 2003.
19. S. Prajna, A. Papachristodoulou, and P. A. Parrilo. SOSTOOLS: Sum of squares optimization toolbox for MATLAB, 2002. Available from http://www.cds.caltech.edu/sostools and http://control.ee.ethz.ch/~parrilo/ sostools.
20. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, Mar. 1996.