A practical algorithm for volume estimation based on billiard trajectories and simulated annealing

Cites work

A Fast and Practical Method to Estimate Volumes of Convex Polytopes
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
A randomized cutting plane method with probabilistic geometric convergence
An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
Bypassing KLS: Gaussian cooling and an O^(n^3) volume algorithm
Constrained Triangulations, Volumes of Polytopes, and Unit Equations
Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
Determinants and the volumes of parallelotopes and zonotopes
Direction choice for accelerated convergence in hit-and-run sampling
Efficient estimation of covariance selection models
Evaluation of Normal Probabilities of Symmetric Regions
Geometric algorithms for sampling the flux space of metabolic networks
Goffin's algorithm for zonotopes
Hit-and-Run from a Corner
scientific article; zbMATH DE number 4055377 (Why is no real title available?)
scientific article; zbMATH DE number 2107836 (Why is no real title available?)
scientific article; zbMATH DE number 7236423 (Why is no real title available?)
scientific article; zbMATH DE number 3103824 (Why is no real title available?)
Independent random sampling methods
Markov chain Monte Carlo. Stochastic simulation for Bayesian inference.
MCMC using Hamiltonian dynamics
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
On the Complexity of Computing the Volume of a Polyhedron
On the mixing time of coordinate Hit-and-Run
Practical polytope volume approximation
Principal component analysis: a review and recent developments
Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
Random variate generation for unimodal and monotone densities
Random walks and anO*(n5) volume algorithm for convex bodies
Reducing isotropy and volume to KLS: an o *( n ³ ψ ² ) volume algorithm
Rigorously computed orbits of dynamical systems without the wrapping effect
Simulated Annealing for Convex Optimization
Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
Solving convex programs by random walks
The asymptotic volume of the Birkhoff polytope

This page was built for publication: A practical algorithm for volume estimation based on billiard trajectories and simulated annealing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579766)