On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty

DOI10.1109/TSP.2015.2502551zbMath1412.94018arXiv1510.07821OpenAlexW1820680895MaRDI QIDQ4618268

ịlker Bayram

Publication date: 7 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.07821

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (11)

Parametrized quasi-soft thresholding operator for compressed sensing and matrix completion ⋮ A convex-Nonconvex strategy for grouped variable selection ⋮ Non-convex total variation regularization for convex denoising of signals ⋮ SPECT with a multi-bang assumption on attenuation ⋮ Robust regression with compositional covariates ⋮ Variable smoothing for weakly convex composite functions ⋮ Linearly involved generalized Moreau enhanced models and their proximal splitting algorithm under overall convexity condition ⋮ A new generalized projection and its application to acceleration of audio declipping ⋮ A fundamental proof of convergence of alternating direction method of multipliers for weakly convex optimization ⋮ Lipschitz Certificates for Layered Network Structures Driven by Averaged Activation Operators ⋮ Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming

This page was built for publication: On the Convergence of the Iterative Shrinkage/Thresholding Algorithm With a Weakly Convex Penalty