A Stochastic Adaptive Radial Basis Function Algorithm for Costly Black-Box Optimization
In this paper, we present a stochastic adaptive algorithm using radial basis function models for global optimization of costly black-box functions. The exploration radii in local searches are generated adaptively. Each iteration point is selected from some randomly generated trial points according t...
Saved in:
| Published in | Journal of the Operations Research Society of China (Internet) Vol. 6; no. 4; pp. 587 - 609 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Beijing
Operations Research Society of China
01.12.2018
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 2194-668X 2194-6698 |
| DOI | 10.1007/s40305-018-0204-8 |
Cover
| Summary: | In this paper, we present a stochastic adaptive algorithm using radial basis function models for global optimization of costly black-box functions. The exploration radii in local searches are generated adaptively. Each iteration point is selected from some randomly generated trial points according to certain criteria. A restarting strategy is adopted to build the restarting version of the algorithm. The performance of the presented algorithm and its restarting version are tested on 13 standard numerical examples. The numerical results suggest that the algorithm and its restarting version are very effective. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2194-668X 2194-6698 |
| DOI: | 10.1007/s40305-018-0204-8 |