An explicit equivalent positive semidefinite program for nonlinear 0-1 programs

SIAM Journal on Optimization

Volumn 12, Issue 3, 2002, Pages 756-769

  Lasserre, Jean B ^a  

^a LAAS CNRS   (France)

Author keywords

Integer programming; Moment problem; Real algebraic geometry; Semidefinite programming

Indexed keywords

EID: 0036351765     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623400380079     Document Type: Article

References (15)

1. Recursiveness, positivity, and truncated moment problems
2. The truncated complex K-moment problem
3. A representation theorem for certain partially ordered commutative rings
4. Distinguished representations of strictly positive polynomials
5. Cones of matrices and successive convex relaxations of nonconvex sets
6. Global optimization with polynomials and the problem of moments
7. Cones of matrices and set-functions and 0-1 optimization
8. Positive polynomials on compact semi-algebraic sets
9. The K-moment problem for compact semi-algebraic sets
10. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems
11. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems
12. The classical moment problem as a self-adjoint finite difference operator
13. Theory and algorithms of semidefinite programming