Numerical aspects of the nonstationary modified linearized Bregman algorithm

Alessandro Buccini, Yonggi Park and Lothar Reichel

Applied Mathematics and Computation, 2018, vol. 337, issue C, 386-398

Abstract: The solution of discrete ill-posed problems has been a subject of research for many years. Among the many methods described in the literature, the Bregman algorithm has attracted a great deal attention and been widely investigated. Recently, a nonstationary preconditioned version of this algorithm, referred to as the nonstationary modified linearized Bregman algorithm, was proposed. The aim of this paper is to discuss numerical aspects of this algorithm and to compare computed results with known theoretical properties. We also discuss the effect of several parameters required by the algorithm on the computed solution.

Keywords: Ill-posed problem; Bregman iteration; Preconditioning; Regularization (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318304533
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:337:y:2018:i:c:p:386-398

DOI: 10.1016/j.amc.2018.05.044

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().