Convergent SDP-Relaxations in Polynomial Optimization with Sparsity.
Jean B. LasserrePublished in: SIAM J. Optim. (2006)
Keyphrases
- semidefinite
- convex relaxation
- semi definite programming
- semidefinite programming
- sparse approximation
- optimization algorithm
- global optimization
- quadratically constrained quadratic
- semi infinite
- sufficient conditions
- linear programming
- optimization problems
- multi objective
- combinatorial optimization
- high dimensional
- convex optimization
- optimization process
- semi supervised learning
- data points
- evolutionary algorithm