A convex combination conjugate gradient algorithm with application in mode function
A. E. Mehamdia, Y. Chaib, T. Bechouat
Source record
Source: Crossref
Published: Oct 6, 2026
DOI: 10.29229/uzmj.2026-3-14
Open original source ↗Source abstract
Conjugate gradient methods are a popular class of iterative methods for solving linear systems of equations and nonlinear optimization problems. In this paper, we suggest a new hybrid nonlinear conjugate gradient method, in which the conjugate gradient coefficient is a convex combination of and . With the strong Wolfe line search, the descent property and global convergence of the new hybrid method are proved. The numerical results also show that our method is robust and efficient. Furthermore, the proposed algorithm was extended to solve the problem of mode function.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.