Harmonic Hierarchies for Polynomial Optimization
From MaRDI portal
Publication:6202758
DOI10.1137/22M1484511arXiv2202.12865MaRDI QIDQ6202758FDOQ6202758
Authors: Mauricio Velasco 
Publication date: 27 February 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2202.12865
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
Linear programming (90C05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Harmonic Function Theory
- Global optimization with polynomials and the problem of moments
- Semidefinite programming relaxations for semialgebraic problems
- Uniform denominators in Hilbert's seventeenth problem
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- Moments, positive polynomials and their applications
- Title not available (Why is that?)
- Semidefinite Optimization and Convex Algebraic Geometry
- An encyclopaedia of cubature formulas.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast and accurate computation of Gauss-Legendre and Gauss-Jacobi quadrature nodes and weights
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Positive polynomials and sums of squares
- An introduction to polynomial and semi-algebraic optimization
- Sums of squares on the hypercube
- Title not available (Why is that?)
- Estimating \(L^\infty\) norms by \(L^{2k}\) norms for functions on orbits.
- Convexity properties of the cone of nonnegative polynomials
- Harmonic Polynomials and Dirichlet-Type Problems
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Quadrature-based polynomial optimization
- A note on total degree polynomial optimization by Chebyshev grids
- Nonlinear programming
- Signomial and polynomial optimization via relative entropy and partial dualization
- Cubature for the Sphere and the Discrete Spherical Harmonic Transform
- Formules générales de quadrature mécanique du type de Gauss
- Do sums of squares dream of free resolutions?
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Sums of squares and varieties of minimal degree
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory
- The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
- Sharp degree bounds for sum-of-squares certificates on projective curves
- Approximating nonnegative polynomials via spectral sparsification
- Sum-of-squares hierarchies for binary polynomial optimization
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)
