Random sampling: billiard walk algorithm
From MaRDI portal
Publication:296789
DOI10.1016/j.ejor.2014.03.041zbMath1338.60190arXiv1211.3932OpenAlexW2104963735MaRDI QIDQ296789
Boris T. Polyak, Elena N. Gryazina
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.3932
Related Items
Practical Volume Estimation of Zonotopes by a New Annealing Schedule for Cooling Convex Bodies ⋮ Mixed robustness: analysis of systems with uncertain deterministic and random parameters by the example of linear systems ⋮ Approximate methods for solving chance-constrained linear programs in probability measure space ⋮ Billiard walk
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm
- Randomized methods based on new Monte Carlo schemes for control and optimization
- Stochastic billiards on general tables
- Hit-and-run enables efficient weight generation for simulation-based multiple criteria decision analysis
- A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Stochastic Billiards for Sampling from the Boundary of a Convex Set
- Hit-and-run from a corner
- The Markov chain Monte Carlo revolution
- BILLIARD TRAJECTORIES IN A POLYHEDRAL ANGLE
- Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra
- Random walks in a convex body and an improved volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Simulation and the Monte Carlo Method
- On the Computation of Multidimensional Integrals by the Monte-Carlo Method
- Dynamical systems with elastic reflections
