A THREE-TERM CONJUGATE GRADIENT METHOD FOR LARGE-SCALE MINIMIZATION IN ARTIFICIAL NEURAL NETWORKS
Conjugate Gradient (CG) methods are widely used for solving unconstrained optimization problems due to their efficiency and low memory requirements. However, standard CG methods may not always guarantee sufficient descent condition, which can impact their robustness and convergence behavior. Additio...
Saved in:
| Main Authors: | Umar A Omesa, Muhammad Y. Waziri, Issam A. R. Moghrabi, Sulaiman M. Ibrahim, Gudu E B, Fakai S L, Rabiu Bashir Yunus, Elissa Nadia Madi |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Pattimura
2025-07-01
|
| Series: | Barekeng |
| Subjects: | |
| Online Access: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17704 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A New Formula for Conjugate Gradient in Unconstrained Optimization
by: Hussein Wali, et al.
Published: (2020-05-01) -
A New Hybrid of DY and CGSD Conjugate Gradient Methods for Solving Unconstrained Optimization Problems
by: Zeyad Mohammed Abdullah, et al.
Published: (2021-09-01) -
A New Conjugate Gradient for Efficient Unconstrained Optimization with Robust Descent Guarantees
by: Hussein Saleem Ahmed
Published: (2025-06-01) -
A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm
by: Ghada Moayid Al-Naemi, et al.
Published: (2023-12-01) -
A Sufficient Descent Property for a Different Parameter to Enhance Three-Term Method
by: Ghada Al-Naemi, et al.
Published: (2023-06-01)