Moment methods in energy minimization: new bounds for Riesz minimal energy problems
From MaRDI portal
Publication:5217870
Abstract: We use moment techniques to construct a converging hierarchy of optimization problems to lower bound the ground state energy of interacting particle systems. We approximate (from below) the infinite dimensional optimization problems in this hierarchy by block diagonal semidefinite programs. For this we develop the necessary harmonic analysis for spaces consisting of subsets of another space, and we develop symmetric sum-of-squares techniques. We numerically compute the second step of our hierarchy for Riesz s-energy problems with five particles on the 2-dimensional unit sphere, where the s=1 case is the Thomson problem. This yields new numerically sharp bounds (up to high precision) and suggests the second step of our hierarchy may be sharp throughout a phase transition and may be universally sharp for 5-particles on the unit sphere. This is the first time a 4-point bound has been computed for a problem in discrete geometry.
Recommendations
- Three-point bounds for energy minimization
- Asymptotic linear programming lower bounds for the energy of minimizing Riesz and Gauss configurations
- On Riesz minimal energy problems
- Minimal energy points and sphere packing
- Determination of extremal points and weighted discrete minimal Riesz energy with interior point methods
Cites work
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 3572833 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1171995 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 918597 (Why is no real title available?)
- A semidefinite programming hierarchy for packing problems in discrete geometry
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- An extremal property of the icosahedron
- CSDP, A C library for semidefinite programming
- Congruent Graphs and the Connectivity of Graphs
- Designs as maximum codes in polynomial metric spaces
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Global optimization with polynomials and the problem of moments
- Hilbert distances and positive definite functions
- Julia: a fresh approach to numerical computing
- MPFR
- Minimal biquadratic energy of 5 particles on 2-sphere
- Multivariate positive definite functions on spheres
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for kissing numbers from semidefinite programming
- On separation of minimal Riesz energy points on spheres in Euclidean spaces
- On the complexity of Putinar's Positivstellensatz
- Polynomials that are positive on an interval
- Problems and theorems in analysis II. Theory of functions, zeros, polynomials, determinants, number theory, geometry. Transl. from the German by C. E. Billigheimer.
- Semidefinite optimization
- Separation Properties of Convex Cones
- Spherical codes and designs
- Sums of squares and moment problems in equivariant situations
- Sur la séparation des ensembles convexes
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetry groups, semidefinite programs, and sums of squares
- The Five-Electron Case of Thomson’s Problem
- The Magma algebra system. I: The user language
- The minimum of potential energy of a System of point charges
- The representation theory of the symmetric groups
- The sphere packing problem in dimension 8
- Three-point bounds for energy minimization
- Universally optimal distribution of points on spheres
- Upper bounds for packings of spheres of several radii
Cited in
(7)- Rapid Solution of Minimal Riesz Energy Problems
- The moment-SOS hierarchy: applications and related topics
- \(k\)-point semidefinite programming bounds for equiangular lines
- Solving clustered low-rank semidefinite programs arising from polynomial optimization
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
- Energy optimization for distributions on the sphere and improvement to the Welch bounds
- Exact Semidefinite Programming Bounds for Packing Problems
This page was built for publication: Moment methods in energy minimization: new bounds for Riesz minimal energy problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217870)
