Applying FISTA to optimization problems (with or) without minimizers
From MaRDI portal
Publication:2205981
DOI10.1007/s10107-019-01415-xzbMath1451.90116arXiv1811.09313OpenAlexW2964079700WikidataQ127448629 ScholiaQ127448629MaRDI QIDQ2205981
Heinz H. Bauschke, Minh N. Bui, Shawn Xianfu Wang
Publication date: 21 October 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.09313
Numerical mathematical programming methods (65K05) Convex programming (90C25) Decomposition methods (49M27)
Related Items (3)
Fast augmented Lagrangian method in the convex regime with convergence guarantees for the iterates ⋮ Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems ⋮ On FISTA with a relative error rule
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Consistent learning by composite proximal thresholding
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
- The forward-backward algorithm and the normal problem
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- Asymptotic behavior of contractions in Hilbert space
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- On the convergence of the forward–backward splitting method with linesearches
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Accelerated and Inexact Forward-Backward Algorithms
- Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- Problems in Real Analysis
- Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods
- First-Order Methods in Optimization
- Convergence Rates of Inertial Forward-Backward Algorithms
- Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- An introduction to continuous optimization for imaging
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Applying FISTA to optimization problems (with or) without minimizers
