Hit-and-run from a corner

DOI10.1145/1007352.1007403zbMATH Open1192.68371OpenAlexW1987845271MaRDI QIDQ3580977FDOQ3580977

Authors: Santosh S. Vempala, László Lovász 

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007403

Recommendations

• Hit-and-Run from a Corner
• Convergence properties of hit–and–run samplers
• Hit-and-run mixes fast
• On the mixing time of coordinate Hit-and-Run
• scientific article; zbMATH DE number 5019925

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sums of independent random variables; random walks (60G50)

Cited In (13)

• Finite-sample complexity of sequential Monte Carlo estimators
• Hit-and-Run from a Corner
• Using Histograms to Better Answer Queries to Probabilistic Logic Programs
• On the mixing time of coordinate Hit-and-Run
• Hit-and-run mixes fast
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Random sampling: billiard walk algorithm
• Sampling by intersections with random geodesics
• Projective re-normalization for improving the behavior of a homogeneous conic linear system
• Sampling Hypersurfaces through Diffusion
• Lower Bounds for Hit-and-Run Direct Search
• Complexity results for MCMC derived from quantitative bounds
• Efficient Markov chain Monte Carlo methods for decoding neural spike trains

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)