Hit-and-Run from a Corner
From MaRDI portal
Publication:5470722
DOI10.1137/S009753970544727XzbMath1103.52002WikidataQ101001960 ScholiaQ101001960MaRDI QIDQ5470722
László Lovász, Santosh Vempala
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
68W20: Randomized algorithms
Related Items
Computational results of an \(O^{\ast }(n^{4})\) volume algorithm, Pattern hit-and-run for sampling efficiently on polytopes, Pattern discrete and mixed hit-and-run for global optimization, \(D\)-decomposition technique state-of-the-art, On the computational complexity of MCMC-based estimators in large samples, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, On Sampling from Multivariate Distributions, The Markov chain Monte Carlo revolution