Sign in
A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs.
Thai Doan Chuong
V. Jeyakumar
Guoyin Li
Published in:
J. Glob. Optim. (2019)
Keyphrases
</>
convex relaxation
convex optimization
globally optimal
semidefinite
bounded degree
semi algebraic
linear programming
multi label
graph theoretic
multiple kernel learning
spatial databases
optimization problems
quadratically constrained quadratic
arbitrary dimension
lower bound