Abstract: Distributing points on a (possibly high-dimensional) sphere with minimal energy is a long-standing problem in and outside the field of mathematics. This paper considers a novel energy function that arises naturally from statistics and combinatorial optimization, and studies its theoretical properties. Our result solves both the exact optimal spherical point configurations in certain cases and the minimal energy asymptotics under general assumptions. Connections between our results and the L1-Principal Component analysis and Quasi-Monte Carlo methods are also discussed.
Cites work
- Asymptotics for discrete weighted minimal Riesz energy problems on rectifiable sets
- Asymptotics for minimal discrete energy on the sphere
- Distributing many points on a sphere
- Distributing Points on the Sphere, I
- Distribution of points on spheres and approximation by zonotopes
- Efficient L1-Norm Principal-Component Analysis via Bit Flipping
- scientific article; zbMATH DE number 1181255 (Why is no real title available?)
- Mathematical problems for the next century
- On means of distances on the surface of a sphere (lower bounds)
- On means of distances on the surface of a sphere. II: Upper bounds
- QMC designs: optimal order quasi Monte Carlo integration schemes on the sphere
- Spherical codes and designs
- t-designs in projective spaces
- The Five-Electron Case of Thomson’s Problem
- The probabilistic method
- Two proposals for robust PCA using semidefinite programming
- Universally optimal distribution of points on spheres
Cited in
(3)
This page was built for publication: On the minimax spherical designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077052)
