GloptiPoly 3: Moments, optimization and semidefinite programming

Optimization Methods and Software

Volumn 24, Issue 4-5, 2009, Pages 761-779

  Henrion, Didier ^a,b   Lasserre, Jean Bernard ^a,c   Lofberg, Johan ^d  

^a UNIVERSITÉ DE TOULOUSE   (France)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^c INSTITUT DE MATHÉMATIQUES DE TOULOUSE   (France)

^d LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Global optimization; Moments; Polynomials; Semidefinite programming

Indexed keywords

MOMENTS; SEMIDEFINITE PROGRAMMING;

GLOBAL OPTIMIZATION; MATLAB;

OPTIMIZATION;

EID: 68949115889     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780802699201     Document Type: Article

References (14)

1. N.I. Akhiezer, The Classical Moment Problem, Hafner, NewYork, 1965.
2. N.I. Akhiezer and M.G. Krein, Some questions in the theory of moments, vol.2, Translations of Mathematical Monographs, American Mathematical Society, Providence, RI (1962).
3. D. Henrion and J.B. Lasserre, GloptiPoly: global optimization over polynomials with Matlab and SeDuMi, ACM Trans. Math. Software 29(2) (2003), pp. 165-194.
4. D. Henrion and J.B. Lasserre, Solving global optimization problems over polynomials with GloptiPoly 2.1, in Global Optimization and Constraint Satisfaction, C. Bliek, C. Jermann, and A. Neumaier, eds., Lecture Notes on Computer Science, vol. 2861, Springer, Berlin, 2003, pp. 45-58.
5. D. Jibetean and E. de Klerk, Global optimization of rational functions: a semidefinite programming approach, Math. Program. 106 (2006), pp. 93-109.
6. H.J. Landau, Moments in mathematics, in Proceedings of Symposium on Applied Mathematics 37, H. J. Landau, ed., American Mathematical Society, Providence, RI, 1980.
7. J.B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM J. Optim. 11(3) (2001), pp. 796-817.
8. J.B. Lasserre, Convergent SDP relaxations in polynomial optimization with sparsity, SIAM J. Optim. 17(3) (2006), pp. 822-843.
9. J.B. Lasserre, A semidefinite programming approach to the generalized problem of moments, Math. Program. 112 (2008), pp. 65-92.
10. J.B. Lasserre, D. Henrion, C. Prieur, and E. Trélat, Nonlinear optimal control via occupation measures and LMI relaxations, SIAM J. Control Optim. 47(4) (2008), pp. 1643-1666.
11. M. Laurent, Sums of squares, moment matrices and optimization over polynomials, in Emerging Applications of Algebraic Geometry, M. Putinar and S. Sullivant, eds., IMAVolumes in Mathematics and its Applications, Vol. 149, Springer, Berlin, 2009, pp. 157-270.
12. J. Löfberg, YALMIP: a toolbox for modeling and optimization in Matlab, Proceedings of the IEEE Symposium on Computer-Aided Control System Design (CACSD), Taipei, Taiwan, 2004. Available at http://control.ee.ethz.ch/ ̃joloef/yalmip.php.
13. J.F. Sturm, SeDuMi version 1.1R3, 2006. Available at http://sedumi.ie.lehigh.edu.
14. H. Waki, S. Kim, M. Kojima, and M. Muramatsu, SparsePOP: a sparse semidefinite programming relaxation of polynomial optimization problems, ACM Trans. Math. Software 35(2) (2008), 15:1-15:13.