A practical algorithm for volume estimation based on billiard trajectories and simulated annealing
From MaRDI portal
Publication:6579766
DOI10.1145/3584182MaRDI QIDQ6579766
Vissarion Fisikopoulos, Apostolos Chalkis, Ioannis Z. Emiris
Publication date: 26 July 2024
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
samplingrandomized algorithmmathematical softwarerandom walkvolume approximationbilliard trajectoriespolytope representations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical volume algorithm
- Random variate generation for unimodal and monotone densities
- Determinants and the volumes of parallelotopes and zonotopes
- A geometric inequality and the complexity of computing volume
- Rigorously computed orbits of dynamical systems without the wrapping effect
- An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Direction Choice for Accelerated Convergence in Hit-and-Run Sampling
- Efficient estimation of covariance selection models
- Bypassing KLS
- Principal component analysis: a review and recent developments
- A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes
- The asymptotic volume of the Birkhoff polytope
- Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles
- Evaluation of Normal Probabilities of Symmetric Regions
- On the Complexity of Computing the Volume of a Polyhedron
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Random walks and anO*(n5) volume algorithm for convex bodies
- Constrained Triangulations, Volumes of Polytopes, and Unit Equations
- Practical Polytope Volume Approximation
- Independent Random Sampling Methods
- Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
- Simulated Annealing for Convex Optimization
- Hit-and-Run from a Corner
- On the mixing time of coordinate Hit-and-Run
- Solving convex programs by random walks
- Reducing isotropy and volume to KLS: an o *( n 3 ψ 2 ) volume algorithm
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast
This page was built for publication: A practical algorithm for volume estimation based on billiard trajectories and simulated annealing