|
Title
|
A q-Gradient Descent Algorithm with Quasi-Fejer Convergence for Unconstrained Optimization Problems
|
|
Type
|
JournalPaper
|
|
Keywords
|
descent methods; q-calculus; iterative methods; inexact line searches
|
|
Abstract
|
We present an algorithm for solving unconstrained optimization problems based on the q-gradient vector. The main idea used in the algorithm construction is the approximation of the classical gradient by a q-gradient vector. For a convex objective function, the quasi-Fejér convergence of the algorithm is proved. The proposed method does not require the boundedness assumption on any level set. Further, numerical experiments are reported to show the performance of the proposed method
|
|
Researchers
|
Mohammed K. A. Kaabar (Not In First Six Researchers), Bhagwat Ram (Fifth Researcher), Suvra Kanti Chakraborty (Fourth Researcher), Predrag Rajkovic (Second Researcher), Shashi Kant Mishra (First Researcher), Mohammad Esmael Samei (Third Researcher)
|