Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints

A new iterative algorithm for the solution of minimization problems in infinite-dimensional Hilbert spaces which involve sparsity constraints in form of $\ell^{p}$-penalties is proposed. In contrast to the well-known algorithm considered by Daubechies, Defrise, and De Mol, it uses hard instead of so...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on scientific computing 2008-01, Vol.30 (2), p.657-683
Hauptverfasser:	Bredies, Kristian, Lorenz, Dirk A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Dictionaries Lagrange multiplier Sparsity
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!