AN ALGORITHM FOR FINDING GLOBAL MINIMIZATION BY DISCRETE MEAN VALUE AND LEVEL SET
用离散均值—水平集求全局最优算法

The theory and method of global minimization is more difficult than local minimization. Especially up to now, there is no optimal criterion for global optimization, so there is lack of good termination rule. In this paper, we propose an algorithm for finding global minimization by discrete mean value-level set, the convergence of this algorithm is proved, a termination rule and some numerical examples are given.