Generalized lagrangian duals and sums of squares relaxations of sparse polynomial optimization blems

SIAM Journal on Optimization

Volumn 15, Issue 3, 2005, Pages 697-719

  Kim, Sunyoung ^a   Kojima, Masakazu ^b   Waki, Hayato ^a  

^a Ewha Womans University   (South Korea)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Global optimization; Lagrangian dual; Lagrangian relaxation; Polynomial optimization problem; Semidefinite program; Semidefinite program relaxation; Sparsity; Sums of squares optimization

Indexed keywords

APPROXIMATION THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; NUMERICAL ANALYSIS; POLYNOMIALS;

LAGRAGIAN DUAL; LAGRAGIAN RELAXATION; POLYNOMIAL OPTIMIZATION PROBLEMS; SEMIDEFINITE PROGRAM; SEMIDEFINITE PROGRAM RELAXATION; SPARSITY; SUMS OF SQUARES OPTIMIZATION;

OPTIMIZATION;

EID: 23844439934     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/030601260     Document Type: Article

References (21)

1. E. BALAS, S. CERIA, AND G. CORNUÉJOLS, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Math. Program., 58 (1993), pp. 295-323.
2. M. D. CHOI, T. Y. LAM, AND B. REZNICK, Sums of squares of real polynomials, in k-theory and Algebra Geometry: Connections with Quadratic Forms and Division Algebras, Proc. Sympos. Pure Math, 58 Part 2, AMS, Providence RI, 1995, pp. 103-126.
3. D. HENRION AND J. B. LASSERRE, GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi, ACM Trans. Math. Software, 29 (2003), pp. 165-194.
4. S. KIM AND M. KOJIMA, Second order cone programming relaxation of nonconvex quadratic optimization problems, Optim. Method Softw., 15 (2001), pp. 201-224.
5. S. KIM AND M. KOJIMA, Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations, Comput. Optim. Appl., 26 (2003), pp. 143-154.
6. M. KOJIMA, S. KIM, AND H. WAKI, A general framework for convex relaxation of polynomial optimization problems over cones, J. Oper. Res. Soc. Japan, 46 (2003), pp. 125-144.
7. M. KOJIMA, S. KIM, AND H. WAKI, Sparsity in Sums of Squares of Polynomials, Research Report B-391, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Meguro, Tokyo 2003.
8. M. KOJIMA AND L. TUNÇEL, Cones of matrices and successive convex relaxations of nonconvex sets, SIAM J. Optim., 10 (2000), pp. 750-778.
9. M. KOJIMA AND L. TUNÇEL, Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization problems, Math. Program., 89 (2000), pp. 79-111.
10. J. B. LASSERRE, Global optimization with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
11. L. LOVÁSZ, AND A. SCHRIJVER, Cones of matrices and set functions and 0-1 optimization, SIAM J. Optim., 1 (1991), pp. 166-190.
12. R. D. C. MONTEIRO, First- and second-order methods for semidefinite programming, Math. Program., 97 (2003), pp. 209-244.
13. P. A. PARRILO, Semidefinite programming relaxations for semialgebraic problems, Math. Program., 96 (2003), pp. 293-320.
14. S. PRAJNA, A. PAPACHRISTODOULOU, AND P. A. PARRILO, SOSTOOLS: Sum of Squares Optimization Toolbox for MATLAB - User's Guide, Control and Dynamical Systems, California Institute of Technology, Pasadena, CA, 2002. Available online at http://www.eds.caltech.edu/sostools
15. V. POWERS AND T. WÖRMANN, An algorithm for sums of squares of real polynomials, J. Pure Appl. Algebra, 127 (1998), pp. 99-104.
16. M. PUTINAR, Positive polynomials on compact semi-algebraic sets, Indiana U. Math. J., 42 (1993), pp. 969-984.
17. B. REZNICK, Extremal psd forms with few terms, Duke Math. J., 45 (1978), pp. 363-374.
18. H. D. SHERALI AND W. P. ADAMS, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math., 3 (1990), pp. 411-430.
19. H. D. SHERALI AND C. H. TUNCBILEK, A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, J. Global Optim., 2 (1992), pp. 101-112.
20. H. D. SHERALI AND W. P. ADAMS, A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems, Discrete Appl. Math., 52 (1994), pp. 83-106.
21. M. YAMASHITA, K. FUJISAWA, AND M. KOJIMA, Implementation and evaluation of SDPA 6.0 (semidefinite programming algorithm 6.0), Optim. Method Softw., 18 (2003), pp. 491-505.