Investigation a Conjuacy a Conjugacy Coefficient for Conjugate Gradient Method to Solving Unconstrained Optimization Problems
In this research, a new conjugacy coefficient is derived for conjugate gradient method(C.G) and a new direction was obtained. In theory, this direction achieve sufficiently desent condition by using strong wolfe line search and global convergence is proved. When contrasted with the starnder HS (C.G)...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mosul University
2025-06-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.uomosul.edu.iq/article_186827_e4317d3dea03c6135625a0bd94f1f82b.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this research, a new conjugacy coefficient is derived for conjugate gradient method(C.G) and a new direction was obtained. In theory, this direction achieve sufficiently desent condition by using strong wolfe line search and global convergence is proved. When contrasted with the starnder HS (C.G) technique, the numerical performance of this approach is very remarkable. The Dolan-More performance profile was applied in order to carry out this determination. The amount of time that the central processing unit (CPU) spends, the number of iterations (NOI), and the number of function evaluations (NOF) all play a role in determining this profile. It was determined through the utilization of the Dolan-More profile that this was the case. |
|---|---|
| ISSN: | 1815-4816 2311-7990 |