Bulletin of Computational Applied Mathematics (Bull CompAMa)
Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
Masoud Fatemi, Saman Babaie-Kafaki
To achieve the good features of the linear conjugate gradient algorithm in a recent extension of the Dai-Liao method, two adaptive choices for parameter of the extended method are proposed based on a penalization approach. It is shown that the suggested parameters guarantee the sufficient descent property independent to the line search and the objective function convexity. Furthermore, they ensure the global convergence of the related algorithm for uniformly convex objective functions. Using a set of unconstrained optimization test problems from the CUTEr library, effectiveness of the suggested choices are numerically compared with two other recently proposed adaptive choices. Results of comparisons show that one of the proposed choices is computationally promising in the sense of the Dolan-Moré performance profile.
Keywords: unconstrained optimization; conjugate gradient method; sufficient descent property; penalty method; line search.
Cite this paper:
Fatemi M., Babaie-Kafaki S., Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme,
Bull. Comput. Appl. Math. (Bull CompAMa),
Vol. 4, No. 1, Jan-Jun, pp.7-19, 2016.