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.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2015
|
| In: |
Analele științifice ale Universității Ovidius Constanța. Seria Matematică
Year: 2015, Volume: 23, Issue: 3, Pages: 129-150 |
| ISSN: | 1844-0835 |
| Online Access: | Verlag, kostenfrei, Volltext: http://www.anstuocmath.ro/mathematics//anale2015vol3/Petra_S.pdf
|
| Author Notes: | Stefania Petra |
| Summary: | 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. |
|---|---|
| Item Description: | Gesehen am 27.07.2018 |
| Physical Description: | Online Resource |
| ISSN: | 1844-0835 |