| 求解非凸函数极小的异步并行拟牛顿算法 |
| |
| 引用本文： | 陈忠.求解非凸函数极小的异步并行拟牛顿算法[J].长江大学学报,2005,2(1):1-3,i001. |
| |
| 作者姓名： | 陈忠 |
| |
| 作者单位： | 长江大学信息与数学学院,湖北,荆州,434023 |
| |
| 摘 要： | 假设可供使用的处理机p q台,将其分成两组,两组处理机之间进行异步并行计算,由此提出了一种求解非凸函数极小的并行算法.若目标函数连续可微,且其一阶导数Lipschitz连续,证明了并行拟牛顿算法的全局收敛性.
|
| 关 键 词： | 拟牛顿方法 并行算法 全局收敛 非凸极小 |
| 文章编号： | 1673-1409(2005)01-0001-03 |
Asynchronous-parallel Pseudo-Newtonian Algorithm for Solving Non-convex Function Minimals |
| |
| CHEN Zhong.Asynchronous-parallel Pseudo-Newtonian Algorithm for Solving Non-convex Function Minimals[J].Journal of Yangtze University,2005,2(1):1-3,i001. |
| |
| Authors: | CHEN Zhong |
| |
| Abstract: | p+q sets of processors are assumed, which are available for use .They are divided into 2 groups, for which asynchronous and parallel calculations are conducted. A method is proposed for solving non-convex function minimals. If the target function is continuously differential and Lipschitz continuous in first order derivative global convergence is demonstrated for the parallel pseudo-Newtonian algorithm. |
| |
| Keywords: | pseudo-Newtonian algorithm parallel algorithm global convergence non-convex minimal |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
