Abstract
This article deals with the global convergence of 3-Term Conjugate Gradient (3TCG) methods on general functions under a novel Inexact Line Search (ILS) strategy. The proposed algorithm satisfies the sufficient descent condition, and its global convergence can be easily proved. To verify the efficiency of the authors' theoretical approach, some numerical experiments and comparisons are presented. These results show that the suggested method is sufficiently efficient and comparable to new similar strategies for solving unconstrained optimization problems.
Disclosure statement
No actual or potential conflict of interest was reported by the authors.
Open access
This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons License, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons License, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons License and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommonshorg/licenses/by/4.0/.
Data availability statement
The authors confirm that the data supporting the findings of this study are available within the article and its supplemental data. Raw data that support the finding of this study are available from the corresponding author, upon reasonable request.