Year: 2024
Type: article
Abstract: In this work several a Tree –Term Conjugate -Gradient (CG) – algorithms are Modified; and that satisfies the sufficient descent condition and a global convergence . primariliy, us- have derive three new methods of this type algorithms . and we compared with (HS) , (PR) and (LS). Algorithms by using (15) Well-Known test functions. And by using Wolfe and Strong Wolfe condition on every iteration. These new algorithms are used different memory less (BFGS) algorithms. Our new numerical results are proved very robust and efficient than the same classes of algorithms.
Author: Farhan Khalaf Muord
Institution: University of Mosul
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4404421311
