Convex combination of parameter CG Algorithms for Dai and Liao methods in Unconstrained Optimization
Abstract
This paper studies the two – term conjugate gradient method for unconstrained optimization problem. Our idea is based on work scaled as convex combination of the Dai and Liao CG method. The conjugacy condition and global convergence for the proposed algorithms are satisfied under some assumptions. For our numerical results we have applied this algorithm this algorithm on the set of well-known test nonlinear functions in the unconstrained optimization.
How to Cite This Article
Khalil K Abbo, Aynur J Namik (2025). Convex combination of parameter CG Algorithms for Dai and Liao methods in Unconstrained Optimization . International Journal of Multidisciplinary Research and Growth Evaluation (IJMRGE), 6(4), 1009-1013.