A New Formula for Conjugate Gradient in Unconstrained Optimization
DOI:
https://doi.org/10.25130/tjps.v27i1.87الكلمات المفتاحية:
Unconstrained Optimization; (CG) Method; Wolfe Line Search; Global Convergenceالملخص
The method of Conjugate Gradient (CG) is a key component of optimization methods that aren't bound by local convergence characteristics. In this study, we created KHI3, a novel search direction in the (CG) Algorithm. The novel approach satisfies the regression criterion. The overall convergence of the proposed technique has also been proved utilizing Wolff search line words. A new algorithm for solving the large-scale unconstrained optimization issue is particularly successful.
التنزيلات
منشور
كيفية الاقتباس
الرخصة
الحقوق الفكرية (c) 2022 Tikrit Journal of Pure Science
هذا العمل مرخص بموجب 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.
