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

凸约束优化的非单调信赖域算法的收敛性
引用本文:葛恒武,陈中文.凸约束优化的非单调信赖域算法的收敛性[J].应用数学,2001,14(3):77-81.
作者姓名:葛恒武  陈中文
作者单位:苏州大学数学系,
摘    要:本文对凸约束优化问题提出一类新的非单调信赖域算法,在二次模型Hesse矩阵{Bk}一致有界条件下,证明了算法具有强收敛性;在{Bk}线性增长的条件下,证明了算法具有弱收敛性;这推广了现有约束或凸约束优化问题的各种信赖域算法,改进了收敛性结果。

关 键 词:凸约束  信赖域算法  非单调算法  全局收敛性  优化问题  二次模型  Hesse矩阵  强收敛性
文章编号:1001-9847(2001)03-0077-05
修稿时间:2000年10月29

The Convergence of a Class of Nonmonotone Trust RegionAlgorithms for Convex Constrained Optimization
GE Heng-wu,CHEN Zhong-wen.The Convergence of a Class of Nonmonotone Trust RegionAlgorithms for Convex Constrained Optimization[J].Mathematica Applicata,2001,14(3):77-81.
Authors:GE Heng-wu  CHEN Zhong-wen
Abstract:The authors present a new class of and more general nonmono to ne trust region algorithms for convex constrained optimization. Under the assump tion which the Hessian matrices {B k} of the quadrtic model are uniformly b ounded, the strong global convergence is proved. We also prove the weak global c onvergence of the algorithm if the matrix sequence {B k} increases linearly , which generalize the scope that the various trust region algorithms can be app lied and improved the global convergence results theorectially.
Keywords:Convex constraints  Trust region algorithm  Nonmonotonic alg orithm  Global convergence
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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