| 曲线搜索下新的记忆拟牛顿算法 |
| |
| 引用本文： | 陈凤华,张聪,房明磊.曲线搜索下新的记忆拟牛顿算法[J].广西科学,2008,15(3):254-256. |
| |
| 作者姓名： | 陈凤华 张聪 房明磊 |
| |
| 作者单位： | 桂林电子科技大学数学与计算科学学院,广西桂林,541004 |
| |
| 基金项目： | 国家自然科学基金，中国博士后科学基金，广西自然科学基金 |
| |
| 摘 要： | 利用新的曲线搜索方法,提出一种解决无约束优化问题的记忆拟牛顿算法,给出该算法全局收敛的条件并进行数值实验.新算法由曲线搜索确定迭代步长,搜索方向用到当前迭代点信息的同时还用到上一次迭代点的信息,而且搜索方向与迭代步长同时确定,是一种有效的算法.
|
| 关 键 词： | 无约束优化 记忆拟牛顿算法 全局收敛 曲线搜索 |
| 收稿时间： | 2007/7/18 0:00:00 |
| 修稿时间： | 2008/4/10 0:00:00 |
A New Memory Quasi-Newton Method with Curve Search Rule |
| |
| CHEN Feng-hu,ZHANG Cong and FANG Ming-lei.A New Memory Quasi-Newton Method with Curve Search Rule[J].Guangxi Sciences,2008,15(3):254-256. |
| |
| Authors: | CHEN Feng-hu ZHANG Cong and FANG Ming-lei |
| |
| Institution: | School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, Guangxi, 541004, China,School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, Guangxi, 541004, China and School of Mathematics and Computational Science, Guilin University of Electronic Technology, Guilin, Guangxi, 541004, China |
| |
| Abstract: | By means of a new curve search rule,we propose a new memory quasi-Newton method for unconstrained optimization problems.A global convergent result is proved and numerical experiments are carried out.The step-size of the new algorithm is determined by the new curve search rule.The search direction not only make use of the current iterative information but also the previous iterative information.Moreover,the search direction and the step-size are determined simultaneously at each iteration.Numerical results show that the algorithm is effective. |
| |
| Keywords: | unconstrained optimization memory quasi-Newton method global convergence curve search rule |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《广西科学》浏览原始摘要信息 |
| 点击此处可从《广西科学》下载免费的PDF全文 |
|
