| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 881.16 KB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
Locating and identifying points as global minimizers is, in general, a hard and time-consuming task. Difficulties increase in the impossibility of using the derivatives of the functions defining the problem. In this work, we propose a new class of methods suited for global derivative-free constrained optimization. Using direct search of directional type, the algorithm alternates between a search step, where potentially good regions are located, and a poll step where the previously located promising regions are explored. This exploitation is made through the launching of several instances of directional direct searches, one in each of the regions of interest. Differently from a simple multistart strategy, direct searches will merge when sufficiently close. The goal is to end with as many direct searches as the number of local minimizers, which would easily allow locating the global extreme value. We describe the algorithmic structure considered, present the corresponding convergence analysis and report numerical results, showing that the proposed method is competitive with currently commonly used global derivative-free optimization solvers.
Description
Keywords
Global optimization Multistart strategies Direct-search methods Pattern-search methods Nonsmooth calculus
Citation
CUSTÓDIO, A. L.; MADEIRA, J. F. A.; - GLODS: global and local optimization using direct search. Journal of Global Optimization. ISSN. 0925-5001. Vol. 62, N.º 1 (2015), pp. 1-28.
Publisher
SPRINGER