A sufficient descent nonlinear conjugate gradient method for solving M-tensor equations

2020 ◽  
Vol 371 ◽  
pp. 112709 ◽  
Author(s):  
Jiankun Liu ◽  
Shouqiang Du ◽  
Yuanyuan Chen
Keyword(s):  
Conjugate Gradient Method ◽  
Conjugate Gradient ◽  
Gradient Method ◽  
Nonlinear Conjugate Gradient Method ◽  
Nonlinear Conjugate Gradient ◽  
Sufficient Descent

A Hybrid Nonlinear Conjugate Gradient Method with Sufficient Descent Property

2011 ◽  
Vol 58-60 ◽  
pp. 943-949
Author(s):  
Wan You Cheng ◽  
Xue Jie Liu
Keyword(s):  
Conjugate Gradient Method ◽  
Conjugate Gradient ◽  
Gradient Method ◽  
Numerical Experiments ◽  
Test Problems ◽  
Sufficient Descent Property ◽  
Nonlinear Conjugate Gradient Method ◽  
Descent Property ◽  
Nonlinear Conjugate Gradient ◽  
Sufficient Descent

In this paper, on the basis of the recently developed HZ (Hager-Zhang) method [SIAM J. Optim., 16 (2005), pp. 170-192], we propose a hybrid descent conjugate gradient method which reserves the sufficient descent property of the HZ method. Under suitable conditions, we prove the global convergence of the proposed method. Extensive numerical experiments show that the method is promising for the test problems from the CUTE library.

scholarly journals A Modified Sufficient Descent Polak–Ribiére–Polyak Type Conjugate Gradient Method for Unconstrained Optimization Problems

Algorithms ◽  
2018 ◽  
Vol 11 (9) ◽  
pp. 133 ◽  
Author(s):  
Xiuyun Zheng ◽  
Jiarong Shi
Keyword(s):  
Conjugate Gradient Method ◽  
Conjugate Gradient ◽  
Gradient Method ◽  
Line Search ◽  
Optimization Problems ◽  
Nonlinear Conjugate Gradient Method ◽  
Modified Method ◽  
Unconstrained Optimization Problems ◽  
Nonlinear Conjugate Gradient ◽  
Sufficient Descent

In this paper, a modification to the Polak–Ribiére–Polyak (PRP) nonlinear conjugate gradient method is presented. The proposed method always generates a sufficient descent direction independent of the accuracy of the line search and the convexity of the objective function. Under appropriate conditions, the modified method is proved to possess global convergence under the Wolfe or Armijo-type line search. Moreover, the proposed methodology is adopted in the Hestenes–Stiefel (HS) and Liu–Storey (LS) methods. Extensive preliminary numerical experiments are used to illustrate the efficiency of the proposed method.

scholarly journals A Modified Conjugacy Condition and Related Nonlinear Conjugate Gradient Method

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Shengwei Yao ◽  
Xiwen Lu ◽  
Bin Qin
Keyword(s):  
Conjugate Gradient Method ◽  
Conjugate Gradient ◽  
Gradient Method ◽  
Large Scale ◽  
Optimization Problems ◽  
Special Role ◽  
Conjugacy Condition ◽  
Nonlinear Conjugate Gradient Method ◽  
Nonlinear Conjugate Gradient ◽  
The Given

The conjugate gradient (CG) method has played a special role in solving large-scale nonlinear optimization problems due to the simplicity of their very low memory requirements. In this paper, we propose a new conjugacy condition which is similar to Dai-Liao (2001). Based on this condition, the related nonlinear conjugate gradient method is given. With some mild conditions, the given method is globally convergent under the strong Wolfe-Powell line search for general functions. The numerical experiments show that the proposed method is very robust and efficient.

Sign in / Sign up

Export Citation Format

Share Document