Volume 18, pp. 153-173, 2004.

Tikhonov regularization with nonnegativity constraint

Daniela Calvetti, Bryan Lewis, Lothar Reichel, and Fiorella Sgallari


Many numerical methods for the solution of ill-posed problems are based on Tikhonov regularization. Recently, Rojas and Steihaug [15] described a barrier method for computing nonnegative Tikhonov-regularized approximate solutions of linear discrete ill-posed problems. Their method is based on solving a sequence of parameterized eigenvalue problems. This paper describes how the solution of parametrized eigenvalue problems can be avoided by computing bounds that follow from the connection between the Lanczos process, orthogonal polynomials and Gauss quadrature.

Full Text (PDF) [928 KB], BibTeX

Key words

ill-posed problem, inverse problem, solution constraint, Lanczos methods, Gauss quadrature.

AMS subject classifications

65F22, 65F10, 65R30, 65R32, 65R20.

ETNA articles which cite this article

Vol. 48 (2018), pp. 310-328 Abdeslem Hafid Bentbib, Abderrahman Bouhamidi, and Karim Kreit: A conditional gradient method for primal-dual total variation-based image denoising

< Back