On the filtering effect of iterative regularization algorithms for discrete inverse problems

From MaRDI portal
Publication:5406773

DOI10.1088/0266-5611/29/12/125013zbMATH Open1292.65032arXiv1307.0930OpenAlexW3104705307MaRDI QIDQ5406773FDOQ5406773


Authors: A. Cornelio, F. Porta, M. Prato, Luca Zanni Edit this on Wikidata


Publication date: 2 April 2014

Published in: Inverse Problems (Search for Journal in Brave)

Abstract: Many real-world applications are addressed through a linear least-squares problem formulation, whose solution is calculated by means of an iterative approach. A huge amount of studies has been carried out in the optimization field to provide the fastest methods for the reconstruction of the solution, involving choices of adaptive parameters and scaling matrices. However, in presence of an ill-conditioned model and real data, the need of a regularized solution instead of the least-squares one changed the point of view in favour of iterative algorithms able to combine a fast execution with a stable behaviour with respect to the restoration error. In this paper we want to analyze some classical and recent gradient approaches for the linear least-squares problem by looking at their way of filtering the singular values, showing in particular the effects of scaling matrices and non-negative constraints in recovering the correct filters of the solution.


Full work available at URL: https://arxiv.org/abs/1307.0930




Recommendations




Cited In (5)

Uses Software





This page was built for publication: On the filtering effect of iterative regularization algorithms for discrete inverse problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406773)