Parameter-free FISTA by adaptive restart and backtracking
From MaRDI portal
Publication:6622751
Recommendations
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
- Improving ``fast iterative shrinkage-thresholding algorithm: faster, smarter, and greedier
- Fast first-order methods for composite convex optimization with backtracking
- FISTA is an automatic geometrically optimized algorithm for strongly convex functions
- Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Generalized Accelerated Composite Gradient Method: Uniting Nesterov's Fast Gradient Method and FISTA
- A scaled and adaptive FISTA algorithm for signal-dependent sparse image super-resolution problems
- Accelerated and inexact forward-backward algorithms
- Accelerated iterative regularization via dual diagonal descent
- Activity identification and local linear convergence of forward-backward-type methods
- Adaptive restart for accelerated gradient schemes
- Adaptive restart of accelerated gradient methods under local quadratic growth condition
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization
- An introduction to continuous optimization for imaging
- Backtracking strategies for accelerated descent methods with smooth composite objectives
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- Convergence rates of inertial forward-backward algorithms
- Convergence rates of the heavy-ball method under the Łojasiewicz property
- FISTA is an automatic geometrically optimized algorithm for strongly convex functions
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Fast first-order methods for composite convex optimization with backtracking
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- First-order methods in optimization
- From error bounds to the complexity of first-order descent methods for convex functions
- Gradient methods for minimizing composite functions
- Improving ``fast iterative shrinkage-thresholding algorithm: faster, smarter, and greedier
- Inertial variable metric techniques for the inexact forward-backward algorithm
- Introductory lectures on convex optimization. A basic course.
- Linear convergence of first order methods for non-strongly convex optimization
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Restart of Accelerated First-Order Methods With Linear Convergence Under a Quadratic Functional Growth Condition
- Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization
- Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization
- Sharpness, restart, and acceleration
- Signal Recovery by Proximal Forward-Backward Splitting
- Some methods of speeding up the convergence of iteration methods
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
- iPiasco: inertial proximal algorithm for strongly convex optimization
This page was built for publication: Parameter-free FISTA by adaptive restart and backtracking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622751)
