On Semidefinite Programming Relaxations of (2+p)-SAT.

Etienne de Klerk Hans van Maaren

Published in: Ann. Math. Artif. Intell. (2003)

Keyphrases

semidefinite programming
semidefinite
linear programming
quadratically constrained quadratic
interior point methods
semi infinite
kernel matrix
primal dual
linear program
lower bound
dynamic programming
maximum margin
convex relaxation
np hard
nearest neighbor
principal component analysis