Moments and sums of squares for polynomial optimization and related problems

Journal of Global Optimization

Volumn 45, Issue 1, 2009, Pages 39-61

  Lasserre, Jean B ^a  

^a LAAS CNRS   (France)

Author keywords

Measures; Moments

Indexed keywords

CONVEX ENVELOPE; MEASURES; MOMENT PROBLEMS; MOMENTS; NON-NEGATIVE POLYNOMIALS; POLYNOMIAL OPTIMIZATION; POSITIVE POLYNOMIALS; RATIONAL FUNCTION; SEMIDEFINITE PROGRAMMING RELAXATIONS; SUMS OF SQUARES; SYSTEM OF POLYNOMIAL EQUATIONS;

FUNCTION EVALUATION;

POLYNOMIALS;

EID: 68549094630     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-008-9394-7     Document Type: Article

References (39)

1. Akhiezer N.I.: The Classical Moment Problem. Hafner, New York (1965)
2. Akhiezer, N.I., Krein, M.G.: Some questions in the theory of moments. Translation of Mathematical Monographs, vol. 2. American Mathematical Society, Providence, R.I. (1962)
3. Ash R.: Real Analysis and Probability. Academic Press, San Diego (1972)
4. Berg, C.: The multidimensional moment problem and semi-groups. In: Landau, H.J. (ed.) Moments in Mathematics. Proceedings of Symposia in Applied Mathematics, vol. 37, pp. 110-124. American Mathematical Society, Providence (1980)
5. G. Blekherman 2006 There are significantly more nonnegative polynomials than sums of squares Israel J. Math. 153 355 380
6. R.E. Curto L.A. Fialkow 2000 The truncated complex K-moment problem Trans. Am. Math. Soc. 352 2825 2855
7. D. Henrion J.B. Lasserre 2003 GloptiPoly : global optimization over polynomials with Matlab and SeDuMi ACM Trans. Math. Softw. 29 165 194 (Pubitemid 40001449)
8. Henrion D., Lasserre J.B.: Solving global optimization problems over polynomials with GloptiPoly 21. In: Bliek, C., Jermann, C., Neumaier, R.(eds) Global Optimization and Constraint Satisfaction. Lecture Notes on Computer Sciences, pp. 43-58. Springer Verlag, Berlin (2003)
9. Henrion D., Lasserre J.B. (2005) Detecting global optimality and extracting solutions in GloptiPoly. In: Henrion D., Garulli R. (eds.) Positive Polynomials in Control. Lecture Notes on Control and Information Sciences, pp. 293-310. Springer Verlag
10. Henrion, D., Lasserre, J.B., Lofberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming, Optim. Methods Softw. (to appear)
11. T. Jacobi A. Prestel 2001 Distinguished representations of strictly positive polynomials J. Reine Angew. Math. 532 223 235
12. D. Jibetean E. de Klerk 2006 Global optimization of rational functions: a semidefinite programming approach Math. Prog. A 106 93 109
13. Landau, H.J. (ed.): Moments in Mathematics. In: Proceedings of Symposia in Applied Mathematics, vol. 37. American Mathematical Society, Providence (1980)
14. R. Laraki J.B. Lasserre 2008 Computing uniform convex approximations for convex envelopes and convex hulls J. Conv. Anal. 15 635 654
15. J.B. Lasserre 2000 Optimisation globale et théorie des moments C. R. Acad. Sci. Paris Série I Math. 331 929 934
16. J.B. Lasserre 2001 Global optimization with polynomials and the problem of moments SIAM J. Optim. 11 796 817
17. J.B. Lasserre 2005 S.o.s. approximations of a polynomial nonnegative on a real algebraic set SIAM J. Optim. 16 610 628
18. J.B. Lasserre 2006 Convergent semidefinite relaxations in polynomial optimization with sparsity SIAM J. Optim. 17 822 843
19. Lasserre, J.B.: A sum of squares approximation of nonnegative polynomials. SIAM J. Optim. 16, 751-765 (2006).
20. Also in: SIAM Review 49, 651-669 (2007)
21. J.B. Lasserre 2008 A Semidefinite programming approach to the generalized problem of moments Math. Program. 112 65 92
22. J.B. Lasserre T. Netzer 2007 SOS approximations of nonnegative polynomials via simple high degree perturbations Math. Zeitschrift. 256 99 112
23. J.B. Lasserre M. Laurent P. Rostalski 2008 Semidefinite characterization and computation of zero-dimensional real radical ideals Found. Comp. Math. 8 607 647
24. M. Laurent 2005 Revisiting two theorems of Curto and Fialkow on moment matrices Proc. Am. Math. Soc. 133 2965 2976
25. P.H. Maserick C. Berg 1984 Exponentially bounded positive definite functions Ill. J. Math. 28 162 179
26. Mourrain, B., Trébuchet, P.: Generalized normal forms and polynomials system solving. In: Proceedings of the ISSAC 2005 Conference, Hamilton, Canada (2005)
27. H.D. Mittelmann 2003 An independent benchmarking of SDP and SOCP solvers Math. Program. 95 407 430
28. A.E. Nussbaum 1966 Quasi-analytic vectors Ark. Mat. 6 179 191
29. Parrilo, P.A.: Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. Ph.D. thesis, California Institute of Technology, Pasadena, CA (2000)
30. P.A. Parrilo 2003 Semidefinite programming relaxations for semialgebraic problems Math. Program. 96 293 320
31. L.C. Petersen 1982 On the relation between the multidimensional moment problem and the one dimensional moment problem Math. Scand. 51 361 366
32. M. Putinar 1993 Positive polynomials on compact semi-algebraic sets Indiana Univ. Math. J. 42 969 984
33. Reid, G., Zhi, L.: Solving nonlinear polynomial system via symbolic-numeric elimination method. In: Faugère, J.C., Rouillier, F. (eds.) Proceedings of the International Conference on Polynomial System Solving, pp. 50-53 (2004)
34. F. Rouillier 1999 Solving zero-dimensional systems through the rational univariate representation J. Appl. Alg. Eng. Comm. Comp. 9 433 461
35. K. Schmüdgen 1991 The K-moment problem for compact semi-algebraic sets Math. Ann. 289 203 206
36. Sommese A.J., Wampler C.W.: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science. World Scientific Press, Singapore (2005)
37. J.F. Sturm 1999 Using SeDuMi 1.02, a Matlab Toolbox for optimization over symmetric cones Optim. Meth. Softw. 11-12 625 653
38. J. Verschelde 1999 Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation ACM Trans. Math. Softw. 25 251 276
39. S. Waki S. Kim M. Kojima M. Maramatsu 2006 Sums of squares and semidefinite programming relaxations for polynomial optimization problems witth structured sparsity SIAM J. Optim. 17 218 242