Exploiting sparsity for semi-algebraic set volume computation
From MaRDI portal
Semialgebraic sets and related spaces (14P10) Integration with respect to measures and other set functions (28A25) Numerical integration (65D30) Numerical optimization and variational techniques (65K10) Large-scale problems in mathematical programming (90C06) Semidefinite programming (90C22) Programming involving graphs or networks (90C35)
Recommendations
- Approximate volume and integration for basic semialgebraic sets
- Computing the volume of compact semi-algebraic sets
- Convergence rates of moment-sum-of-squares hierarchies for volume approximation of semialgebraic sets
- Stokes, Gibbs, and volume computation of semi-algebraic sets
- Computing Gaussian \& exponential measures of semi-algebraic sets
Cites work
- A geometric inequality and the complexity of computing volume
- A practical volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Approximate volume and integration for basic semialgebraic sets
- Computing Gaussian \& exponential measures of semi-algebraic sets
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convex Computation of the Region of Attraction of Polynomial Control Systems
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach
- GloptiPoly 3: moments, optimization and semidefinite programming
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1149839 (Why is no real title available?)
- scientific article; zbMATH DE number 1538124 (Why is no real title available?)
- Moments, positive polynomials and their applications
- On the Complexity of Computing the Volume of a Polyhedron
- Slow hit-and-run sampling
- Strong duality in lasserre's hierarchy for polynomial optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Cited in
(9)- A sublevel moment-SOS hierarchy for polynomial optimization
- Volume computation for sparse Boolean quadric relaxations
- Stokes, Gibbs, and volume computation of semi-algebraic sets
- Set Estimation, Computation of Volumes and Data Safety
- Computing the volume of compact semi-algebraic sets
- Exploiting Sparsity for Semi-Algebraic Set Volume Computation
- The moment-SOS hierarchy: applications and related topics
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
This page was built for publication: Exploiting sparsity for semi-algebraic set volume computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2696572)
