Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes.

Gennadiy Averkov Volker Kaibel Stefan Weltge

Published in: CoRR (2016)

Keyphrases

semidefinite
semidefinite programming
sufficient conditions
convex sets
interior point methods
higher dimensional
convex relaxation
worst case
finite dimensional
extreme points
feature selection
feature vectors
knn
linear programming
kernel matrix