A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
We study a version of the randomized Kaczmarz algorithm for solving systems of linear equations where the iterates are confined to the solution space of a selected subsystem. We show that the subspace constraint leads to an accelerated convergence rate, especially when the system has approximately l...
Saved in:
| Published in: | Linear algebra and its applications Vol. 698; pp. 220 - 260 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.10.2024
|
| Subjects: | |
| ISSN: | 0024-3795, 1873-1856 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!