An iteratively reweighted least squares algorithm for sparse regularization

From MaRDI portal
Publication:4635396

DOI10.1090/CONM/693/13941zbMATH Open1392.65074arXiv1511.08970OpenAlexW2263124147MaRDI QIDQ4635396FDOQ4635396

Ingrid Daubechies, S. M. Voronin

Publication date: 16 April 2018

Published in: Functional Analysis, Harmonic Analysis, and Image Processing (Search for Journal in Brave)

Abstract: We present a new algorithm and the corresponding convergence analysis for the regularization of linear inverse problems with sparsity constraints, applied to a new generalized sparsity promoting functional. The algorithm is based on the idea of iteratively reweighted least squares, reducing the minimization at every iteration step to that of a functional including only ell2-norms. This amounts to smoothing of the absolute value function that appears in the generalized sparsity promoting penalty we consider, with the smoothing becoming iteratively less pronounced. We demonstrate that the sequence of iterates of our algorithm converges to a limit that minimizes the original functional.


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





Cites Work


Cited In (9)


Recommendations





This page was built for publication: An iteratively reweighted least squares algorithm for sparse regularization

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