Maximum semidefinite and linear extension complexity of families of polytopes.

Gennadiy Averkov Volker Kaibel Stefan Weltge

Published in: Math. Program. (2018)

Keyphrases

semidefinite
semidefinite programming
sufficient conditions
interior point methods
convex relaxation
worst case
higher dimensional
computational complexity
convex sets
finite dimensional
machine learning
linear programming
multistage
multi label
singular value decomposition
convex optimization