A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones

Computational Optimization and Applications

Volumn 42, Issue 1, 2009, Pages 31-41

  Kojima, Masakazu ^a   Muramatsu, Masakazu ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Conic program; Euclidean Jordan algebra; Global optimization; Polynomial optimization problem; Semidefinite program; Sum of squares; Symmetric cone

Indexed keywords

ALGEBRA; OPTIMIZATION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SEMICONDUCTOR SWITCHES;

CONIC PROGRAM; EUCLIDEAN JORDAN ALGEBRA; POLYNOMIAL OPTIMIZATION PROBLEM; SEMIDEFINITE PROGRAM; SUM OF SQUARES; SYMMETRIC CONE;

GLOBAL OPTIMIZATION;

EID: 58149506266     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9112-2     Document Type: Article

References (13)

1. Blair, J.R.S., Peyton, B.: An introduction to chordal graphs and clique trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation, pp. 1-29. Springer, New York (1993)
2. Faraut, J., Korányi, A.: Analysis on Symmetric Cones. Oxford University Press, New York (1994)
3. D. Henrion J.B. Lasserre 2006 Convergent relaxations of polynomial matrix inequalities and static output feedback IEEE Trans. Autom. Contr. 51 192 202
4. Hol, C.W.J., Scherer, C.W.: Sum of squares relaxations for polynomial semidefinite programming, In: Proc. Symp. on Mathematical Theory of Networks and Systems (MTNS), Leuven, Belgium (2004)
5. S. Kim M. Kojima H. Waki 2005 Generalized Lagrangian duals and sums of squares relaxations of sparse polynomial optimization problems SIAM J. Optim. 15 697 719
6. M. Kojima S. Kim H. Waki 2005 Sparsity in sums of squares of polynomials Math. Program. 103 45 62
7. Kojima, M.: Sums of squares relaxations of polynomial semidefinite programs. B-397, Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, November 2003
8. M. Kojima M. Muramatsu 2007 An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones Math. Program. 110 315 336
9. J.B. Lasserre 2007 Global optimization with polynomials and the problems of moments SIAM J. Optim. 11 796 817
10. J.B. Lasserre 2006 Convergent SDP-relaxation in polynomial optimization with sparsity SIAM J. Optim. 17 822 843
11. P.A. Parrilo 2003 Semidefinite programming relaxations for semialgebraic problems Math. Program. 96 293 320
12. M. Putinar 1993 Positive polynomials on compact semi-algebraic sets Indiana University Math. J. 42 969 984
13. H. Waki S. Kim M. Kojima M. Muramatsu 2006 Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity SIAM J. Optim. 17 218 242