Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems.

Henry Wolkowicz

Published in: System Modelling and Optimization (1999)

Keyphrases

semidefinite
semidefinite programming
sufficient conditions
convex relaxation
interior point methods
higher dimensional
optimal solution
convex sets
numerical methods
feature extraction
training data
knn
linear program
globally optimal
finite dimensional