A hybridization of the Hestenes-Stiefel and Dai-Yuan Conjugate Gradient Methods
Keywords:Conjugate gradient, Convergence, Convex optimization
The paper in discusses conjugate gradient methods, which are often used for unconstrained optimization and are the subject of this discussion. In the process of studying and implementing conjugate gradient algorithms, it is standard practice to assume that the descent condition is true. Despite the fact that this sort of approach very seldom results in search routes that slope in a downward direction, this assumption is made routinely. As a result of this research, we propose a revised method known as the improved hybrid conjugate gradient technique. This method is a convex combination of the Dai-Yuan and Hestenes-Stiefel methodologies. The descending property and global convergence are both exhibited by the Wolfe line search. The numerical data demonstrates that the strategy that was presented is an efficient one.
Copyright (c) 2023 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.