Multi-Time Scale Smoothed Functional With Nesterov’s Acceleration
Smoothed functional (SF) algorithm estimates the gradient of the stochastic optimization problem by convolution with a smoothening kernel. This process helps the algorithm to converge to a global minimum or a point close to it. We study a two-time scale SF based gradient search algorithm with Nester...
Main Authors: | Abhinav Sharma, K. Lakshmanan, Ruchir Gupta, Atul Gupta |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2021-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9509526/ |
Similar Items
-
Iterative Learning Control Based on Nesterov Accelerated Gradient Method
by: Panpan Gu, et al.
Published: (2019-01-01) -
A Novel Thresholding Algorithm for Image Deblurring Beyond Nesterov’s Rule
by: Zhi Wang, et al.
Published: (2018-01-01) -
Nonconvex matrix completion with Nesterov’s acceleration
by: Xiao-Bo Jin, et al.
Published: (2018-12-01) -
Generalized Nesterov Accelerated Conjugate Gradient Algorithm for a Compressively Sampled MR Imaging Reconstruction
by: Xiuhan Li, et al.
Published: (2020-01-01) -
Stochastic Momentum Method With Double Acceleration for Regularized Empirical Risk Minimization
by: Zhijian Luo, et al.
Published: (2019-01-01)