| 求解总体极值问题的两种随机型算法 |
| |
| 引用本文： | 阳明盛.求解总体极值问题的两种随机型算法[J].贵州工业大学学报(自然科学版),1993(1). |
| |
| 作者姓名： | 阳明盛 |
| |
| 作者单位： | 大连理工大学应用数学系 |
| |
| 摘 要： | 本文利用随机投点,或者沿随机方向搜索的途径,可使迭代点较快地进入到目标函数一个新的、更低的水平集中,然后采用无约束或带约束的近代优化技术,可以得到一个新的、更好的局部极小点。重复以上步骤,在一定条件下,就能有效地求得问题的总体极值。
|
| 关 键 词： | 总体极小 随机投点 水平集 |
TWO STOCHASTIC METHODS FOR SOLVING GLOBAL EXTREMUM PROBLEMS |
| |
| Yang Mingsheng.TWO STOCHASTIC METHODS FOR SOLVING GLOBAL EXTREMUM PROBLEMS[J].Journal of Guizhou University of Technology(Natural Science Edition),1993(1). |
| |
| Authors: | Yang Mingsheng |
| |
| Institution: | Department of Applied Mathematic Dalian University of Technology |
| |
| Abstract: | Two stochastic methods for solving global extremcm problems are presented in this paper.They are constructed by using stochastic points or by searching in stochastic directions.Numerical experiments show that the irerate sequence generated by these methods converges fa. ster than the current ones. |
| |
| Keywords: | global minimum stochastic point horizontal set |
| 本文献已被 CNKI 等数据库收录！ |
