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

优化问题的拟牛顿算法
引用本文:赖炎连. 优化问题的拟牛顿算法[J]. 咸宁学院学报, 2001, 21(6): 1-7
作者姓名:赖炎连
作者单位:中国科学院,数学与系统科学研究院应用数学研究所,
摘    要:拟牛顿算法是无约束优化问题的有效而名的算法,是牛顿法的近似,牛顿算法要求目标函数二次连续可微,Hesse阵非奇异且正定,计算量较大,拟牛顿算法只要求目标函数一次连续可微,以拟牛顿方程为基础来构造算法,易于实现,计算量较小,并形成了完整的算法体系,在理论与应用上都有重要意义,

关 键 词:优化问题 拟牛顿算法 秩1与秩2修正公式 Broyden族
文章编号:1006-5342(2001)06-0001-07
修稿时间:2001-11-05

Quasi- Newton Methods for the Optimization Problem
LAI Yan-lian. Quasi- Newton Methods for the Optimization Problem[J]. Journal of Xianning College, 2001, 21(6): 1-7
Authors:LAI Yan-lian
Abstract:The Quasi-Newton method is a famous and effective method.It is a kind of approximative Newton method.In the computation process,twicely continuous differentiability and positive Hesse matrix of the objective function are required.But the Quasi-Newton method only needs continuous differentiability of objective function and can be computed easily.The Quasi-Newton method had formed a algorithm system and has very important sense on the theory and Application.
Keywords:Optimizing problem  Quasi-Newton methods  Modified formula of rank-1 and rank-2  Broyden family  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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