A three-terms Polak–Ribière–Polyak conjugate gradient algorithm for large-scale nonlinear equations

作者:

Highlights:

摘要

In this paper, a conjugate gradient algorithm for systems of large-scale nonlinear equations is designed by the following steps: (i) A three-terms conjugate gradient direction dk is presented where the direction possesses the sufficient descent property and the trust region property independent of line search technique; (ii) A backtracking line search technique along the direction is proposed to get the step length αk and construct a point; (iii) If the point satisfies the given condition then it is the next point, otherwise the projection-proximal technique is used and get the next point. Both the direction and the line search technique are the derivative-free approaches, then the large-scale nonlinear equations are successfully solved (100,000 variables). The global convergence of the given algorithm is established under suitable conditions. Numerical results show that the proposed method is efficient for large-scale problems.

论文关键词:90C26,Nonlinear equations,Large-scale,Conjugate gradient,Global convergence

论文评审过程:Received 21 August 2013, Revised 31 January 2015, Available online 16 March 2015.

论文官网地址:https://doi.org/10.1016/j.cam.2015.03.014