How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization.

Published in: Optim. Lett. (2012)

Keyphrases

semidefinite
semidefinite programming
convex relaxation
interior point methods
sufficient conditions
higher dimensional
convex sets
linear programming
machine learning
optimization method
optimal solution
multi label
optimization methods
globally optimal
finite dimensional