Technical Note—On Nested Partitions Method for Global Optimization

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.