Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics

DOI10.20382/JOCG.V13I1A3MaRDI QIDQ5077654zbMATH OpenOpenAlexFDO

Authors Sylvain Pion, Frédéric Cazals, Augustin Chevallier

Publication date 18 May 2022

Full work available at URL https://hal.inria.fr/hal-03048725

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Practical polytope volume approximation
• Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
• Efficient random-walk methods for approximating polytope volume
• A practical volume algorithm
• Fast MCMC sampling algorithms on polytopes

Cited in

(2)

• Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
• Truncated log-concave sampling for convex bodies with reflective Hamiltonian Monte Carlo

This page was built for publication: Improved polytope volume calculations based on Hamiltonian Monte Carlo with boundary reflections and sweet arithmetics

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