A note on the representation of positive polynomials with structured sparsity

Archiv der Mathematik

Volumn 89, Issue 5, 2007, Pages 399-403

  Grimm, David ^a   Netzer, Tim ^a   Schweighofer, Markus ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

Positive polynomial; Sparse polynomial; Structured sparsity; Sum of squares

Indexed keywords

EID: 38649097540     PISSN: 0003889X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00013-007-2234-z     Document Type: Article

References (12)

1. n et décomposition de polynômes à plusieurs variables. J. Funct. Anal. 58, 254-266 (1984).
2. M. KOJIMA AND M. MURAMATSU, A Note on Sparse SOS and SDP Relaxations for Polynomial Optimization Problems over Symmetric Cones. Research Report B-421, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2006). http://www.optimization-online.org/DB_HTML/2006/ 01/1292.html
3. J. KRIVINE, Anneaux préordonnés. J. Anal. Math. 12, 307-326 (1964).
4. S. KUHLMANN AND M. PUTINAR, Positive polynomials on fibre products, preprint.
5. J. B. LASSERRE, Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796-817 (2001).
6. J. B. LASSERRE, Convergent semidefinite relaxations in polynomial optimization with sparsity. SIAM J. Optim. 17, 822-843 (2006).
7. J. NIE AND J. DEMMEL, Sparse SOS Relaxations for Minimizing Functions that are Summation of Small Polynomials, preprint. http://arxiv.org/abs/math.OC/0606476
8. A. PRESTEL AND C. DELZELL, Positive polynomials. Springer Monographs in Mathematics (2001).
9. M. PUTINAR, Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42(3), 969-984 (1993).
10. K. SCHMÜDGEN, The K-moment problem for compact semi-algebraic sets. Math. Ann. 289, 203-206 (1991).
11. M. SCHWEIGHOFER, Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15(3), 805-825 (2005).
12. H. WAKI, S. KIM, M. KOJIMA, AND M. MURAMATSU, Sums of Squares and Semidefinite Programming Relaxations for Polynomial Optimization Problems with Structured Sparsity. SIAM J. Optim. 17(1), 218-242 (2006).