GloptiPoly: Global Optimization over Polynomials with Matlab and SeDuMi

ACM Transactions on Mathematical Software

Volumn 29, Issue 2, 2003, Pages 165-194

  Henrion, Didier ^a,b   Lasserre, Jean Bernard ^a  

^a LAAS CNRS   (France)

^b INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

Author keywords

Linear matrix inequality; Matlab; Polynomial programming; SeDuMi; Semidefinite programming

Indexed keywords

LINEAR MATRIX INEQUALITY (LMI); MATLAB; POLYNOMIAL PROGRAMMING; SEDUMI; SEMIDEFINITE PROGRAMMING (SDP);

COMPUTATIONAL METHODS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; USER INTERFACES;

COMPUTER SOFTWARE;

EID: 2542587541     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/779359.779363     Document Type: Article

References (24)

1. ANJOS, M. 2001. New convex relaxations for the maximum cut and VLSI layout problems. Ph.D. dissertation. Waterloo University, Waterloo, Ont., Canada. See orion.math.uwaterloo.ca/̃hwolkowi.
2. BEN-SAAD, S. 1989. An algorithm for a class of nonlinear nonconvex optimization problems. Ph.D. dissertation. University of California, Los Angeles, CA.
3. BONDYFALAT, D., MOURRAIN, B., AND PAN, V. Y. 2000. Computation of a specified root of a polynomial system of equations using eigenvectors. Linear Algebra and its Applications, 319, 1-3, 193-209.
4. CORLESS, R. M., GIANNI, P. M., AND TRAGER, B. M. 1997. A reordered schur factorization method for zero-dimensional polynomial systems with multiple roots. In Proceedings of the ACM International Symposium on Symbolic and Algebraic Computation (Maui, HI). 133-140.
5. DIXON, L. C. W. AND SZEGÖ, G. P. 1975. Towards global optimization. North-Holland, Amsterdam, The Netherlands.
6. FLOUDAS, C. A., PARDALOS, P. M., ADJIMAN, C. S., ESPOSITO, W. R., GÜMÜS, Z. H., HARDING, S. T., KLEPEIS, J. L., MEYER, C. A., AND SCHWEIGER, C. A. 1999. Handbook of Test Problems in Local and Global Optimization. Kluwer, Dordrecht, The Netherlands. See titan-princeton.edu/TestProblems
7. GOEMANS, M. X. AND WILLIAMSON, D. P. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 6, 1115-1145.
8. HENRION, D., TARBOURIECH, S., AND ARZELIER, D. 2001. LMI approximations for the radius of the intersection of ellipsoids. J. Opt. Theory Appl. 108, 1, pp. 1-28.
9. LASSERRE, J. B. 2001. Global optimization with polynomials and the problem of moments. SIAM J. Opt. 11, 3, 796-817.
10. LASSERRE, J. B. 2002a. An explicit equivalent positive semidefinite program for 0-1 nonlinear programs. SIAM J. Opt. 12, 3, 756-769.
11. LASSERRE, J. B. 2002b. Polynomials nonnegative on a grid and discrete optimization. Trans. Amer. Math. Soc. 354, 2, 631-649.
12. NESTEROV, Y. 2000. Squared functional systems and optimization problems. In High Performance Optimization, H. Frenk, K. Roos, and T. Terlaky (Eds.). Kluwer, Dordrecht, The Netherlands, Chap. 17, 405-440.
13. PARRILO, P. A. 2000. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. dissertation. California Institute of Technology, Pasadena, CA. See www.control.ethz.ch/̃parrilo.
14. PARRILO, P. A. 2003. Semidefinite programming relaxations for semialgebraic problems. Math. Program. Ser. B 96, 2, 293-320.
15. PUTINAR, M. 1993. Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42, 3, 969-984.
16. SHERALI, H. D. AND ADAMS, W. P. 1990. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discr. Math. 3, 3, 411-430.
17. SHERALI, H. D. AND ADAMS, W. P. 1999. A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer, Dordrecht, The Netherlands.
18. SHOR, N. Z. 1987. Quadratic optimization problems. Tekhn. Kibernet. 1, 128-139.
19. SHOR, N. Z. 1998. Nondifferentiable optimization and polynomial problems. Kluwer, Dordrecht, The Netherlands.
20. SOLAND, R. M. 1971. An algorithm for separable nonconvex programming problems-II: Nonconvex constraints. Manag. Sci. 17, 759-773.
21. STURM, J. F. 1999. Using SeDuMi 1.02, a Matlab Toolbox for Optimization over Symmetric Cones. Opt. Meth. Softw. 11-12, 625-653. Version 1.05 available at fewcal.kub.nl/sturm.
22. THE MATHWORKS INC. 2001. Matlab version 6.1. The Mathworks Inc., Natick, MA. See www.mathworks.com.
23. VANDENBBRGHE, L. AND BOYD, S. 2001. Semidefinite programming. SIAM Rev. 38, 1 (March), 49-95.
24. WATERLOO MAPLE SOFTWARE INC. 2001. Maple V release 5. Waterloo, Ont., Canada. See www. maplesoft.com.