scholarly journals A New Nonlinear Conjugate Gradient Method Based on the Scaled Matrix

2017 ◽  
Vol 27 (5) ◽  
pp. 68
Author(s):  
Basim A. Hassan ◽  
Haneen A. Alashoor

In this paper, a new type nonlinear conjugate gradient method based on the ScaleMatrix is derived. The new method has the decent and globally convergentproperties under some assumptions. Numerical results indicate the efficiency ofthis method to solve the given test problems.

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Shengwei Yao ◽  
Xiwen Lu ◽  
Bin Qin

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.


2011 ◽  
Vol 58-60 ◽  
pp. 943-949
Author(s):  
Wan You Cheng ◽  
Xue Jie Liu

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.


2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Yuan-yuan Chen ◽  
Shou-qiang Du

The nonlinear conjugate gradient method is of particular importance for solving unconstrained optimization. Finitely many maximum functions is a kind of very useful nonsmooth equations, which is very useful in the study of complementarity problems, constrained nonlinear programming problems, and many problems in engineering and mechanics. Smoothing methods for solving nonsmooth equations, complementarity problems, and stochastic complementarity problems have been studied for decades. In this paper, we present a new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions. The new method also guarantees that any accumulation point of the iterative points sequence, which is generated by the new method, is a Clarke stationary point of the merit function for nonsmooth equations with finitely many maximum functions.


2018 ◽  
Vol 28 (3) ◽  
pp. 193 ◽  
Author(s):  
Basim A. Hassan

The conjugate gradient method an efficient technique for solving the unconstrained optimization problem. In this paper, we propose a new hybrid nonlinear conjugate gradient methods, which have the descent at every iteration and globally convergence properties under certain conditions. The numerical results show that new hybrid method are efficient for the given test problems.


Sign in / Sign up

Export Citation Format

Share Document