Zobraziť v EDS

A novel batch-selection strategy for parallel global optimization.

Uložené v:
Podrobná bibliografia
Názov: A novel batch-selection strategy for parallel global optimization.
Autori: Liu, Jiawei, Xiao, Yike, Duan, Xiaojun, Chen, Xuan, Wang, Zhengming, Liu, Zecong
Zdroj: Engineering Optimization; Mar2025, Vol. 57 Issue 3, p599-623, 25p
Predmety: GLOBAL optimization, COMPUTER simulation, ALGORITHMS, ENGINEERING
Abstrakt: Bayesian-based parallel global optimization methods have become increasingly popular for solving black-box functions using parallel resources. When the function exhibits multimodality, it is difficult to identify the global optimum. This article proposes a novel batch selection strategy for parallel global optimization called Sampling–Optimizing–Selecting (SOS) to address this problem. SOS, utilizing minimum energy design, gradient optimization and hypersphere clustering, can adaptively explore multiple local optimal regions of the objective function simultaneously and make full use of parallel resources to obtain the global optimum efficiently. Additionally, the SOS algorithm maintains the sparsity between sample points to a certain extent, which enhances the accuracy of the surrogate model and thus improves the robustness of the optimization effect. Several numerical simulations and optimization experiments involving array decoy jamming are presented to demonstrate the superiority of the proposed strategy. [ABSTRACT FROM AUTHOR]
Copyright of Engineering Optimization is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáza: Complementary Index
Popis
Abstrakt:Bayesian-based parallel global optimization methods have become increasingly popular for solving black-box functions using parallel resources. When the function exhibits multimodality, it is difficult to identify the global optimum. This article proposes a novel batch selection strategy for parallel global optimization called Sampling–Optimizing–Selecting (SOS) to address this problem. SOS, utilizing minimum energy design, gradient optimization and hypersphere clustering, can adaptively explore multiple local optimal regions of the objective function simultaneously and make full use of parallel resources to obtain the global optimum efficiently. Additionally, the SOS algorithm maintains the sparsity between sample points to a certain extent, which enhances the accuracy of the surrogate model and thus improves the robustness of the optimization effect. Several numerical simulations and optimization experiments involving array decoy jamming are presented to demonstrate the superiority of the proposed strategy. [ABSTRACT FROM AUTHOR]
ISSN:0305215X
DOI:10.1080/0305215X.2024.2328788