| 用离散均值—水平集求全局最优算法 |
| |
| 引用本文： | 张连生,许梦杰,王立联. 用离散均值—水平集求全局最优算法[J]. 系统科学与数学, 2001, 21(2): 141-146 |
| |
| 作者姓名： | 张连生 许梦杰 王立联 |
| |
| 作者单位： | 1. 上海大学理学院数学系,
2. 上海师范大学数学科学学院, |
| |
| 基金项目： | 国家攀登计划和国家自然科学基金资助课题. |
| |
| 摘 要： | 全局最优理论和方法，由于全局性的要求，比局部最优理论和方法更为困难，特别是，至今还没有很好的全局最优性的判别准则，故多数算法法缺少好的终止准则.西文提出了一个只需计算函数值的离散均值—水平集求全局最优的方法，给出了算法的终止准则，证明了算法的收敛性，并给出了某些数值例子.
|
| 关 键 词： | 离散均值—水平集，均匀取点，全局最优 |
| 修稿时间： | 1997-04-21 |
AN ALGORITHM FOR FINDING GLOBAL MINIMIZATION BY DISCRETE MEAN VALUE AND LEVEL SET |
| |
| ZHANG Liansheng,XU MENGJIE,Wang Lilian. AN ALGORITHM FOR FINDING GLOBAL MINIMIZATION BY DISCRETE MEAN VALUE AND LEVEL SET[J]. Journal of Systems Science and Mathematical Sciences, 2001, 21(2): 141-146 |
| |
| Authors: | ZHANG Liansheng XU MENGJIE Wang Lilian |
| |
| Affiliation: | Mathematics Department, Shanghai University, Shanghai 201800,P.R.China |
| |
| Abstract: | 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. |
| |
| Keywords: | Discrete mean value-level set generated points by uniform distribution global minimization. |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
|
点击此处可从《系统科学与数学》下载全文 |
