带扰动项的FR共轭梯度法(英文)  

FR Conjugate Gradient Methods with Perturbations

作　　者：李梅霞[1] 刘茜[2] 王长钰[3] 

机构地区：[1]潍坊学院数学系,山东潍坊261061 [2]山东师范大学数学系,山东济南250014 [3]曲阜师范大学运筹所,山东曲阜273165

出　　处：《运筹学学报》2008年第2期1-16,共16页Operations Research Transactions

基　　金：National Natural Science Foundation under Grant No.10571106.

摘　　要：本文提出了两种搜索方向带有扰动项的Fletcher-Reeves(abbr.FR)共轭梯度法.其迭代公式为x_k+1=x_k+α_k(s_k+ω_k),其中s_k由共轭梯度迭代公式确定,ω_k为扰动项,α_k采用线搜索确定而不是必须趋于零.我们在很一般的假设条件下证明了两种算法的全局收敛性,而不需要目标函数有下界或水平集有界等有界性条件.In this paper, we propose two kinds of Fletcher-Reeves （abbr.FR） conjugate gradient methods with linesearch in the case that the search direction is perturbed slightly. Their iterate formula is xk＋1 = xk ＋ αk（sk ＋ ωk）, where the main direction sk is obtained by FR conjugate gradient method and ωk is perturbation term. The stepsize αk is determined by linesearch and needs not tend to zero. We prove that the two kinds of methods are globally convergent under mild conditions, and in doing so, we remove various boundedness conditions such as boundedness from blow of f, boundedness of level set, etc.

关 键 词：运筹学 无约束最优化 共轭梯度法 全局收敛性 扰动 

分 类 号：O242.23[理学—计算数学] O175.27[理学—数学]