A q-gradient descent algorithm with quasi-fejer convergence for unconstrained optimization problems
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 algorith...
Saved in:
Main Authors: | , , , , , |
---|---|
Format: | Article |
Published: |
MDPI
2021
|
Subjects: | |
Online Access: | http://eprints.um.edu.my/28187/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Malaya |