Login / Signup
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness.
Vaithilingam Jeyakumar
T. S. Pham
Guoyin Li
Published in:
Oper. Res. Lett. (2014)
Keyphrases
</>
semidefinite
semidefinite programming
semi definite programming
convex relaxation
sufficient conditions
convex sets
interior point methods
convex optimization
higher dimensional
convergence rate
linear programming
globally optimal
feature selection
multi label
quadratic programming
finite dimensional