Randomized sparse block Kaczmarz as randomized dual block-coordinate descent

We show that the Sparse Kaczmarz method is a particular instance of the coordinate gradient method applied to an unconstrained dual problem corresponding to a regularized l1-minimization problem subject to linear constraints.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Petra, Stefania (VerfasserIn)
Dokumenttyp: Article (Journal)
Sprache:Englisch
Veröffentlicht: 2015
In: Analele științifice ale Universității Ovidius Constanța. Seria Matematică
Year: 2015, Jahrgang: 23, Heft: 3, Pages: 129-150
ISSN:1844-0835
Online-Zugang:Verlag, kostenfrei, Volltext: http://www.anstuocmath.ro/mathematics//anale2015vol3/Petra_S.pdf
Volltext
Verfasserangaben:Stefania Petra
Beschreibung
Zusammenfassung:We show that the Sparse Kaczmarz method is a particular instance of the coordinate gradient method applied to an unconstrained dual problem corresponding to a regularized l1-minimization problem subject to linear constraints.
Beschreibung:Gesehen am 27.07.2018
Beschreibung:Online Resource
ISSN:1844-0835