Hit-and-run from a corner
From MaRDI portal
Recommendations
Cited in
(20)- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- Hit-and-run mixes fast
- Sampling by intersections with random geodesics
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Random sampling: billiard walk algorithm
- Efficient Markov chain Monte Carlo methods for decoding neural spike trains
- Sampling Hypersurfaces through Diffusion
- Lower Bounds for Hit-and-Run Direct Search
- Using histograms to better answer queries to probabilistic logic programs
- Hit-and-Run from a Corner
- On the mixing time of coordinate Hit-and-Run
- Complexity results for MCMC derived from quantitative bounds
- Finite-sample complexity of sequential Monte Carlo estimators
- On the choice of the non-trainable internal weights in random feature maps for forecasting chaotic dynamical systems
- Accelerated convergence in Hit-and-Run Monte Carlo and a coordinate-free randomized Kaczmarz algorithm
- Spectral gap bounds for reversible hybrid Gibbs chains
- Unadjusted Langevin algorithm for non-convex weakly smooth potentials
- On mixing rates for Bayesian CART
- On the _0 isoperimetric coefficient for measurable sets
- Fast mixing of data augmentation algorithms: Bayesian probit, logit and Lasso regression
This page was built for publication: Hit-and-run from a corner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580977)