Sharper Bounds for Proximal Gradient Algorithms with Errors

DOI10.1137/22m1480161arXiv2203.02204OpenAlexW4391029680MaRDI QIDQ6188503

João F. C. Mota, Andrew M. Wallace, Anis Hamadouche, Yun Wu

Publication date: 7 February 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.02204

zbMATH Keywords

convex optimizationapproximate algorithmsproximal gradient descent

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Model predictive control system design and implementation using \texttt{MATLAB}
• Introductory lectures on convex optimization. A basic course.
• Support-vector networks
• Convergence of stochastic proximal gradient algorithm
• Non-smooth non-convex Bregman minimization: unification and new algorithms
• Spacecraft attitude control using explicit model predictive control
• Accelerated and Inexact Forward-Backward Algorithms
• Maximum Hands-Off Control: A Paradigm of Control Effort Minimization
• Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
• Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
• First-Order Methods in Optimization
• High-Dimensional Statistics
• Accuracy and Stability of Numerical Algorithms
• Convex Optimization in Signal Processing and Communications
• Fast Image Recovery Using Variable Splitting and Constrained Optimization
• Signal Recovery by Proximal Forward-Backward Splitting