Moment methods in energy minimization: new bounds for Riesz minimal energy problems
From MaRDI portal
Publication:5217870
DOI10.1090/TRAN/7976zbMATH Open1437.90122arXiv1610.04905OpenAlexW3099246670MaRDI QIDQ5217870FDOQ5217870
Authors: David de Laat 
Publication date: 26 February 2020
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1610.04905
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
semidefinite programminginvariant polynomialsLasserre hierarchyThomson problemRiesz \(s\)-energyfour-point boundsharmonic analysis on spaces of subsets
Semidefinite programming (90C22) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Existence theories in calculus of variations and optimal control (49J99)
Cites Work
- The Magma algebra system. I: The user language
- CSDP, A C library for semidefinite programming
- Julia: a fresh approach to numerical computing
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- The representation theory of the symmetric groups
- Symmetry groups, semidefinite programs, and sums of squares
- An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
- Universally optimal distribution of points on spheres
- MPFR
- Title not available (Why is that?)
- Congruent Graphs and the Connectivity of Graphs
- Polynomials that are positive on an interval
- Title not available (Why is that?)
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Three-point bounds for energy minimization
- On the complexity of Putinar's Positivstellensatz
- The Five-Electron Case of Thomson’s Problem
- Spherical codes and designs
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Separation Properties of Convex Cones
- Symmetric Tensors and Symmetric Tensor Rank
- A semidefinite programming hierarchy for packing problems in discrete geometry
- Hilbert distances and positive definite functions
- New upper bounds for kissing numbers from semidefinite programming
- Upper bounds for packings of spheres of several radii
- Multivariate positive definite functions on spheres
- The minimum of potential energy of a System of point charges
- Sums of squares and moment problems in equivariant situations
- On separation of minimal Riesz energy points on spheres in Euclidean spaces
- Problems and theorems in analysis II. Theory of functions, zeros, polynomials, determinants, number theory, geometry. Transl. from the German by C. E. Billigheimer.
- Title not available (Why is that?)
- Designs as maximum codes in polynomial metric spaces
- The sphere packing problem in dimension 8
- An extremal property of the icosahedron
- Sur la séparation des ensembles convexes
- Title not available (Why is that?)
- Semidefinite optimization
- Minimal biquadratic energy of 5 particles on 2-sphere
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
Uses Software
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)
