A New Scaled Three-Term Conjugate Gradient Algorithms For Unconstrained Optimization
DOI:
https://doi.org/10.25130/tjps.v28i4.1534Keywords:
Three-Term Conjugate Gradient method, Unconstrained Optimization, Global convergenceAbstract
Since optimization problems are getting more complicated, new ways to solve them must be thought of, or existing methods must be improved. In this research, we expand the different parameters of the three-term conjugate gradient method to work out unconstrained optimization problems. Our new CG approach meets the conditions of sufficient descent, and global convergence. In addition, we describe some numerical results that imply comparisons to relevant methodologies in the existing research literature.
Downloads
Published
How to Cite
License
Copyright (c) 2023 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.