Name
Abstract | ||
|---|---|---|
Bregman-type iterative methods have received considerable attention in recent years due to their ease of implementation and the high quality of the computed solutions they deliver. However, these iterative methods may require a large number of iterations and this reduces their usefulness. This paper develops a computationally attractive linearized Bregman algorithm by projecting the problem to be solved into an appropriately chosen low-dimensional Krylov subspace. The projection reduces the computational effort required for each iteration. A variant of this solution method, in which nonnegativity of each computed iterate is imposed, also is described. Extensive numerical examples illustrate the performance of the proposed methods. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s11075-020-01004-6 | NUMERICAL ALGORITHMS |
Keywords | DocType | Volume |
Linearized Bregman iteration, Ill-posed problem, Krylov subspace, Nonnegativity constraint | Journal | 87 |
Issue | ISSN | Citations |
3 | 1017-1398 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alessandro Buccini | 1 | 0 | 0.34 |
| Mirjeta Pasha | 2 | 0 | 0.34 |
| Lothar Reichel | 3 | 453 | 95.02 |