摘要
郑权在1978年提出的一种积分水平集算法概念性算法.由于水平集一般情况下难以求出,此算法通过Monte-Carlo随机取点来实现.本文提出了数学期望型水平值逼近全局最小值的概念性算法,它利用了相对熵主要思想,通过改变重要样本密度函数,克服了郑权算法水平集不易求得而难以求出水平值的困难.本文还给出了求全局最小值的收敛准则并证明了它的渐进收敛性.
Zheng Quan proposed a conceptual algorithm of integral global optimization in 1978.This algorithm is implementable approach by Monte-Carlo method because the level set is difficult to solve.This paper presents a conceptual algorithm of mathematical expectation of level value approximating to global minimum that uses the main idea of the cross-entropy method and avoids solving level set procedure by changing the important sample probability density function.This paper also gives convergence criterion of global minimum for the new conceptual algorithm and proves its asymptotic convergence.
出处
《应用数学与计算数学学报》
2010年第2期67-74,共8页
Communication on Applied Mathematics and Computation
基金
上海自然科学基金课题(09ZR1411100)
上海市教委科技创新重点项目(09ZZ94)
