A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
From MaRDI portal
Publication:3296188
Abstract: The generalized problem of moments is a conic linear optimization problem over the convex cone of positive Borel measures with given support. It has a large variety of applications, including global optimization of polynomials and rational functions, options pricing in finance, constructing quadrature schemes for numerical integration, and distributionally robust optimization. A usual solution approach, due to J.B. Lasserre, is to approximate the convex cone of positive Borel measures by finite dimensional outer and inner conic approximations. We will review some results on these approximations, with a special focus on the convergence rate of the hierarchies of upper and lower bounds for the general problem of moments that are obtained from these inner and outer approximations.
Recommendations
- A semidefinite programming approach to the generalized problem of moments
- Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
- Moments, positive polynomials and their applications
- A semidefinite approach for truncated \(K\)-moment problems
- Positive polynomials and semidefinite programming
Cites work
- scientific article; zbMATH DE number 4052269 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 2068056 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 3219899 (Why is no real title available?)
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- A note on Tchakaloff’s Theorem
- A semidefinite programming approach to the generalized problem of moments
- An encyclopaedia of cubature formulas.
- An epsilon of room. I: Real analysis. Pages from year three of a mathematical blog
- An introduction to polynomial and semi-algebraic optimization
- Approximation Theory and Harmonic Analysis on Spheres and Balls
- Bound-constrained polynomial optimization using only elementary calculations
- Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Cubature, approximation, and isotropy in the hypercube
- Distributionally robust optimization with polynomial densities: theory, models and algorithms
- Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
- Extensions of Gauss quadrature via linear programming
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- How to Integrate a Polynomial over a Sphere
- Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Moments of non-negative mass
- On duality theory of conic linear problems.
- On the complexity of Putinar's Positivstellensatz
- On the complexity of Schmüdgen's Positivstellensatz
- On the convergence rate of grid search for polynomial optimization over the simplex
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization over polynomials: selected topics
- Orthogonal polynomials of several variables
- Quadrature-based polynomial optimization
- Simulated Annealing for Convex Optimization
- Solution of the truncated complex moment problem for flat data
- Strong duality in lasserre's hierarchy for polynomial optimization
- Sums of squares, moment matrices and optimization over polynomials
- The Five-Electron Case of Thomson’s Problem
- The General Moment Problem, A Geometric Approach
- The K-moment problem for compact semi-algebraic sets
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- The moment problem
- The proof of Tchakaloff’s Theorem
Cited in
(19)- scientific article; zbMATH DE number 2068069 (Why is no real title available?)
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
- A framework of distributionally robust possibilistic optimization
- Global minimization of polynomial integral functionals
- A semidefinite programming approach to the generalized problem of moments
- Generalized truncated moment problems with unbounded sets
- Moments, positive polynomials and their applications
- Minimizing rational functions: a hierarchy of approximations via pushforward measures
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
- Finite convergence of moment-SOS relaxations with nonreal radical ideals
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
- Distributionally robust possibilistic optimization problems
- Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
- Sum-of-squares hierarchies for binary polynomial optimization
- Sum-of-squares hierarchies for binary polynomial optimization
- A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs
This page was built for publication: A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296188)
