Convergent LMI relaxations for nonconvex quadratic programs

Proceedings of the IEEE Conference on Decision and Control

Volumn 5, Issue , 2000, Pages 5041-5046

  Lasserre, J B ^a  

^a LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; CONVERGENCE OF NUMERICAL METHODS; LINEARIZATION; MATRIX ALGEBRA; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION; POLYNOMIALS; QUADRATIC PROGRAMMING;

COMBINATORIAL OPTIMIZATION; LINEAR MATRIX INEQUALITY; NONCONVEX QUADRATIC PROGRAMMING;

NONLINEAR CONTROL SYSTEMS;

EID: 0034443972     PISSN: 01912216     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. The multidimensional moment problem and semi-groups
2. Recursiveness, positivity, and truncated moment problems
3. Hilbert's 17th problem and best dual bounds in quadratic minimization
4. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
5. A representation theorem for certain partially ordered commutative rings
6. On special representations of strictly positive polynomials
7. The global minimization of a polynomial is an easy convex problem
8. Global minimization with polynomials and the problem of moments
9. A collection of test problems for constrained global optimization algorithms
10. Positive polynomials on compact semi-algebraic sets
11. The K-moment problem for compact semi-algebraic sets
12. The classical moment problem as a self-adjoint finite difference operator
13. Quadratic optimization problems
14. Nondifferentiable optimization and polynomial problems
15. Semidefinite programming