Sufficient conditions for a real polynomial to be a sum of squares

Archiv der Mathematik

Volumn 89, Issue 5, 2007, Pages 390-398

  Lasserre, Jean B ^a  

^a LAAS CNRS   (France)

Author keywords

Positive polynomials; Real algebraic geometry; Sum of squares

Indexed keywords

EID: 38649087058     PISSN: 0003889X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00013-007-2251-y     Document Type: Article

References (9)

1. A. BEN-TAL AND A. NEMIROVSKI, Lectures on Modern Convex Optimization, SIAM, Philadelphia, 2001.
2. J. W. HELTON AND V. VINNIKOV, Linear matrix inequality representation of sets, Technical report. Mathematic Dept., University of California, at San Diego, USA, 2004. arXiv:math.OC/0306180 v1.
3. J. B. LASSERRE, Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796-817 (2001).
4. J. B. LASSERRE, A sum of squares approximation of nonnegative polynomials. SIAM J. Optim. 16, 751-765 (2006).
5. J. B. LASSERRE, Conditions for a real polynomial to be sum of squares. Technical report, LAAS, Toulouse, France, 2006.
6. J. B. LASSERRE AND T. NETZER, SOS approximation of nonnegative polynomial via simple high degree perturbations. Math. Z. 256, 99-112 (2006).
7. A. S. LEWIS, P. PARRILO AND M. V. RAMANA, The Lax conjecture is true. Proc. Am. Math. Soc. 133, 2495-2499 (2005).
8. P. A. PARRILO, Semidefinite programming relaxations for semialgebraic problems. Math. Progr. Ser. B 96, 293-320 (2003).
9. M. SCHWEIGHOFER, Optimization of polynomials on compact semialgebraic sets. SIAM J. Optim. 15, 805-825 (2005).