A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones.
Masakazu KojimaMasakazu MuramatsuPublished in: Comput. Optim. Appl. (2009)
Keyphrases
- optimization problems
- semidefinite
- symmetric matrix
- semidefinite programming
- linear programming
- positive semidefinite
- evolutionary algorithm
- objective function
- semi definite programming
- metaheuristic
- cost function
- convex relaxation
- high dimensional
- lower bound
- traveling salesman problem
- sparse representation
- sparse data
- combinatorial optimization
- optimization methods
- interior point methods
- compressive sensing
- np hard
- knapsack problem
- convex optimization
- sparse coding
- sufficient conditions