| Title |
Experimental study of excessive local refinement reduction techniques for global optimization DIRECT-type algorithms / |
| Authors |
Stripinis, Linas ; Paulavičius, Remigijus |
| DOI |
10.3390/math10203760 |
| Full Text |
|
| Is Part of |
Mathematics.. Basel : MDPI. 2022, vol. 10, iss. 20, art. no. 3760, p. [1-18].. eISSN 2227-7390 |
| Keywords [eng] |
optimization ; global optimization ; derivative-free optimization ; exact optimization algorithms ; DIRECT-type algorithms |
| Abstract [eng] |
This article considers a box-constrained global optimization problem for Lipschitz continuous functions with an unknown Lipschitz constant. The well-known derivative-free global search algorithm DIRECT (DIvide RECTangle) is a promising approach for such problems. Several studies have shown that recent two-step (global and local) Pareto selection-based algorithms are very efficient among all DIRECT-type approaches. However, despite its encouraging performance, it was also observed that the candidate selection procedure has two possible shortcomings. First, there is no limit on how small the size of selected candidates can be. Secondly, a balancing strategy between global and local candidate selection is missing. Therefore, it may waste function evaluations by over-exploring the current local minimum and delaying finding the global one. This paper reviews and employs different strategies in a two-step Pareto selection framework (1-DTC-GL) to overcome these limitations. A detailed experimental study has revealed that existing strategies do not always improve and sometimes even worsen results. Since 1-DTC-GL is a DIRECT-type algorithm, the results of this paper provide general guidance for all DIRECT-type algorithms on how to deal with excessive local refinement more efficiently. |
| Published |
Basel : MDPI |
| Type |
Journal article |
| Language |
English |
| Publication date |
2022 |
| CC license |
|
