A new class of spectral conjugate gradient methods based on a modified secant equation for unconstrained optimization

8Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

Conjugate gradient methods have played a special role for solving large scale optimization problems due to the simplicity of their iteration, convergence properties and their low memory requirements. In this work, we propose a new class of spectral conjugate gradient methods which ensures sufficient descent independent of the accuracy of the line search. Moreover, an attractive property of our proposed methods is that they achieve a high-order accuracy in approximating the second order curvature information of the objective function by utilizing the modified secant condition proposed by Babaie-Kafaki et al. [S. Babaie-Kafaki, R. Ghanbari, N. Mahdavi-Amiri, Two new conjugate gradient methods based on modified secant equations, Journal of Computational and Applied Mathematics 234 (2010) 1374-1386]. Further, a global convergence result for general functions is established provided that the line search satisfies the Wolfe conditions. Our numerical experiments indicate that our proposed methods are preferable and in general superior to the classical conjugate gradient methods in terms of efficiency and robustness. © 2012 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Livieris, I. E., & Pintelas, P. (2013). A new class of spectral conjugate gradient methods based on a modified secant equation for unconstrained optimization. Journal of Computational and Applied Mathematics, 239(1), 396–405. https://doi.org/10.1016/j.cam.2012.09.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free