Degeneracy in maximal clique decomposition for Semidefinite Programs.

Arvind U. Raghunathan Andrew V. Knyazev

Published in: ACC (2016)

Keyphrases

semidefinite
maximal cliques
semidefinite programming
graph theory
sufficient conditions
complex networks
convex relaxation
graph theoretic
interior point methods
data mining
linear programming
convex sets
objective function
metaheuristic
globally optimal
fully connected