A Semidefinite Programming Hierarchy for Covering Problems in Discrete Geometry
Cordian Riener, Jan Rolfes, Frank Vallentin
AIMS on Numerical Analysis and Computation2025
Abstract
We present a new semidefinite programming hierarchy for covering problems in compact metric spaces. The method provides systematic upper bounds for covering numbers and applies to problems in discrete geometry, sphere packing, and optimization on compact groups.
Cite this publication
@article{cordianriener2025semidefinite,
author = {Cordian Riener and Jan Rolfes and Frank Vallentin},
title = {A Semidefinite Programming Hierarchy for Covering Problems in Discrete Geometry},
journal = {AIMS on Numerical Analysis and Computation},
year = {2025},
doi = {10.3934/naco.2025015},
eprint = {2312.11267},
archivePrefix = {arXiv}
}