Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization.
Cordian RienerThorsten TheobaldLina Jansson AndrénJean B. LasserrePublished in: Math. Oper. Res. (2013)
Keyphrases
- semidefinite
- semi definite programming
- convex relaxation
- semidefinite programming
- linear programming
- semi infinite
- optimization algorithm
- global optimization
- quadratically constrained quadratic
- lower bound
- convex optimization
- optimization method
- optimization methods
- optimization process
- kernel function
- sufficient conditions
- optimization problems
- markov random field
- feature selection