Harmonic Hierarchies for Polynomial Optimization
From MaRDI portal
Publication:6202758
Abstract: We introduce novel polyhedral approximation hierarchies for the cone of nonnegative forms on the unit sphere in and for its (dual) cone of moments. We prove computable quantitative bounds on the speed of convergence of such hierarchies. We also introduce a novel optimization-free algorithm for building converging sequences of lower bounds for polynomial minimization problems on spheres. Finally some computational results are discussed, showcasing our implementation of these hierarchies in the programming language Julia.
Recommendations
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
- A hierarchy of spectral relaxations for polynomial optimization
Cites work
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- scientific article; zbMATH DE number 3591295 (Why is no real title available?)
- scientific article; zbMATH DE number 1218597 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1069610 (Why is no real title available?)
- scientific article; zbMATH DE number 1544060 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- A note on total degree polynomial optimization by Chebyshev grids
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- An encyclopaedia of cubature formulas.
- An introduction to polynomial and semi-algebraic optimization
- Approximating nonnegative polynomials via spectral sparsification
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Convexity properties of the cone of nonnegative polynomials
- Cubature for the Sphere and the Discrete Spherical Harmonic Transform
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Do sums of squares dream of free resolutions?
- Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
- Fast and accurate computation of Gauss-Legendre and Gauss-Jacobi quadrature nodes and weights
- Formules générales de quadrature mécanique du type de Gauss
- Global optimization with polynomials and the problem of moments
- Harmonic Function Theory
- Harmonic Polynomials and Dirichlet-Type Problems
- Moments, positive polynomials and their applications
- Nonlinear programming
- Positive polynomials and sums of squares
- Quadrature-based polynomial optimization
- Semidefinite Optimization and Convex Algebraic Geometry
- Semidefinite programming relaxations for semialgebraic problems
- Sharp degree bounds for sum-of-squares certificates on projective curves
- Signomial and polynomial optimization via relative entropy and partial dualization
- Sum-of-squares hierarchies for binary polynomial optimization
- Sums of squares and varieties of minimal degree
- Sums of squares on the hypercube
- The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory
- Uniform denominators in Hilbert's seventeenth problem
This page was built for publication: Harmonic Hierarchies for Polynomial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202758)
