Exact Semidefinite Programming Bounds for Packing Problems
From MaRDI portal
Publication:4989941
DOI10.1137/20M1351692MaRDI QIDQ4989941
David de Laat, Philippe Moustrou, Maria Dostert
Publication date: 27 May 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.00256
Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (5)
Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets ⋮ Semidefinite programming bounds for the average kissing number ⋮ The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ Kissing number in non-Euclidean spaces of constant sectional curvature
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing unit spheres into the smallest sphere using VNS and NLP
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Klassenzahlen definiter quadratischer Formen
- The algebraic degree of semidefinite programming
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Lower bounds for measurable chromatic numbers
- Finite point-sets on S 2 with minimum distance as large as possible
- Factoring polynomials with rational coefficients
- Spherical codes and designs
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Symmetry groups, semidefinite programs, and sums of squares
- Sums of squares in Macaulay2
- Exact algorithms for semidefinite programs with degenerate feasible set
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Computing sum of squares decompositions with rational coefficients
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- Solving rank-constrained semidefinite programs in exact arithmetic
- Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
- Positive definite functions on spheres
- Exact Algorithms for Linear Matrix Inequalities
- Julia: A Fresh Approach to Numerical Computing
- New upper bounds for kissing numbers from semidefinite programming
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Tables of sphere packings and spherical codes
- Uniqueness of Certain Spherical Codes
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Nemo/Hecke
- On Exact Polya and Putinar's Representations
- Facial reduction for exact polynomial sum of squares decomposition
- Moment methods in energy minimization: New bounds for Riesz minimal energy problems
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- The nonexistence of certain tight spherical designs
- Three-point bounds for energy minimization
This page was built for publication: Exact Semidefinite Programming Bounds for Packing Problems
