Pre- and post-processing sum-of-squares programs in practice

IEEE Transactions on Automatic Control

Volumn 54, Issue 5, 2009, Pages 1007-1011

  Löfberg, Johan ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Optimization methods; Polynomials; Software packages

Indexed keywords

CONVEX PROGRAMMING; ILL-CONDITIONED; IN-CONTROL; MATLAB TOOLBOXES; NON-NEGATIVITY; OPTIMIZATION METHODS; OPTIMIZATION PROBLEMS; POST PROCESS; POST PROCESSING; SEMIDEFINITE PROGRAMS; SUM OF SQUARES; TECHNICAL NOTES;

COMPUTER SOFTWARE; MATLAB; OPTIMIZATION; POLYNOMIALS;

CONVEX OPTIMIZATION;

EID: 67349187539     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2009.2017144     Document Type: Article

References (17)

1. M. D. Choi, T. Y. Lam, and B. Reznick, "Sums of squares of real polynomials," in Proc. Symp. Pure Math., 1995, vol. 58, pp. 103-126.
2. K. Gatermann and P. A. Parrilo, "Symmetry groups, semidefinite programs, and sums of squares," J. Pure Appl. Algebra, vol. 192, no. 1-3, pp. 95-128, 2004.
3. N. Giorgetti, GLPKMEX : A Matlab MEX Interface for the GLPK Library [Online]. Available: http://glpkmex.sourceforge.net/
4. D. Henrion and J. B. Lasserre, "Gloptipoly: Global optimization over polynomials with Matlab and SeDuMi," ACM Trans. Math. Software, vol. 29, no. 2, pp. 165-194, 2003.
5. J. Löfberg, "YALMIP: A toolbox for modeling and optimization in MATLAB," in Proc. CACSD Conf., Taipei, Taiwan, 2004 [Online]. Available: Control.ee.ethz.ch/~joloef/wiki/pmwiki.php
6. J. Löfberg, Block Diagonalization of Matrix-Valued Sum-of-Squares Programs Department of Electrical Engineering, Link oping University, Sweden, Tech. Rep. LiTH-ISY-R-2845, 2008.
7. K. Murota, Y. Kanno, M. Kojima, and S. Kojima, A Numerical Algorithm for Block-Diagonal Decomposition of Matrix *-Algebras Department of Mathematical Informatics, The University of Tokyo, Tokyo, Japan, Tech. Rep. METR-2007-52, 2007.
8. P. A. Parrilo, "Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization," Ph.D. dissertation, California Institute of Technology, Pasadena, CA, 2000.
9. P. A. Parrilo and R. Peretz, "An inequality for circle packings proved by semidefinite programming," Discrete Computat. Geom., vol. 31, no. 3, pp. 357-367, Feb. 2004.
10. S. Prajna, A. Papachristodoulou, and P. A. Parrilo, "SOSTOOLS: A general purpose sum of squares programming solver," in Proc. 41th Conf. Decision Control, Las Vegas, NV, 2002, pp. 741-746.
11. B. Reznick, "Extremal PSD forms with few terms," Duke Math. J., vol. 45, no. 2, pp. 363-374, 1978.
12. B. Reznick, Sums of Even Powers of Real Linear Forms, Volume 96 of Memoirs of the American Mathematical Society. Providence, RI: American Mathematical Society, 1992.
13. J. Sjöberg, Computation of Upper Bound on the l2-Gain for Polynomial Differential-Algebraic Systems, Using Sum of Squares Decomposition Department of Electrical Engineering, Linkoping University, Sweden, Tech. Rep. LiTH-ISY-R-2806, 2007.
14. J. F. Sturm, "Using SeDuMi 1.02, aMATLAB toolbox for optimization over symmetric cones," Optim. Methods Software, vol. 11-12, no. 1-4, pp. 625-653, 1999.
15. L. Vandenberghe and S. Boyd, "Semidefinite programming," SIAM Rev. vol. 38, pp. 49-95, Mar. 1996.
16. H. Waki, S. Kim, M. Kojima, M. Muramatsu, and H. Sugimoto, Sparsepop: A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan, Tech. Rep. B-414, 2005.
17. G. M. Ziegler, Lectures on Polytopes. Graduate Texts in Mathematics New York: Springer-Verlag, 1994.