期刊
JOURNAL OF GLOBAL OPTIMIZATION
卷 19, 期 3, 页码 201-227出版社
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1011255519438
关键词
global optimization; radial basis functions; interpolation; P-algorithm
We introduce a method that aims to find the global minimum of a continuous nonconvex function on a compact subset of R-d. It is assumed that function evaluations are expensive and that no additional information is available. Radial basis function interpolation is used to define a utility function. The maximizer of this function is the next point where the objective function is evaluated. We show that, for most types of radial basis functions that are considered in this paper, convergence can be achieved without further assumptions on the objective function. Besides, it turns out that our method is closely related to a statistical global optimization method, the P-algorithm. A general framework for both methods is presented. Finally, a few numerical examples show that on the set of Dixon-Szego test functions our method yields favourable results in comparison to other global optimization methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据