Sign in
A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems.
N. H. Chieu
Vaithilingam Jeyakumar
Guoyin Li
Published in:
Oper. Res. Lett. (2017)
Keyphrases
</>
optimization problems
class hierarchy
linear programming
evolutionary algorithm
semidefinite
global image statistics
semidefinite programming
cost function
metaheuristic
quadratically constrained quadratic
objective function
support vector
active learning
higher level
hierarchical structure
partial occlusion