.png){kind=icon}
返回
Inexact proximal gradient algorithm with random reshuffling for nonsmooth optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-023-4095-y.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Proximal gradient algorithms are popularly implemented to achieve convex optimization with nonsmooth regularization. Obtaining the exact solution of the proximal operator for nonsmooth regularization is challenging because errors exist in the computation of the gradient; consequently, the design and application of inexact proximal gradient algorithms have attracted considerable attention from researchers. This paper proposes computationally efficient basic and inexact proximal gradient descent algorithms with random reshuffling. The proposed stochastic algorithms take randomly reshuffled data to perform successive gradient descents and implement only one proximal operator after all data pass through. We prove the convergence results of the proposed proximal gradient algorithms under the sampling-without-replacement reshuffling scheme. When computational errors exist in gradients and proximal operations, the proposed inexact proximal gradient algorithms can converge to an optimal solution neighborhood. Finally, we apply the proposed algorithms to compressed sensing and compare their efficiency with some popular algorithms.
Keyword:
proximal operator
random reshuffling
inexact computation
compressed sensing
nonsmooth optimization
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
.png){kind=icon}
Residual-Based False Data Injection Attacks Against Multi-Sensor Estimation Systems针对多传感器估计系统的基于残差的虚假数据注入攻击
PREAI
分享收藏Graphene/Ionic Liquid Binary Electrode Material for High Performance Supercapacitor用于高性能超级电容器的石墨烯/离子液体二元电极材料
PREAI
分享收藏分享收藏Distributed Multiproximal Algorithm for Nonsmooth Convex Optimization With Coupled Inequality Constraints耦合不等式约束的非光滑凸优化问题的分布式多近邻算法
PREAI
分享收藏
查看更多内容