A New Conjugate Gradient for Efficient Unconstrained Optimization with Robust Descent Guarantees
The Conjugate Gradient method is a powerful iterative algorithm aims to find the minimum of a function by iteratively searching along conjugate directions. This work presents a nonlinear conjugate gradient approach for unconstrained optimization, resulting from the resolution of a novel optimizatio...
Saved in:
| Main Author: | Hussein Saleem Ahmed |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
College of Computer and Information Technology – University of Wasit, Iraq
2025-06-01
|
| Series: | Wasit Journal of Computer and Mathematics Science |
| Subjects: | |
| Online Access: | http://wjcm.uowasit.edu.iq/index.php/wjcm/article/view/358 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Sufficient Descent 3-Term Conjugate Gradient Method for Unconstrained Optimization Algorithm
by: Ghada Moayid Al-Naemi, et al.
Published: (2023-12-01) -
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 THREE-TERM CONJUGATE GRADIENT METHOD FOR LARGE-SCALE MINIMIZATION IN ARTIFICIAL NEURAL NETWORKS
by: Umar A Omesa, et al.
Published: (2025-07-01) -
A modified of Dai and Yuan method for solving unconstrained optimization problems
by: Hussein Aljarjary, et al.
Published: (2024-12-01)