Approximate volume and integration for basic semi-algebraic sets
arXiv:0807.2505 · doi:10.1137/080730287
Abstract
Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear programs. Not only the volume but also every finite vector of moments of the probability measure that is uniformly distributed on $\K$ can be approximated as closely as desired, and so permits to approximate the integral on $\K$ of any given polynomial; extension to integration against some weight functions is also provided. Finally, some numerical issues associated with the algorithms involved are briefly discussed.
Cited by in corpus (22)
- Hybrid Controller for Wind Turbine Generators to Ensure Adequate Frequency Response in Power Networks
- Sparse Noncommutative Polynomial Optimization
- Convergence of Lasserre's hierarchy: the general case
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets
- Computing the volume of compact semi-algebraic sets
- Approximating regions of attraction of a sparse polynomial differential system *
- Convex Constrained Semialgebraic Volume Optimization: Application in Systems and Control
- Set Theory-Based Safety Supervisory Control for Wind Turbines to Ensure Adequate Frequency Response
- Reconstruction of Support of a Measure From Its Moments
- Variational Transport: A Convergent Particle-BasedAlgorithm for Distributional Optimization
- Safety Verification of Nonlinear Autonomous System via Occupation Measures
- Chance-Constrained Optimization for Non-Linear Network Flow Problems
- Controller Synthesis for Discrete-Time Polynomial Systems via Occupation Measures
- Minimum volume semialgebraic sets for robust estimation
- Efficient Sampling from Feasible Sets of SDPs and Volume Approximation
- Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets
- Inner approximations for polynomial matrix inequalities and robust stability regions
- High-Order Quadrature on Multi-Component Domains Implicitly Defined by Multivariate Polynomials
- An algorithm for estimating volumes and other integrals in dimensions
- Volume Of Sub-level Sets Of Homogeneous Polynomials
- Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations
- Representation of chance-constraints with strong asymptotic guarantees