Robust SOS-convex polynomial optimization problems: exact SDP relaxations.
Vaithilingam JeyakumarGuoyin LiJosé Vicente-PérezPublished in: Optim. Lett. (2015)
Keyphrases
- optimization problems
- semidefinite
- convex relaxation
- semi definite programming
- positive semidefinite
- convex programming
- evolutionary algorithm
- semidefinite programming
- optimization methods
- linear programming
- convex optimization
- metaheuristic
- lower bound
- global optimality
- globally optimal
- traveling salesman problem
- nonlinear programming
- convex optimization problems
- semi infinite
- computationally simple