Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Operations Research Society of China
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
