Exact Semidefinite Programming Bounds for Packing Problems
From MaRDI portal
Recommendations
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- New upper bounds for kissing numbers from semidefinite programming
- Upper bounds for packings of spheres of several radii
- Bounds for codes by semidefinite programming
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
Cites work
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Auf welcher Kugel haben 5, 6, 7, 8 oder 9 Punkte mit Mindestabstand Eins Platz?
- Computing sum of squares decompositions with rational coefficients
- Exact algorithms for linear matrix inequalities
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- Facial reduction for exact polynomial sum of squares decomposition
- Factoring polynomials with rational coefficients
- Finite point-sets on S 2 with minimum distance as large as possible
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Julia: a fresh approach to numerical computing
- Klassenzahlen definiter quadratischer Formen
- Lower bounds for measurable chromatic numbers
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
- New bounds on the number of unit spheres that can touch a unit sphere in n dimensions
- New upper bounds for kissing numbers from semidefinite programming
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- On exact Polya and Putinar's representations
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Packing unit spheres into the smallest sphere using VNS and NLP
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Positive definite functions on spheres
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Solving rank-constrained semidefinite programs in exact arithmetic
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
- Spherical codes and designs
- Sums of squares in Macaulay2
- Symmetry groups, semidefinite programs, and sums of squares
- Tables of sphere packings and spherical codes
- The algebraic degree of semidefinite programming
- The nonexistence of certain tight spherical designs
- Three-point bounds for energy minimization
- Uniqueness of Certain Spherical Codes
Cited in
(14)- Semidefinite programming bounds for the average kissing number
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- Kissing number in non-Euclidean spaces of constant sectional curvature
- Dual certificates and efficient rational sum-of-squares decompositions for polynomial optimization over compact sets
- \(\ell_1\)-sparsity approximation bounds for packing integer programs
- 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
- Exact semidefinite programming bounds for packing problems
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- Additive and multiplicative coinvariant spaces of Weyl groups in the light of harmonics and graded transfer
- Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs
- Optimal measures for multivariate geometric potentials
- Certifying solutions of degenerate semidefinite programs
This page was built for publication: Exact Semidefinite Programming Bounds for Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989941)
