An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

We consider linear inverse problems where the solution is assumed to have a sparse expansion on an arbitrary preassigned orthonormal basis. We prove that replacing the usual quadratic regularizing penalties by weighted 𝓁p‐penalties on the coefficients of such expansions, with 1 ≤ p ≤ 2, still regula...

Full description

Saved in:

Bibliographic Details
Published in:	Communications on pure and applied mathematics Vol. 57; no. 11; pp. 1413 - 1457
Main Authors:	Daubechies, I., Defrise, M., De Mol, C.
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.11.2004 Wiley John Wiley and Sons, Limited
Subjects:	Algebra Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science; control theory; systems Exact sciences and technology Linear and multilinear algebra, matrix theory Linear equations Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra Sciences and techniques of general use Theoretical computing Linear problem Thresholding algorithm Applied mathematics Ideal Iterative method Mathematical expansion Penalty method Inverse problem
ISSN:	0010-3640, 1097-0312
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!