Login / Signup
A recipe for semidefinite relaxation for (0, 1)-quadratic programming - In memory of Svata Poljak.
Svatopluk Poljak
Franz Rendl
Henry Wolkowicz
Published in:
J. Glob. Optim. (1995)
Keyphrases
</>
semidefinite
quadratic programming
interior point methods
linear programming
semidefinite programming
convex relaxation
support vector machine
higher dimensional
sufficient conditions
low dimensional
optimal solution
ls svm
multistage
convex sets
least squares
high dimensional
computational complexity