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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Communications on pure and applied mathematics Ročník 57; číslo 11; s. 1413 - 1457
Hlavní autoři:	Daubechies, I., Defrise, M., De Mol, C.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.11.2004 Wiley John Wiley and Sons, Limited
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!