Journal Article10.1287/OPRE.48.3.390.12436
Nested Partitions Method for Global Optimization
Leyuan Shi,Sigurdur Olafsson +1 more
419
TL;DR: The Nested Partitions (NP) method, a new randomized method for solving global optimization problems that systematically partitions the feasible region and concentrates the search in regions that are the most promising, is proposed.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Tutorial on the Cross-Entropy Method
TL;DR: This tutorial presents the CE methodology, the basic algorithm and its modifications, and discusses applications in combinatorial optimization and machine learning.
The Cross-Entropy Method for Combinatorial and Continuous Optimization
TL;DR: The mode of a unimodal importance sampling distribution, like the mode of beta distribution, is used as an estimate of the optimal solution for continuous optimization and Markov chains approach for combinatorial optimization.
1K
Hybrid metaheuristics in combinatorial optimization: A survey
Christian Blum,Jakob Puchinger,Günther R. Raidl,Andrea Roli +3 more
- 01 Sep 2011
TL;DR: A survey of some of the most important lines of hybridization of metaheuristics with other techniques for optimization, which includes, for example, the combination of exact algorithms and meta heuristics.
Feature Article: Optimization for simulation: Theory vs. Practice
TL;DR: There is a disconnect between research in simulation optimization--which has addressed the stochastic nature of discrete-event simulation by concentrating on theoretical results of convergence and specialized algorithms that are mathematically elegant--and the recent software developments, which implement very general algorithms adopted from techniques in the deterministic optimization metaheuristic literature.
799
Optimization for Simulation: Theory vs. Practice
Michael C. Fu
- 01 Jan 2002
TL;DR: There is a disconnect between research in simulation optimization—which has addressed the stochastic nature of discrete-event simulation by concentrating on theoretical results of convergence and specialized algorithms that are mathematically elegant—and the recent software developments, which implement very general algorithms adopted from techniques in the deterministic optimization metaheuristic literature.
652
References
Handbook of global optimization
Reiner Horst,Panos M. Pardalos,H. Edwin Romeijn +2 more
- 01 Jan 1995
TL;DR: This paper presents algorithms for global optimization of mixed-integer nonlinear programs using the Reformulation-Linearization/Convexification Technique (RLT) and an introduction to dynamical search.
Minimization by Random Search Techniques
TL;DR: Two general convergence proofs for random search algorithms are given and how these extend those available for specific variants of the conceptual algorithm studied here are shown.
Introduction to Stochastic Processes
Paul G. Hoel,Sidney C. Port,Charles J. Stone,Richard Holley +3 more
- 01 Sep 1973
484
•Book
Theory of Global Random Search
A. A. Zhigli︠a︡vskiĭ,János D. Pintér +1 more
- 01 Jan 1991
TL;DR: This paper presents an overview of the global optimization problem, a survey of the approaches for its solution, and some ways of applying statistical procedures to construct global random search algorithms.
336