A q-gradient descent algorithm with quasi-fejer convergence for unconstrained optimization problems

Mishra, Shashi Kant and Rajkovic, Predrag and Samei, Mohammad Esmael and Chakraborty, Suvra Kanti and Ram, Bhagwat and Kaabar, Mohammed K. A. (2021) A q-gradient descent algorithm with quasi-fejer convergence for unconstrained optimization problems. Fractal and Fractional, 5 (3). ISSN 2504-3110, DOI https://doi.org/10.3390/fractalfract5030110.

Full text not available from this repository.

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-Fejer 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.

Item Type: Article
Funders: UNSPECIFIED
Uncontrolled Keywords: Descent methods; Q-calculus; Iterative methods; Inexact line searches
Subjects: Q Science > Q Science (General)
Q Science > QA Mathematics
Divisions: Faculty of Science > Institute of Mathematical Sciences
Depositing User: Ms Zaharah Ramly
Date Deposited: 26 Jul 2022 08:16
Last Modified: 26 Jul 2022 08:16
URI: http://eprints.um.edu.my/id/eprint/28187

Actions (login required)

View Item View Item