A New Class of Dai-Liao Method for Solving Iteration Problems
One of the key elements of conjugate gradient algorithms is the conjugate gradient directions. In this work, we used the modified secant equation to construct a new conjugate gradient coefficient. The global convergence and fundamental descent qualities of the derived algorithm set it apart and guarantee reliable performance in a variety of settings. Numerous numerical experiments on unconstrained optimisation issues have shown that the new formulae perform noticeably better than the current approaches. The performance of the suggested conjugate gradient scheme is specifically better than that of the conventional Hestenes-Stiefel (HS) conjugate gradient approach. The computing efficiency of unconstrained optimisation problems is improved by this development.
Authors
- Basim A. Hassan (ORCID: https://orcid.org/0000-0003-3510-9818)
- Mohammed Moussa (ORCID: https://orcid.org/0000-0002-7301-2569)
Institutions
- University of Mosul (IQ)
Publication Details
- Published
- 2025-05-23
- DOI
- https://doi.org/10.1109/ichora65333.2025.11017075
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00