首页 | 本学科首页   官方微博 | 高级检索  
     

一类非单调保守BFGS算法研究
引用本文:万中,冯冬冬. 一类非单调保守BFGS算法研究[J]. 计算数学, 2011, 33(4): 387-396
作者姓名:万中  冯冬冬
作者单位:中南大学数学科学与计算技术学院, 长沙 410083
摘    要:基于非单调线搜索在寻求优化问题最优解中的优越性,提出了一类新的非单调保守BFGS算法.同已有方法不同,该算法中用来控制非单调性程度的算法参数不是取固定值,而是利用已有目标函数和梯度函数的信息自动调整其取值,以改善算法的数值表现.在合适的假设条件下,建立了新的非单调保守BFGS算法的全局收敛性.用基准测试优化问题测试了算...

关 键 词:无约束最优化  保守BFGS方法  非单调线搜索  全局收敛性
收稿时间:2011-05-11;

INVESTIGATION ON A CLASS OF NONMONOTONE CAUTIOUS BFGS ALGORITHMS
Wan Zhong,Feng Dongdong. INVESTIGATION ON A CLASS OF NONMONOTONE CAUTIOUS BFGS ALGORITHMS[J]. Mathematica Numerica Sinica, 2011, 33(4): 387-396
Authors:Wan Zhong  Feng Dongdong
Affiliation:School of Math. Sci. & Comput. Tech., Central South Univer., Changsha 410083, China
Abstract:With the superiority of nonmonotone line search in finding a solution of optimization problem, a class of nonmonotone cautious BFGS algorithms are developed. Different from the existing techniques of nonmonotone line search, the parameter, which is employed to control the magnitude of nonmonotonicity, is modified (not a fixed value) by the known information of the objective function and the gradient function such that the numerical performance of the developed algorithm is improved. Under some suitable assumptions, the global convergence is proved for this algorithm. Implementing the algorithm to solve some benchmark test problems, the results demonstrate that it is more effective than the similar algorithms.
Keywords:unconstrained optimization  cautious BFGS method  nonmonotone line search  global convergence
本文献已被 万方数据 等数据库收录!
点击此处可从《计算数学》浏览原始摘要信息
点击此处可从《计算数学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号