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

Technical Note—On Nested Partitions Method for Global Optimization

Author

Listed:
  • Tao Wu

    (School of Economics and Management, Tongji University, Shanghai 200092, China)

Abstract

Shi and Ólafsson [(2000) Nested Partitions Method for Global Optimization. Operations Research . 48(3):390–407] proposed the Nested Partitions (NP) method with two different NP backtracking rules—namely, NP I and NP II—for solving global optimization problems. Two of their main results are the properties of the global convergence of the NP method stated in theorems 3 and 4 on pages 398 and 399, respectively. In particular, theorem 3 provides a hitting-probability-based formula to represent the bound of the expected number of convergence iterations for both NP I and II, and theorem 4 evaluates its expected numeric bound of convergence iterations under a particular case for NP II. We prove that both theorems are fundamentally incorrect and rectify them in this study. Our computational results show that the expected convergence bounds presented by Shi and Ólafsson can be deviated from the actual convergence bounds of NP II approximately by 50% for some tested scenarios.

Suggested Citation

  • Tao Wu, 2021. "Technical Note—On Nested Partitions Method for Global Optimization," Operations Research, INFORMS, vol. 69(5), pages 1533-1539, September.
    • Handle: RePEc:inm:oropre:v:69:y:2021:i:5:p:1533-1539
    DOI: 10.1287/opre.2020.2026
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2020.2026
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2020.2026?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
    ---><---

    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:69:y:2021:i:5:p:1533-1539. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.