Volume 55, Number 6, November-December 2021
|Page(s)||3281 - 3291|
|Published online||15 November 2021|
A new family of Dai-Liao conjugate gradient methods with modified secant equation for unconstrained optimization
School of Mathematics and Information Science, Henan Normal University, Xinxiang 453007, PR China
* Corresponding author: firstname.lastname@example.org
Accepted: 16 October 2021
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.
Mathematics Subject Classification: 65K05 / 90C26 / 90C30
Key words: Conjugate gradient method / Dai-Liao–type method / modified secant equation
© The authors. Published by EDP Sciences, ROADEF, SMAI 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.