Moment methods in energy minimization: New bounds for Riesz minimal energy problems

DOI10.1090/tran/7976zbMath1437.90122arXiv1610.04905OpenAlexW3099246670MaRDI QIDQ5217870

David de Laat

Publication date: 26 February 2020

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1610.04905

zbMATH Keywords

semidefinite programminginvariant polynomialsLasserre hierarchyThomson problemRiesz \(s\)-energyfour-point boundsharmonic analysis on spaces of subsets

Mathematics Subject Classification ID

Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Existence theories in calculus of variations and optimal control (49J99)

Related Items

\(k\)-point semidefinite programming bounds for equiangular lines, The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices, Exact Semidefinite Programming Bounds for Packing Problems

Uses Software

• CSDP
• GAP
• Magma
• SDPA
• MPFR
• Julia

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On separation of minimal Riesz energy points on spheres in Euclidean spaces
• On the complexity of Putinar's Positivstellensatz
• Designs as maximum codes in polynomial metric spaces
• Spherical codes and designs
• The representation theory of the symmetric groups
• Problems and theorems in analysis II. Theory of functions, zeros, polynomials, determinants, number theory, geometry. Transl. from the German by C. E. Billigheimer.
• The Magma algebra system. I: The user language
• Symmetry groups, semidefinite programs, and sums of squares
• A semidefinite programming hierarchy for packing problems in discrete geometry
• The sphere packing problem in dimension 8
• Sur la séparation des ensembles convexes
• Hilbert distances and positive definite functions
• Global Optimization with Polynomials and the Problem of Moments
• An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
• Julia: A Fresh Approach to Numerical Computing
• Chapter 2: Semidefinite Optimization
• Universally optimal distribution of points on spheres
• New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
• MPFR
• New upper bounds for kissing numbers from semidefinite programming
• Sums of squares and moment problems in equivariant situations
• The minimum of potential energy of a System of point charges
• Congruent Graphs and the Connectivity of Graphs
• Polynomials that are positive on an interval
• CSDP, A C library for semidefinite programming
• Minimal biquadratic energy of 5 particles on 2-sphere
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
• The Five-Electron Case of Thomson’s Problem
• Symmetric Tensors and Symmetric Tensor Rank
• Three-point bounds for energy minimization
• Upper bounds for packings of spheres of several radii
• Separation Properties of Convex Cones