Local Linear Convergence of Forward-Backward under Partial Smoothness
Not on the map. Why?
Abstract (arXiv)
In this paper, we consider the Forward--Backward proximal splitting algorithm to minimize the sum of two proper convex functions, one of which having a Lipschitz continuous gradient and the other being partly smooth relative to an active manifold M. We propose a generic framework under which we show that the Forward--Backward (i) correctly identifies the active manifold M in a finite number of iterations, and then (ii) enters a local linear convergence regime that we characterize precisely. This gives a grounded and unified explanation to the typical behaviour that has been observed numerically for many problems encompassed in our framework, including the Lasso, the group Lasso, the fused Lasso and the nuclear norm regularization to name a few. These results may have numerous applications including in signal/image processing processing, sparse recovery and machine learning.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Jul 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 3; 2024: 2; 2025: 1; 2026: 1.
13 papers.
Sort:
- 2021Implicit differentiation for fast hyperparameter selection in non-smooth convex learningcited by 22
- 2021Stable and Interpretable Unrolled Dictionary Learningcited by 15
- 2022Fixed-Point Automatic Differentiation of Forward--Backward Splitting Algorithms for Partly Smooth Functionscited by 4
- 2022Coordinate Descent for SLOPEcited by 4
- 2023Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimizationcited by 4
- 2022Accelerating Frank-Wolfe via Averaging Step Directionscited by 2
- 2021WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditionscited by 1
- 2023Implicit Differentiation for Hyperparameter Tuning the Weighted Graphical Lassocited by 1
- 2024Automatic Differentiation of Optimization Algorithms with Time-Varying Updatescited by 1
- 2025A Morse-Bott Framework for Blind Inverse Problems: Local Recovery Guarantees and the Failure of the MAPcited by 1
- 2023Reducing Discretization Error in the Frank-Wolfe Methodcited by 0
- 2024Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimizationcited by 0
- 2026Dynamic Proximal Gradient Algorithms for Schatten-p Quasi-Norm Regularized Problems27 Feb 2026
- 2025A Morse-Bott Framework for Blind Inverse Problems: Local Recovery Guarantees and the Failure of the MAP4 Aug 2025
- 2024Automatic Differentiation of Optimization Algorithms with Time-Varying Updates21 Oct 2024
- 2024Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization22 Jun 2024
- 2023Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization2 Nov 2023
- 2023Implicit Differentiation for Hyperparameter Tuning the Weighted Graphical Lasso5 Jul 2023
- 2023Reducing Discretization Error in the Frank-Wolfe Method4 Apr 2023
- 2022Coordinate Descent for SLOPE26 Oct 2022
- 2022Fixed-Point Automatic Differentiation of Forward--Backward Splitting Algorithms for Partly Smooth Functions5 Aug 2022
- 2022Accelerating Frank-Wolfe via Averaging Step Directions24 May 2022
- 2021WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditions24 Oct 2021
- 2021Stable and Interpretable Unrolled Dictionary Learning31 May 2021
- 2021Implicit differentiation for fast hyperparameter selection in non-smooth convex learningcited by 22
- 2021Stable and Interpretable Unrolled Dictionary Learningcited by 15
- 2022Fixed-Point Automatic Differentiation of Forward--Backward Splitting Algorithms for Partly Smooth Functionscited by 4
- 2022Coordinate Descent for SLOPEcited by 4
- 2023Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimizationcited by 4
- 2022Accelerating Frank-Wolfe via Averaging Step Directionscited by 2
- 2021WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditionscited by 1
- 2023Implicit Differentiation for Hyperparameter Tuning the Weighted Graphical Lassocited by 1
- 2024Automatic Differentiation of Optimization Algorithms with Time-Varying Updatescited by 1
- 2025A Morse-Bott Framework for Blind Inverse Problems: Local Recovery Guarantees and the Failure of the MAPcited by 1
- 2023Reducing Discretization Error in the Frank-Wolfe Methodcited by 0
- 2024Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimizationcited by 0
12 most cited of 13 All 13 (JSON)
- 2026Dynamic Proximal Gradient Algorithms for Schatten-p Quasi-Norm Regularized Problems27 Feb 2026
- 2025A Morse-Bott Framework for Blind Inverse Problems: Local Recovery Guarantees and the Failure of the MAP4 Aug 2025
- 2024Automatic Differentiation of Optimization Algorithms with Time-Varying Updates21 Oct 2024
- 2024Efficient Low-rank Identification via Accelerated Iteratively Reweighted Nuclear Norm Minimization22 Jun 2024
- 2023Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization2 Nov 2023
- 2023Implicit Differentiation for Hyperparameter Tuning the Weighted Graphical Lasso5 Jul 2023
- 2023Reducing Discretization Error in the Frank-Wolfe Method4 Apr 2023
- 2022Coordinate Descent for SLOPE26 Oct 2022
- 2022Fixed-Point Automatic Differentiation of Forward--Backward Splitting Algorithms for Partly Smooth Functions5 Aug 2022
- 2022Accelerating Frank-Wolfe via Averaging Step Directions24 May 2022
- 2021WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditions24 Oct 2021
- 2021Stable and Interpretable Unrolled Dictionary Learning31 May 2021
12 newest of 13 All 13 (JSON)