Semidefinite programming vs. LP relaxations for polynomial programming

Mathematics of Operations Research

Volumn 27, Issue 2, 2002, Pages 347-360

  Lasserre, Jean B ^a  

^a LAAS CNRS   (France)

Author keywords

Global optimization; LP relaxations; Real algebraic geometry; Semidefinite relaxations

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CONSTRAINT THEORY; LINEAR ALGEBRA; LINEARIZATION; POLYNOMIALS; PROBLEM SOLVING;

BRANCH-AND-BOUND ALGORITHM; POLYNOMIAL PROGRAMMING; REFORMULATION LINEARIZATION TECHNIQUE; SEMIDEFINITE PROGRAMMING;

LINEAR PROGRAMMING;

EID: 0036577765     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.27.2.347.322     Document Type: Article

References (32)

1. A tight linearization and an algorithm for zero-one quadratic programming problems
2. A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
3. A numerical comparison between two approaches to nonlinear programming problems
4. The multidimensional moment problem and semi-groups
5. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
6. Recursiveness, positivity, and truncated moment problems
7. The truncated complex K-moment problem
8. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
9. Representing polynomials by positive linear functions on compact convex polyhedra
10. Distinguished representations of strictly positive polynomials
11. Cones of matrices and successive convex relaxations of non convex sets
12. Optimality conditions and LMI relaxations for 0-1 programs
13. The global optimization of a polynomial is an easy convex problem
14. Global optimization with polynomials and the problem of moments
15. An explicit exact SDP relaxation for nonlinear 0-1 programs
16. A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming
17. Cones of matrices and set-functions and 0-1 optimization
18. Squared functional systems and optimization problems
19. Polynomials that are positive on an interval
20. A new bound for Pólya's theorem with applications to polynomials positive on polyhedra
21. Positive polynomials on compact semi-algebraic sets
22. The K-moment problem for compact semi-algebraic sets
23. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems
24. Enhancing RLT relaxations via a new class of semidefinite cuts
25. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
26. New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
27. The problem of moments
28. The classical moment problem as a self-adjoint finite difference operator
29. Quadratic optimization problems
30. Semidefinite programming
31. On formulating semidefinite programming problems as smooth convex nonlinear optimization problems