Novel matrix hit and run for sampling polytopes and its GPU implementation
From MaRDI portal
Cites work
- A generalized sampling approach for multilinear utility functions given partial preference information
- A Simulation-Based Approach to Decision Making with Partial Information
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
- Approximating joint probability distributions given partial information
- Choosing a Point from the Surface of a Sphere
- Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Efficient random-walk methods for approximating polytope volume
- Fast MCMC sampling algorithms on polytopes
- Fast rectangular matrix multiplication and QR decomposition
- Generating a random collection of discrete joint probability distributions subject to partial information
- Geodesic Walks in Polytopes
- Hit-and-run enables efficient weight generation for simulation-based multiple criteria decision analysis
- Hit-and-run mixes fast
- Introduction to algorithms.
- John’s walk
- Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
- On the use of MCMC computerized adaptive testing with empirical prior information to improve efficiency
- Polytope Volume Computation
- Powers of tensors and fast matrix multiplication
- Practical Markov Chain Monte Carlo
- Random walks in a convex body and an improved volume algorithm
- Random walks on polytopes and an affine interior point method for linear programming
- Sampling can be faster than optimization
- Solving convex programs by random walks
- Using Linear Programming to Decode Binary Linear Codes
Cited in
(1)
This page was built for publication: Novel matrix hit and run for sampling polytopes and its GPU implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6954901)
