AN ADAPTIVE CONJUGACY CONDITION AND RELATED NONLINEAR CONJUGATE GRADIENT METHODS

2014 ◽  
Vol 11 (04) ◽  
pp. 1350092 ◽  
Author(s):  
SAMAN BABAIE-KAFAKI

In an attempt to find a reasonable solution for an open problem propounded by Andrei in nonlinear conjugate gradient methods, an adaptive conjugacy condition is proposed. The suggested condition is designed based on an implicit switch from a conjugacy condition to the standard secant equation, using an extended conjugacy condition proposed by Dai and Liao. Following the approach of Dai and Liao, two adaptive nonlinear conjugate gradient methods are proposed based on the suggested adaptive conjugacy condition. An interesting feature of one of the proposed methods is the adaptive switch between the nonlinear conjugate gradient methods proposed by Hestenes and Stiefel, and Perry. Under proper conditions, it is shown that one of the proposed methods is globally convergent for uniformly convex functions and the other is globally convergent for general functions. Numerical results demonstrating the effectiveness of the proposed adaptive approach in the sense of the performance profile introduced by Dolan and Moré are reported.

Author(s):  
Aseel M. Qasim ◽  
Zinah F. Salih ◽  
Basim A. Hassan

The primarily objective of this paper which is indicated in the field of conjugate gradient algorithms for unconstrained optimization problems and algorithms is to show the advantage of the new proposed algorithm in comparison with the standard method which is denoted as. Hestenes Stiefel method, as we know the coefficient conjugate parameter is very crucial for this reason, we proposed a simple modification of the coefficient conjugate gradient which is used to derived the new formula for the conjugate gradient update parameter described in this paper. Our new modification is based on the conjugacy situation for nonlinear conjugate gradient methods which is given by the conjugacy condition for nonlinear conjugate gradient methods and added a nonnegative parameter to suggest the new extension of the method. Under mild Wolfe conditions, the global convergence theorem and lemmas are also defined and proved. The proposed method's efficiency is programming and demonstrated by the numerical instances, which were very encouraging.


2000 ◽  
Vol 10 (2) ◽  
pp. 345-358 ◽  
Author(s):  
Yuhong Dai ◽  
Jiye Han ◽  
Guanghui Liu ◽  
Defeng Sun ◽  
Hongxia Yin ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document