The Semidefinite Relaxation of the k -Partition Polytope Is Strong.

Andreas Eisenblätter

Published in: IPCO (2002)

Keyphrases

semidefinite
semidefinite programming
convex relaxation
sufficient conditions
interior point methods
higher dimensional
linear programming
convex sets
pairwise
convex optimization
multistage
primal dual
convex hull
markov random field
special case
feature vectors
image segmentation