Exploiting sparsity for semi-algebraic set volume computation
DOI10.1007/s10208-021-09508-wOpenAlexW3144163274MaRDI QIDQ2696572
Matteo Tacchi, Didier Henrion, Tillmann Weisser, Jean-Bernard Lasserre
Publication date: 14 April 2023
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.02976
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Numerical optimization and variational techniques (65K10) Integration with respect to measures and other set functions (28A25) Semialgebraic sets and related spaces (14P10) Numerical integration (65D30)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical volume algorithm
- A geometric inequality and the complexity of computing volume
- Slow hit-and-run sampling
- Computing Gaussian \& exponential measures of semi-algebraic sets
- Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach
- Convex Computation of the Region of Attraction of Polynomial Control Systems
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- GloptiPoly 3: moments, optimization and semidefinite programming
- Approximate Volume and Integration for Basic Semialgebraic Sets
- On the Complexity of Computing the Volume of a Polyhedron
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Strong duality in lasserre's hierarchy for polynomial optimization
This page was built for publication: Exploiting sparsity for semi-algebraic set volume computation
