IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v46y1998i1p84-95.html
   My bibliography  Save this article

Direction Choice for Accelerated Convergence in Hit-and-Run Sampling

Author

Listed:
  • David E. Kaufman

    (AT & T Labs, Somerset, New Jersey)

  • Robert L. Smith

    (University of Michigan, Ann Arbor, Michigan)

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.

Suggested Citation

  • David E. Kaufman & Robert L. Smith, 1998. "Direction Choice for Accelerated Convergence in Hit-and-Run Sampling," Operations Research, INFORMS, vol. 46(1), pages 84-95, February.
    • Handle: RePEc:inm:oropre:v:46:y:1998:i:1:p:84-95
    DOI: 10.1287/opre.46.1.84
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.1.84
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.46.1.84?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Robert L. Smith, 1984. "Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions," Operations Research, INFORMS, vol. 32(6), pages 1296-1308, December.
    2. Samuel H. Brooks, 1958. "A Discussion of Random Methods for Seeking Maxima," Operations Research, INFORMS, vol. 6(2), pages 244-251, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Asli Sahin & Daniel R. Weilandt & Vassily Hatzimanikatis, 2023. "Optimal enzyme utilization suggests that concentrations and thermodynamics determine binding mechanisms and enzyme saturations," Nature Communications, Nature, vol. 14(1), pages 1-13, December.
    2. Ziwei Dai & Weiyan Zheng & Jason W. Locasale, 2022. "Amino acid variability, tradeoffs and optimality in human diet," Nature Communications, Nature, vol. 13(1), pages 1-13, December.
    3. Boris Polyak & Elena Gryazina, 2011. "Randomized methods based on new Monte Carlo schemes for control and optimization," Annals of Operations Research, Springer, vol. 189(1), pages 343-356, September.
    4. André Schultz & Amina A Qutub, 2016. "Reconstruction of Tissue-Specific Metabolic Networks Using CORDA," PLOS Computational Biology, Public Library of Science, vol. 12(3), pages 1-33, March.
    5. Badenbroek, Riley & de Klerk, Etienne, 2022. "Complexity analysis of a sampling-based interior point method for convex optimization," Other publications TiSEM 3d774c6d-8141-4f31-a621-5, Tilburg University, School of Economics and Management.
    6. Carles Foguet & Yu Xu & Scott C. Ritchie & Samuel A. Lambert & Elodie Persyn & Artika P. Nath & Emma E. Davenport & David J. Roberts & Dirk S. Paul & Emanuele Angelantonio & John Danesh & Adam S. Butt, 2022. "Genetically personalised organ-specific metabolic models in health and disease," Nature Communications, Nature, vol. 13(1), pages 1-15, December.
    7. Shirin Fallahi & Hans J Skaug & Guttorm Alendal, 2020. "A comparison of Monte Carlo sampling methods for metabolic network models," PLOS ONE, Public Library of Science, vol. 15(7), pages 1-24, July.
    8. Wout Megchelenbrink & Martijn Huynen & Elena Marchiori, 2014. "optGpSampler: An Improved Tool for Uniformly Sampling the Solution-Space of Genome-Scale Metabolic Networks," PLOS ONE, Public Library of Science, vol. 9(2), pages 1-8, February.
    9. Cyril Bachelard & Apostolos Chalkis & Vissarion Fisikopoulos & Elias Tsigaridas, 2024. "Randomized Control in Performance Analysis and Empirical Asset Pricing," Papers 2403.00009, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Luca Anzilli & Silvio Giove, 2020. "Multi-criteria and medical diagnosis for application to health insurance systems: a general approach through non-additive measures," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(2), pages 559-582, December.
    2. Corrente, Salvatore & Figueira, José Rui & Greco, Salvatore, 2014. "The SMAA-PROMETHEE method," European Journal of Operational Research, Elsevier, vol. 239(2), pages 514-522.
    3. Stephen Baumert & Archis Ghate & Seksan Kiatsupaibul & Yanfang Shen & Robert L. Smith & Zelda B. Zabinsky, 2009. "Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles," Operations Research, INFORMS, vol. 57(3), pages 727-739, June.
    4. D. Bulger & W. P. Baritompa & G. R. Wood, 2003. "Implementing Pure Adaptive Search with Grover's Quantum Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 517-529, March.
    5. Hazan, Aurélien, 2017. "Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 473(C), pages 589-602.
    6. Dimitris Bertsimas & Allison O'Hair, 2013. "Learning Preferences Under Noise and Loss Aversion: An Optimization Approach," Operations Research, INFORMS, vol. 61(5), pages 1190-1199, October.
    7. Qi Fan & Jiaqiao Hu, 2018. "Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 677-693, November.
    8. Kyung-Yong Lee & Jung-Sung Park & Yun-Su Kim, 2021. "Optimal Placement of PMU to Enhance Supervised Learning-Based Pseudo-Measurement Modelling Accuracy in Distribution Network," Energies, MDPI, vol. 14(22), pages 1-18, November.
    9. Reuven Rubinstein, 2009. "The Gibbs Cloner for Combinatorial Optimization, Counting and Sampling," Methodology and Computing in Applied Probability, Springer, vol. 11(4), pages 491-549, December.
    10. Jing Voon Chen & Julia L. Higle & Michael Hintlian, 2018. "A systematic approach for examining the impact of calibration uncertainty in disease modeling," Computational Management Science, Springer, vol. 15(3), pages 541-561, October.
    11. Luis V. Montiel & J. Eric Bickel, 2014. "A Generalized Sampling Approach for Multilinear Utility Functions Given Partial Preference Information," Decision Analysis, INFORMS, vol. 11(3), pages 147-170, September.
    12. Kiatsupaibul, Seksan & J. Hayter, Anthony & Liu, Wei, 2017. "Rank constrained distribution and moment computations," Computational Statistics & Data Analysis, Elsevier, vol. 105(C), pages 229-242.
    13. Pavel Shcherbakov & Mingyue Ding & Ming Yuchi, 2021. "Random Sampling Many-Dimensional Sets Arising in Control," Mathematics, MDPI, vol. 9(5), pages 1-16, March.
    14. Etienne de Klerk & Monique Laurent, 2018. "Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1317-1325, November.
    15. Cheng, Haiyan & Sandu, Adrian, 2009. "Efficient uncertainty quantification with the polynomial chaos method for stiff systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 79(11), pages 3278-3295.
    16. Sorawit Saengkyongam & Anthony Hayter & Seksan Kiatsupaibul & Wei Liu, 2020. "Efficient computation of the stochastic behavior of partial sum processes," Computational Statistics, Springer, vol. 35(1), pages 343-358, March.
    17. Arandarenko, Mihail & Corrente, Salvatore & Jandrić, Maja & Stamenković, Mladen, 2020. "Multiple criteria decision aiding as a prediction tool for migration potential of regions," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1154-1166.
    18. Cyril Bachelard & Apostolos Chalkis & Vissarion Fisikopoulos & Elias Tsigaridas, 2023. "Randomized geometric tools for anomaly detection in stock markets," Post-Print hal-04223511, HAL.
    19. Ru, Zice & Liu, Jiapeng & Kadziński, Miłosz & Liao, Xiuwu, 2023. "Probabilistic ordinal regression methods for multiple criteria sorting admitting certain and uncertain preferences," European Journal of Operational Research, Elsevier, vol. 311(2), pages 596-616.
    20. Jan Heufer, 2014. "Generating Random Optimising Choices," Computational Economics, Springer;Society for Computational Economics, vol. 44(3), pages 295-305, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:46:y:1998:i:1:p:84-95. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.