Research Info

Home /On q-variant of Dai–Yuan ...
Title On q-variant of Dai–Yuan conjugate gradient algorithm for unconstrained optimization problems
Type JournalPaper
Keywords Conjugate gradient method · Global convergence · Wolfe conditions
Abstract In this paper, we propose a modified q-Dai–Yuan (q-DY) conjugate gradient algorithm based on q-gradient for solving unconstrained optimization problems. The q-gradient is calculated based on qderivative that requires a dilation parameter q for controlling the balance between the local and global search. The strong global convergence of the algorithm is proved under standardWolfe conditions, and numerical results show the efficiency of the proposed algorithm
Researchers Bhagwat Ram (Fourth Researcher), Suvra Kanti Chakraborty (Third Researcher), Shashi Kant Mishra (Second Researcher), Mohammad Esmael Samei (First Researcher)