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.
Subject
Statistics and Probability,Statistical and Nonlinear Physics,Analysis
Reference51 articles.
1. Méthode générale pour la résolution des systemes d’équations simultanées;Cauchy;Comp. Rend. Sci. Paris,1847
2. Introduction to Unconstrained Optimization with R;Mishra,2019
3. Fast gradient descent algorithm for image classification with neural networks
4. Granular regression with a gradient descent method
5. Annealed gradient descent for deep learning
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献