An explicit exact SDP relaxation for nonlinear 0-1 programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 293-303

  Lasserre, Jean B ^a  

^a LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; NONLINEAR PROGRAMMING; OPTIMAL SYSTEMS;

NON-LINEAR OPTIMIZATION PROBLEMS; OPTIMAL SOLUTIONS; OPTIMAL VALUES; POSITIVE SEMIDEFINITE; SDP RELAXATION;

INTEGER PROGRAMMING;

EID: 39649093787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_23     Document Type: Conference Paper

References (10)

1. Curto, R.E, Fialkow, L.A.: The truncated complex-moment problem. Trans. Amer. Math. Soc. 352 (2000) 2825-2855.
2. Jacobi, T., Prestel, A.: On special representations of strictly positive polynomials. Technical-report, Konstanz University, Germany (2000).
3. Kojima, M., Tuncel, L.: Cones of matrices and successive convex relaxations of non convex sets. SIAM J. Optim. 10 (2000) 750-778.
4. Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11 (2001) 796-817.
5. Lasserre, J.B.: Optimality conditions and LMI relaxations for 0-1 programs. Technical report #00099, LAAS-CNRS Toulouse, France (2000).
6. Lasserre, J.B.: New LMI relaxations for the general nonconvex quadratic problem. In: Advances in Convex Analysis and Global Optimization, Eds: N. Hadjisavvas and P.M. Pardalos, Kluwer Academic Publishers, 2001.
7. Lovasz, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 (1991) 166-190.
8. Putinar, M.: Positive polynomials on compact semi-algebraic sets. Ind. Univ. Math. J. 42 (1993) 969-984.
9. Schmudgen, K.: The K-moment problem for compact semi-algebraic sets. Math. Ann. 289 (1991) 203-206.
10. Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programmimg problems. SIAM J. Disc. Math. 3 (1990) 411-430.