The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Direction Choice for Accelerated Convergence in Hit-and-Run Sampling
Abstract
Hit-and-Run algorithms are Monte Carlo procedures for generating points that are asymptotically distributed according to general absolutely continuous target distributions G over open bounded regions S. Applications include nonredundant constraint identification, global optimization, and Monte Carlo integration. These algorithms are reversible random walks that commonly incorporate uniformly distributed step directions. We investigate nonuniform direction choice and show that, under regularity conditions on the region S and target distribution G, there exists a unique direction choice distribution, characterized by necessary and sufficient conditions depending on S and G, which optimizes the Doob bound on rate of convergence. We include computational results demonstrating greatly accelerated convergence for this optimizing direction choice as well as for more easily implemented adaptive heuristic rules.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
Simulation and the Monte Carlo Method
Rubinstein, R. Y., & Kroese, D. P. (2016) · Wiley Series in Probability and Statistics · doi:10.1002/9781118631980 · Cited by 3,356 · cited 4×
“Dixon and Szegö [7, 8], Rubinstein [21]).”
BackgroundInfluentialPractical markov chain monte carlo
Geyer, C. J. (1992) · Statistical Science · doi:10.1214/ss/1177011137 · Cited by 2,045
Stochastic global optimization methods part I: Clustering methods
Rinnooy Kan, A. H. G., & Timmer, G. T. (1987) · Mathematical Programming · doi:10.1007/bf02592070 · Cited by 463
Cited by
Neal, R. M. (2003) · The Annals of Statistics · doi:10.1214/aos/1056562461 · Cited by 1,361
Multidimensional Optimality of Microbial Metabolism
Schuetz, R., Zamboni, N., Zampieri, M., Heinemann, M., & Sauer, U. (2012) · Science · doi:10.1126/science.1216882 · Cited by 420
Use of Randomized Sampling for Analysis of Metabolic Networks
Schellenberger, J., & Palsson, B. Ø. (2009) · Journal of Biological Chemistry · doi:10.1074/jbc.r800048200 · Cited by 256
Shlomi, T., Benyamini, T., Gottlieb, E., Sharan, R., & Ruppin, E. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002018 · Cited by 244
Bordbar, A., Lewis, N. E., Schellenberger, J., Palsson, B. Ø., & Jamshidi, N. (2010) · Molecular Systems Biology · doi:10.1038/msb.2010.68 · Cited by 252
Metadata
- Authors
- Kaufman, D. E., & Smith, R. L.
- Venue
- Operations Research
- Published
- 1998-02
- Volume
- 46
- Issue
- 1
- Pages
- 84-95
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2119642783
- Cited by
- 175
- References
- 5
- FWCI
- 0.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Direction Choice for Accelerated Convergence in Hit-and-Run Sampling. https://app.cochat.ai/papers/10.1287/opre.46.1.84
- The paper
- Kaufman, D. E., & Smith, R. L. (1998). Direction Choice for Accelerated Convergence in Hit-and-Run Sampling. Operations Research. https://doi.org/10.1287/opre.46.1.84
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.