Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)
From MaRDI portal
Publication:4603039
DOI10.1137/16M108940XzbMath1391.90476arXiv1608.03861WikidataQ55074312 ScholiaQ55074312MaRDI QIDQ4603039
Donghwan Kim, Jeffrey A. Fessler
Publication date: 14 February 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.03861
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Discrete approximations in optimal control (49M25)
Related Items (14)
Accelerated proximal algorithms with a correction term for monotone inclusions ⋮ Sparse matrix linear models for structured high-throughput data ⋮ Generalizing the Optimized Gradient Method for Smooth Convex Minimization ⋮ Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods ⋮ Unnamed Item ⋮ Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods ⋮ Inertial, Corrected, Primal-Dual Proximal Splitting ⋮ A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection ⋮ Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems ⋮ Accelerated proximal point method for maximally monotone operators ⋮ Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions ⋮ A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method
Uses Software
Cites Work
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Optimized first-order methods for smooth convex minimization
- An optimal variant of Kelley's cutting-plane method
- Gradient methods for minimizing composite functions
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- The exact information-based complexity of smooth convex minimization
- On the convergence analysis of the optimized gradient method
- Introductory lectures on convex optimization. A basic course.
- A fast dual proximal gradient algorithm for convex minimization and applications
- Performance of first-order methods for smooth convex minimization: a novel approach
- Iteration complexity analysis of dual first-order methods for conic convex programming
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
- Proximal Splitting Methods in Signal Processing
- Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization
- Graph Implementations for Nonsmooth Convex Programs
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Generalizing the Optimized Gradient Method for Smooth Convex Minimization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Fast Alternating Direction Optimization Methods
- Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
This page was built for publication: Another Look at the Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)
