New Hybrid Conjugate Gradient Method as a Convex Combination of Dai–Liao and Wei–Yao–Liu
DOI:
https://doi.org/10.25130/tjps.v26i6.199Abstract
In this research, a new method of hybrid conjugated gradient methods was developed. This method is based mainly on the hybridization of Dia-Laio and Wei-Yao-Liu algorithms, by using convex fitting and conjugate condition of line Uncontrolled search. The resulting algorithm fulfills the condition of sufficient proportions and has universal convergence under certain assumptions. The numerical results indicated the efficiency of this method in solving nonlinear test functions in the given unconstrained optimization.
Downloads
Published
How to Cite
License
Copyright (c) 2022 Tikrit Journal of Pure Science
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.