IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v48y2000i3p390-407.html

Nested Partitions Method for Global Optimization

Author

Listed:
  • Leyuan Shi

    (Department of Industrial Engineering, University of Wisconsin --- Madison, 1513 University Avenue, Madison, Wisconsin 53706)

  • Sigurdur Ólafsson

    (IMSE Department, Iowa State University, 2019 Black Engineering, Ames, Iowa 50011)

Abstract

We propose a new randomized method for solving global optimization problems. This method, the Nested Partitions (NP) method, systematically partitions the feasible region and concentrates the search in regions that are the most promising. The most promising region is selected in each iteration based on information obtained from random sampling of the entire feasible region and local search. The method hence combines global and local search. We first develop the method for discrete problems and then show that the method can be extended to continuous global optimization. The method is shown to converge with probability one to a global optimum in finite time. In addition, we provide bounds on the expected number of iterations required for convergence, and we suggest two stopping criteria. Numerical examples are also presented to demonstrate the effectiveness of the method.

Suggested Citation

  • Leyuan Shi & Sigurdur Ólafsson, 2000. "Nested Partitions Method for Global Optimization," Operations Research, INFORMS, vol. 48(3), pages 390-407, June.
    • Handle: RePEc:inm:oropre:v:48:y:2000:i:3:p:390-407
    DOI: 10.1287/opre.48.3.390.12436
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.48.3.390.12436
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.48.3.390.12436?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. Francisco J. Solis & Roger J.-B. Wets, 1981. "Minimization by Random Search Techniques," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 19-30, February.
    Full references (including those not matched with items on IDEAS)

    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. Shelley D. Dionne & Hiroki Sayama & Francis J. Yammarino, 2019. "Diversity and Social Network Structure in Collective Decision Making: Evolutionary Perspectives with Agent-Based Simulations," Complexity, Hindawi, vol. 2019, pages 1-16, March.
    2. Ricardo Navarro & Chyon Hae Kim, 2020. "Niching Multimodal Landscapes Faster Yet Effectively: VMO and HillVallEA Benefit Together," Mathematics, MDPI, vol. 8(5), pages 1-37, April.
    3. C. P. Stephens & W. Baritompa, 1998. "Global Optimization Requires Global Information," Journal of Optimization Theory and Applications, Springer, vol. 96(3), pages 575-588, March.
    4. J. Redondo & J. Fernández & I. García & P. Ortigosa, 2009. "A robust and efficient algorithm for planar competitive location problems," Annals of Operations Research, Springer, vol. 167(1), pages 87-105, March.
    5. Regis, Rommel G., 2010. "Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1187-1202, December.
    6. E. A. Tsvetkov & R. A. Krymov, 2022. "Pure Random Search with Virtual Extension of Feasible Region," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 575-595, November.
    7. Hvattum, Lars Magnus & Glover, Fred, 2009. "Finding local optima of high-dimensional functions using direct search methods," European Journal of Operational Research, Elsevier, vol. 195(1), pages 31-45, May.
    8. Rinnooy Kan, A. H. G. & Timmer, G. T., 1985. "Stochastic Global Optimization Methods Part I: Clustering Methods," Econometric Institute Archives 272329, Erasmus University Rotterdam.
    9. Dillenburger, Steven P. & Cochran, Jeffery K. & Cammarano, Vincent R., 2013. "Minimizing supply airdrop collateral damage risk," Socio-Economic Planning Sciences, Elsevier, vol. 47(1), pages 9-19.
    10. de Oliveira Nogueira, Tiago & Palacio, Gilderlânio Barbosa Alves & Braga, Fabrício Damasceno & Maia, Pedro Paulo Nunes & de Moura, Elineudo Pinho & de Andrade, Carla Freitas & Rocha, Paulo Alexandre C, 2022. "Imbalance classification in a scaled-down wind turbine using radial basis function kernel and support vector machines," Energy, Elsevier, vol. 238(PC).
    11. Taymaz, Erol, 1993. "A Calibration Algorithm for Micro-Simulation Models," Working Paper Series 374, Research Institute of Industrial Economics.
    12. Yang, Jianqiang & Yan, Fu & Zhang, Jin & Peng, Changgen & Zhang, Renlong, 2025. "Multi-objective plant root growth optimization algorithm for engineering design problems and UAV path planning," Chaos, Solitons & Fractals, Elsevier, vol. 201(P2).
    13. Prietula, Michael J. & Watson, Harry S., 2008. "When behavior matters: Games and computation in A Behavioral Theory of the Firm," Journal of Economic Behavior & Organization, Elsevier, vol. 66(1), pages 74-94, April.
    14. Xiong, Xiaoping & Qing, Guohua, 2023. "A hybrid day-ahead electricity price forecasting framework based on time series," Energy, Elsevier, vol. 264(C).
    15. Liu, Congzheng & Letchford, Adam N. & Svetunkov, Ivan, 2022. "Newsvendor problems: An integrated method for estimation and optimisation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 590-601.
    16. Jesús Montes & Antonio LaTorre & Santiago Muelas & Ángel Merchán-Pérez & José M. Peña, 2015. "Comparative Study of Metaheuristics for the Curve‐Fitting Problem: Modeling Neurotransmitter Diffusion and Synaptic Receptor Activation," Abstract and Applied Analysis, John Wiley & Sons, vol. 2015(1).
    17. Soumya D. Mohanty & Ethan Fahnestock, 2021. "Adaptive spline fitting with particle swarm optimization," Computational Statistics, Springer, vol. 36(1), pages 155-191, March.
    18. Giulia Pedrielli & K. Selcuk Candan & Xilun Chen & Logan Mathesen & Alireza Inanalouganji & Jie Xu & Chun-Hung Chen & Loo Hay Lee, 2019. "Generalized Ordinal Learning Framework (GOLF) for Decision Making with Future Simulated Data," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(06), pages 1-35, December.
    19. Mojtaba Akbari & Saber Molla-Alizadeh-Zavardehi & Sadegh Niroomand, 2020. "Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network," Operational Research, Springer, vol. 20(1), pages 447-471, March.
    20. Pradeep Anand Ravindranath & Stefano Forli & David S Goodsell & Arthur J Olson & Michel F Sanner, 2015. "AutoDockFR: Advances in Protein-Ligand Docking with Explicitly Specified Binding Site Flexibility," PLOS Computational Biology, Public Library of Science, vol. 11(12), pages 1-28, December.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:48:y:2000:i:3:p:390-407. 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.