%0 Journal Article
%T AN ALGORITHM FOR FINDING GLOBAL MINIMIZATION BY DISCRETE MEAN VALUE AND LEVEL SET<br>用离散均值—水平集求全局最优算法
%A Lian Sheng ZHANG
%A Meng Jie XU
%A Li Lian WANG
%A <br>张连生
%J 系统科学与数学
%D 2001
%I 
%X 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.
%K Discrete mean value-level set
%K generated points by uniform distribution
%K global minimization<br>离散均值—水平集，均匀取点，全局最优
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=1E20E6690EA43683&yid=14E7EF987E4155E6&vid=659D3B06EBF534A7&iid=0B39A22176CE99FB&sid=A8DE7703CC9E390F&eid=A020552C37306588&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=7