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

约束最优化的一个使用非单调线搜索的超线性收敛算法
引用本文:XuYifan WangWei. 约束最优化的一个使用非单调线搜索的超线性收敛算法[J]. 高校应用数学学报(英文版), 2000, 15(2): 211-219. DOI: 10.1007/s11766-000-0028-1
作者姓名:XuYifan WangWei
作者单位:[1]FudanUniv.,Shanghai200433. [2]ShanghaiTiedaoUniv.,Shanghai200331.
摘    要:Abstract. In the paper, a new mixed algorithm combined with schemes of nonmonotone line search, the systems of linear equations for higher order modification and sequential quadratic programming for constrained optimizations is presented. Under some weaker assumptions,without strict complementary condition, the algorithm is globally and superlinearly convergent.

关 键 词:混合超线性收敛算法 非单调搜索 约束优化 线性方程
收稿时间:1999-01-15

A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
Xu Yifan,Wang Wei. A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations[J]. Applied Mathematics A Journal of Chinese Universities, 2000, 15(2): 211-219. DOI: 10.1007/s11766-000-0028-1
Authors:Xu Yifan  Wang Wei
Affiliation:(1) Fudan Univ., 200433 Shanghai;(2) Shanghai Tiedao Univ., 200331 Shanghai
Abstract:In the paper, a new mixed algorithm combined with schemes of nonmonotone line search, the systems of linear equations for higher order modification and sequential quadratic programming for constrained optimizations is presented. Under some weaker assumptions,without strict complementary condition, the algorithm is globally and superlinearly convergent.
Keywords:constrained optimization  convergence
本文献已被 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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