A semidefinite programming hierarchy for packing problems in discrete geometry
From MaRDI portal
Publication:2349135
DOI10.1007/s10107-014-0843-4zbMath1328.90102arXiv1311.3789OpenAlexW2095694172MaRDI QIDQ2349135
David de Laat, Frank Vallentin
Publication date: 19 June 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.3789
infinite graphsLasserre hierarchymoment measuresgeometric packing problemsweighted independence number (stability number)
Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (12)
\(k\)-point semidefinite programming bounds for equiangular lines ⋮ A copositive formulation for the stability number of infinite graphs ⋮ Approximating the cone of copositive kernels to estimate the stability number of infinite graphs ⋮ A Note on Lattice Packings via Lattice Refinements ⋮ Moment methods in energy minimization: New bounds for Riesz minimal energy problems ⋮ Sphere packing and quantum gravity ⋮ Exact Semidefinite Programming Bounds for Packing Problems ⋮ Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held June 2--8, 2019 ⋮ Globally Optimizing Small Codes in Real Projective Spaces ⋮ Dual bounds for the positive definite functions approach to mutually unbiased bases ⋮ The density of sets avoiding distance 1 in Euclidean space ⋮ Complete positivity and distance-avoiding sets
Uses Software
Cites Work
This page was built for publication: A semidefinite programming hierarchy for packing problems in discrete geometry
