A rounding procedure for semidefinite optimization.

Ali Mohammad Nezhad Tamás Terlaky

Published in: Oper. Res. Lett. (2019)

Keyphrases

semidefinite
semidefinite programming
convex relaxation
sufficient conditions
linear programming
interior point methods
higher dimensional
support vector
training data
high dimensional
optimization problems
linear program
convex optimization
approximation algorithms
convex sets
linear programming relaxation