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: | https://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 Hybrid of DY and CGSD Conjugate Gradient Methods for Solving Unconstrained Optimization Problems
by: Zeyad Mohammed Abdullah, et al.
Published: (2021-09-01) -
A Novel Conjugate Gradient Algorithm as a Convex Combination of Classical Conjugate Gradient Methods
by: Sara Sahib Mohammed Zaki, et al.
Published: (2025-04-01) -
A New Formula for Conjugate Gradient in Unconstrained Optimization
by: Isam H. Hali, et al.
Published: (2022-12-01) -
A New Scaled Three-Term Conjugate Gradient Algorithms For Unconstrained Optimization
by: Zeyad M. Abdullah, et al.
Published: (2023-08-01)