IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v2y2000i3d10.1023_a1010081212560.html
   My bibliography  Save this article

Nested Partitions Method for Stochastic Optimization

Author

Listed:
  • Leyuan Shi

    (University of Wisconsin–Madison)

  • Sigurdur O´lafsson

    (Iowa State University)

Abstract

The nested partitions (NP) method is a recently proposed new alternative for global optimization. Primarily aimed at problems with large but finite feasible regions, the method employs a global sampling strategy that is continuously adapted via a partitioning of the feasible region. In this paper we adapt the original NP method to stochastic optimization where the performance is estimated using simulation. We prove asymptotic convergence of the new method and present a numerical example to illustrate its potential.

Suggested Citation

  • Leyuan Shi & Sigurdur O´lafsson, 2000. "Nested Partitions Method for Stochastic Optimization," Methodology and Computing in Applied Probability, Springer, vol. 2(3), pages 271-291, September.
    • Handle: RePEc:spr:metcap:v:2:y:2000:i:3:d:10.1023_a:1010081212560
    DOI: 10.1023/A:1010081212560
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1010081212560
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1010081212560?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Reuven Rubinstein, 1999. "The Cross-Entropy Method for Combinatorial and Continuous Optimization," Methodology and Computing in Applied Probability, Springer, vol. 1(2), pages 127-190, September.
    2. Rubinstein, Reuven Y. & Shapiro, Alexander, 1990. "Optimization of static simulation models by the score function method," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 32(4), pages 373-392.
    3. Stephen M. Robinson, 1996. "Analysis of Sample-Path Optimization," Mathematics of Operations Research, INFORMS, vol. 21(3), pages 513-528, August.
    4. Pierre L'Ecuyer & Peter W. Glynn, 1994. "Stochastic Optimization by Simulation: Convergence Proofs for the GI/G/1 Queue in Steady-State," Management Science, INFORMS, vol. 40(11), pages 1562-1578, November.
    5. Leyuan Shi & Sigurdur Ólafsson, 2000. "Nested Partitions Method for Global Optimization," Operations Research, INFORMS, vol. 48(3), pages 390-407, June.
    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. Andreas Deckert & Robert Klein, 2014. "Simulation-based optimization of an agent-based simulation," Netnomics, Springer, vol. 15(1), pages 33-56, July.
    2. Michael Macgregor Perry, 2021. "Fisheries Management in Congested Waters: A Game-Theoretic Assessment of the East China Sea," Papers 2110.13966, arXiv.org, revised Feb 2022.

    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. Pedrielli, Giulia & Wang, Songhao & Ng, Szu Hui, 2020. "An extended Two-Stage Sequential Optimization approach: Properties and performance," European Journal of Operational Research, Elsevier, vol. 287(3), pages 929-945.
    2. Michael C. Fu, 2002. "Feature Article: Optimization for simulation: Theory vs. Practice," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 192-215, August.
    3. Gürkan, G. & Ozge, A.Y., 1996. "Sample-Path Optimization of Buffer Allocations in a Tandem Queue - Part I : Theoretical Issues," Discussion Paper 1996-98, Tilburg University, Center for Economic Research.
    4. Kao, Chiang & Chen, Shih-Pin, 2006. "A stochastic quasi-Newton method for simulation response optimization," European Journal of Operational Research, Elsevier, vol. 173(1), pages 30-46, August.
    5. Jiaqiao Hu & Michael C. Fu & Steven I. Marcus, 2007. "A Model Reference Adaptive Search Method for Global Optimization," Operations Research, INFORMS, vol. 55(3), pages 549-568, June.
    6. Yongchao Liu & Huifu Xu & Jane J. Ye, 2011. "Penalized Sample Average Approximation Methods for Stochastic Mathematical Programs with Complementarity Constraints," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 670-694, November.
    7. Chang, Kuo-Hao & Kuo, Po-Yi, 2018. "An efficient simulation optimization method for the generalized redundancy allocation problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1094-1101.
    8. Lee, Loo Hay & Chew, Ek Peng & Manikam, Puvaneswari, 2006. "A general framework on the simulation-based optimization under fixed computing budget," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1828-1841, November.
    9. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1091-1109.
    10. Mattrand, C. & Bourinet, J.-M., 2014. "The cross-entropy method for reliability assessment of cracked structures subjected to random Markovian loads," Reliability Engineering and System Safety, Elsevier, vol. 123(C), pages 171-182.
    11. R. Y. Rubinstein, 2005. "A Stochastic Minimum Cross-Entropy Method for Combinatorial Optimization and Rare-event Estimation," Methodology and Computing in Applied Probability, Springer, vol. 7(1), pages 5-50, March.
    12. Alfieri, Arianna & Matta, Andrea, 2012. "Mathematical programming formulations for approximate simulation of multistage production systems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 773-783.
    13. Sun, Haoze & Weng, Chengguo & Zhang, Yi, 2017. "Optimal multivariate quota-share reinsurance: A nonparametric mean-CVaR framework," Insurance: Mathematics and Economics, Elsevier, vol. 72(C), pages 197-214.
    14. Arianna Alfieri & Andrea Matta & Giulia Pedrielli, 2015. "Mathematical programming models for joint simulation–optimization applied to closed queueing networks," Annals of Operations Research, Springer, vol. 231(1), pages 105-127, August.
    15. Özdemir, Deniz & Yücesan, Enver & Herer, Yale T., 2013. "Multi-location transshipment problem with capacitated production," European Journal of Operational Research, Elsevier, vol. 226(3), pages 425-435.
    16. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    17. David R. Morrison & Jason J. Sauppe & Wenda Zhang & Sheldon H. Jacobson & Edward C. Sewell, 2017. "Cyclic best first search: Using contours to guide branch‐and‐bound algorithms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 64-82, February.
    18. K.-P. Hui & N. Bean & M. Kraetzl & Dirk Kroese, 2005. "The Cross-Entropy Method for Network Reliability Estimation," Annals of Operations Research, Springer, vol. 134(1), pages 101-118, February.
    19. András Lörincz & Zsolt Palotai & Gábor Szirtes, 2012. "Efficient Sparse Coding in Early Sensory Processing: Lessons from Signal Recovery," PLOS Computational Biology, Public Library of Science, vol. 8(3), pages 1-14, March.
    20. Jörg Fliege & Huifu Xu, 2011. "Stochastic Multiobjective Optimization: Sample Average Approximation and Applications," Journal of Optimization Theory and Applications, Springer, vol. 151(1), pages 135-162, 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:spr:metcap:v:2:y:2000:i:3:d:10.1023_a:1010081212560. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.