A new family of Dai-Liao conjugate gradient methods with modified secant equation for unconstrained optimization

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper, a new family of Dai-Liao-type conjugate gradient methods are proposed for unconstrained optimization problem. In the new methods, the modified secant equation used in [H. Yabe and M. Takano, Comput. Optim. Appl. 28 (2004) 203-225] is considered in Dai and Liao's conjugacy condition. Under some certain assumptions, we show that our methods are globally convergent for general functions with strong Wolfe line search. Numerical results illustrate that our proposed methods can outperform some existing ones.

Cite

CITATION STYLE

APA

Zheng, Y. (2021). A new family of Dai-Liao conjugate gradient methods with modified secant equation for unconstrained optimization. RAIRO - Operations Research, 55(6), 3281–3291. https://doi.org/10.1051/ro/2021159

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