On an SDP relaxation for kissing number
Résumé
We demonstrate that an earlier semidefinite-programming relaxation for the kissing-number problem cannot provide good upper bounds. Furthermore , we show the existence of an optimal solution for this relaxation that cannot be used as a basis for establishing a good lower bound.
Domaines
Recherche opérationnelle [math.OC]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...