Optimality of spherical codes via exact semidefinite programming bounds.

Henry Cohn David de Laat Nando Leijenhorst

Published in: CoRR (2024)

Keyphrases

semidefinite programming
linear programming
interior point methods
semidefinite
optimal solution
lower bound
upper bound
primal dual
kernel matrix
worst case
maximum margin
pairwise
active learning
bayesian networks
high dimensional
np hard