.png){kind=icon}
返回
Machine Learning and Deep Learning Optimization Algorithms for Unconstrained Convex Optimization Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2024.3522361.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 Short-Term Memory (LSTM) and Multilayer Perceptron (MLP). Through empirical experiments, convergence speed, solution accuracy and robustness, is evaluated providing insights to aid algorithm selection. The convergence dynamics of convex optimization, is explored analyzing classical algorithms and contemporary neural network (NN) methodologies. The study concludes with a comparative assessment of these algorithms performance metrics and their respective strengths and weaknesses.
Keyword:
Optimization
Convex functions
Convergence
Training
Long short term memory
Heuristic algorithms
Machine learning algorithms
Linear programming
Accuracy
Adaptation models
Adaptive moment estimation (Adam)
convex optimization
deep learning (DL)
gradient descent (GD)
long short term memory (LSTM) networks
machine learning (ML)
mathematical optimization
multilayer perceptron (MLP)
nesterov accelerated gradient (NAG)
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
A Preoperative and Postoperative Study of the Accuracy and Value of Electrodiagnosis in Patients with Lumbosacral Disc Herniation.png)
Spine
SpineIF0
PREAI
分享收藏Adenovirus early region 1A enables viral and cellular transforming genes to transform primary cells in cultureNature
NatureIF0
PREAI
分享收藏An Overview of Machine Learning-Based Techniques for Solving Optimization Problems in Communications and Signal ProcessingIEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏分享收藏
查看更多内容