期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Global Convergence of a New Restarting Conjugate Gradient Method for Nonlinear Optimizations 被引量:1
1
作者 SUN Qing-ying(Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China Department of Applied Mathematics, University of Petroleum , Dongying 257061, China) 《Chinese Quarterly Journal of Mathematics》 CSCD 2003年第2期154-162,共9页
Conjugate gradient optimization algorithms depend on the search directions.with different choices for the parameters in the search directions.In this note,by combining the nice numerical performance of PR and HS metho... Conjugate gradient optimization algorithms depend on the search directions.with different choices for the parameters in the search directions.In this note,by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991),a class of new restarting conjugate gradient methods is presented.Global convergences of the new method with two kinds of common line searches,are proved .Firstly,it is shown that,using reverse modulus of continuity funciton and forcing function,the new method for solving unconstrained optimization can work for a continously differentiable function with Curry-Altman's step size rule and a bounded level set .Secondly,by using comparing technique,some general convergence propecties of the new method with other kind of step size rule are established,Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method. 展开更多
关键词 全局收敛性 重开始共轭梯度算法 无约束非线性规划 强制函数 逆模 线性搜索 FR方法 HS方法 Curry-Altman步长法则
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部