Exploiting symmetries in SDP-relaxations for polynomial optimization

Cordian Riener Thorsten Theobald Lina Jansson Andrén Jean B. Lasserre

Published in: CoRR (2011)

Keyphrases

semidefinite
convex relaxation
semidefinite programming
optimization problems
optimization algorithm
semi definite programming
lower bound
global optimization
semi infinite
neural network
globally optimal
quadratically constrained quadratic
feature selection
multi label
convex optimization
symmetry breaking