A new hybrid three-term LS-CD conjugate gradient in solving unconstrained optimization problems
The Conjugate Gradient (CG) method is renowned for its rapid convergence in optimization applications. Over the years, several modifications to CG methods have emerged to improve computational efficiency and tackle practical challenges. This paper presents a new three-term hybrid CG method for solvi...
Main Authors: | Ishak, M.A.I., Marjugi, S.M. |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Putra Malaysia
2024
|
Online Access: | http://psasir.upm.edu.my/id/eprint/113151/1/113151.pdf |
Similar Items
-
A new modified conjugate gradient method under the strong Wolfe line search for solving unconstrained optimization problems
by: Ishak, M. I., et al.
Published: (2022) -
Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
by: Za’aba, Fatin Nadhirah, et al.
Published: (2021) -
A scaled three-term conjugate gradient method for unconstrained optimization
by: Arzuka, Ibrahim, et al.
Published: (2016) -
Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class
by: Sanaz Bojari, et al.
Published: (2024-01-01) -
Improved conjugate gradient methods for unconstrained optimization with modification and hybridization of conjugate gradient coefficients /
by: Abdullahi Ibrahim, 1984-, author, et al.
Published: (2018)