Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures
From MaRDI portal
Publication:5152480
DOI10.1137/20M138541XzbMath1477.90055arXiv2012.05793OpenAlexW3199428094MaRDI QIDQ5152480
Olivier Zahm, Swann Marx, Victor Magron, Jean-Bernard Lasserre
Publication date: 24 September 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.05793
sums of squaresnumerical integrationsemidefinite programmingpolynomial optimizationpushforward measureupper bounds hierarchy
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Polynomial optimization (90C23)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing the sum of many rational functions
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Near-optimal analysis of Lasserre's univariate measure-based bounds for multivariate polynomial optimization
- Distributionally robust optimization with polynomial densities: theory, models and algorithms
- Global optimization of rational functions: a semidefinite programming approach
- Global Optimization with Polynomials and the Problem of Moments
- On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming
- Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization
- How to integrate a polynomial over a simplex
- Bounding the support of a measure from its marginal moments
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis
- Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- Spectral Methods in MATLAB
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
- Semidefinite Programming
- The Moment-SOS Hierarchy
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
- Computing the Volume of Compact Semi-Algebraic Sets
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
- Volume of Sublevel Sets of Homogeneous Polynomials
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- JuMP: A Modeling Language for Mathematical Optimization
- Convex Optimization and Parsimony of $L_p$-balls Representation
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
