Enhancing convergence speed in sparse signal denoising: the APFISTA algorithm

DOI10.1080/02331934.2024.2382401MaRDI QIDQ6912901zbMATH OpenFDO

Authors Jin Wang

Publication date 22 October 2025

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2024.2382401

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10)

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An inexact successive quadratic approximation method for L-1 regularized optimization
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• Image recovery via total variation minimization and related problems
• Improving ``fast iterative shrinkage-thresholding algorithm: faster, smarter, and greedier
• Introductory lectures on convex optimization. A basic course.
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• Signal Recovery by Proximal Forward-Backward Splitting
• The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k^2
• The Split Bregman Method for L1-Regularized Problems

This page was built for publication: Enhancing convergence speed in sparse signal denoising: the APFISTA algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912901)