关键词: 总体优化, 双参数填充函数算法, 局部极小解的个数.

Abstract:

A class of doubleparameterized filled function methods developed for unconstrained global minimization problem needs the assumption that the optimization problem has only a finite number of local minimizers, and has parameters which are restricted by the inimal radius of the S-basin of some local minimizer of the problem. In this paper, we modify them such that the two weaknesses are overcome. Numerical experiments show that the algorithm is efficient.

Key words: Global optimization, The filled function method, Number of local minimizers.