-cut with semidefinite-based constraints.

Vilmar Jefté Rodrigues de Sousa Miguel F. Anjos Sébastien Le Digabel

Published in: EURO J. Comput. Optim. (2019)

Keyphrases

semidefinite
monotonicity property
semidefinite programming
sufficient conditions
convex sets
multi view
machine learning
special case
supervised learning
approximation algorithms
higher dimensional
convex relaxation
interior point methods