Convergence Rate Analysis of Accelerated Forward-Backward Algorithm with Generalized Nesterov Momentum Scheme
From MaRDI portal
Publication:6143259
DOI10.4208/IJNAM2023-1022arXiv2112.05873OpenAlexW4377252607MaRDI QIDQ6143259
No author found.
Publication date: 23 January 2024
Published in: International Journal of Numerical Analysis and Modeling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.05873
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Linear convergence of iterative soft-thresholding
- The Moreau envelope approach for the L1/TV image denoising model
- Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- Proximity algorithms for image models: denoising
- An EM algorithm for wavelet-based image restoration
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Convergence Rate Analysis of Accelerated Forward-Backward Algorithm with Generalized Nesterov Momentum Scheme