首页 | 官方网站   微博 | 高级检索  
     

优化问题的序列线性方程组解法
引用本文:赖炎连.优化问题的序列线性方程组解法[J].咸宁学院学报,2003,23(3):1-8.
作者姓名:赖炎连
作者单位:中国科学院,数学与系统科学研究院应用数学研究所,北京,100080
摘    要:拟牛顿算法是求解无约束优化问题的有效算法.序列二次规划方法是将拟牛顿算法应用于求解约束优化的推广与发展,它保持了拟牛顿算法的超线性收敛速度而成为约束优化的重要算法类.序列线性方程组方法则是它的进一步发展,目的在于每步求迭代方向dk时避免求解计算量较大的二次子规划.现在序列线性方程组方法仍在研究和发展,目的是简化算法结构、减少计算量,同时保持算法的优良性质.

关 键 词:序列线性方程组方法  全局收敛与超线性收敛  严格互补松驰条件假设  无严格互补松驰条件假设
文章编号:1006-5342(2003)03-0001-08
修稿时间:2003年4月30日

Algorithm of Sequential Systems of Linear Equations for Optimization Problems
LAI Yan-lian.Algorithm of Sequential Systems of Linear Equations for Optimization Problems[J].Journal of Xianning College,2003,23(3):1-8.
Authors:LAI Yan-lian
Abstract:In this paper,we introduce some algorithms of sequnential systems of linear equations (SSLE) for nonlinear optimization problems.Sequential quadratic programming (SQP) algorithms have good properties of global convergence and superlinear convergence rate.But solving a quadratic programming is to be required consuming a large amount of computation in every step of SQP algorithm for getting the iterative direction d_k. All SSLE type algorithm are to be developed form SQP algorithm.Now,Our aim of continuing study SSLE algorithm is to simplify the structure of the algorithm and only need solving a systems of linear equations for getting d_k.
Keywords:SSLE  Global convergence and superlinear convergence  Without strict complementarity assumption
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号