Machine Learning and Deep Learning Optimization Algorithms for Unconstrained Convex Optimization Problem

Machine Learning and Deep Learning Optimization Algorithms for Unconstrained Convex Optimization Problem

This paper conducts a thorough comparative analysis of optimization algorithms for an unconstrained convex optimization problem. It contrasts traditional methods like Gradient Descent (GD) and Nesterov Accelerated Gradient (NAG) with modern techniques such as Adaptive Moment Estimation (Adam), Long...

Full description

Bibliographic Details
Main Authors: Kainat Naeem, Amal Bukhari, Ali Daud, Tariq Alsahfi, Bader Alshemaimri, Mousa Alhajlah
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Access
Subjects:
Adaptive moment estimation (Adam)
convex optimization
deep learning (DL)
gradient descent (GD)
long short term memory (LSTM) networks
machine learning (ML)
Online Access:https://ieeexplore.ieee.org/document/10815950/

Internet

https://ieeexplore.ieee.org/document/10815950/

Similar Items