A globally convergent version of the Polak-Ribière conjugate gradient method

1997 ◽  
Vol 78 (3) ◽  
pp. 375-391 ◽  
Author(s):  
L. Grippo ◽  
S. Lucidi
2013 ◽  
Vol 694-697 ◽  
pp. 2783-2786
Author(s):  
Li Hua Guo ◽  
Wen Cheng Tang

The subproblem of the globally convergent version of method of moving asymptotes (GCMMA) was deeply studied and realized by Lagrange dual method, sequential unconstrained minimization technique (SUMT) and conjugate gradient method. Based on the convex, separable and conservative properties of subproblem, a dual problem was built by using Lagrange dual method. The dual problem was transformed into unconstrained optimization problem using SUMT and solved by conjugate gradient method. Finally, the feasibility of solution of subproblem is demonstrated by truss structural optimization problem. Comparing with other optimization algorithms, GCMMA can converge to the global optimal solution.


2013 ◽  
Vol 2013 ◽  
pp. 1-14
Author(s):  
Yuan-Yuan Huang ◽  
San-Yang Liu ◽  
Xue-Wu Du ◽  
Xiao-Liang Dong

We consider a hybrid Dai-Yuan conjugate gradient method. We confirm that its numerical performance can be improved provided that this method uses a practical steplength rule developed by Dong, and the associated convergence is analyzed as well.


2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Hongbo Guan ◽  
Sheng Wang

In this paper, we propose a modified Polak–Ribière–Polyak (PRP) conjugate gradient method for solving large-scale nonlinear equations. Under weaker conditions, we show that the proposed method is globally convergent. We also carry out some numerical experiments to test the proposed method. The results show that the proposed method is efficient and stable.


Sign in / Sign up

Export Citation Format

Share Document