New parameter of conjugate gradient method for unconstrained nonlinear optimization

  • Mohamed Lamine Ouaoua Laboratory of Fundamental and Numerical Mathematics, Department of Mathematics, Faculty of Sciences, Setif 1 University-Ferhat Abbas, 19000, Algeria
  • Samia Khelladi Laboratory of Fundamental and Numerical Mathematics, Department of Mathematics, Faculty of Sciences, Setif 1 University-Ferhat Abbas, 19000, Algeria
  • Djamel Benterki Laboratory of Fundamental and Numerical Mathematics, Department of Mathematics, Faculty of Sciences, Setif 1 University-Ferhat Abbas, 19000, Algeria
Keywords: Unconstrained optimization, Conjugate gradient method, Descent direction, Inexact line search, Global convergence

Abstract

We are interested in the performance of nonlinear conjugate gradient methods for unconstrained optimization. Inparticular, we address the conjugate gradient algorithm with strong Wolfe inexact line search. Firstly, we study the descentproperty of the search direction of the considered conjugate gradient algorithm based on a new direction obtained from anew parameter. The main objective of this parameter is to improve the speed of the convergence of the obtained algorithm.Then, we present a complete study that shows the global convergence of this algorithm. Finally, we establish comparativenumerical experiments on well-known test examples to show the efficiency and robustness of our algorithm compared toother recent algorithms.
Published
2025-02-24
How to Cite
Ouaoua, M. L., Khelladi, S., & Benterki, D. (2025). New parameter of conjugate gradient method for unconstrained nonlinear optimization. Statistics, Optimization & Information Computing, 13(6), 2382-2390. https://doi.org/10.19139/soic-2310-5070-2069
Section
Research Articles