2010Unpublished venueOpen access

An iterative method for Tikhonov regularization with a general linear regularization operator

Michiel E. Hochstenbach, Lothar Reichel

Open full text 0 citations

Abstract

Tikhonov regularization is one of the most popular approaches to solve discrete ill-posed problems with error-contaminated data. A regularization operator and a suitable value of a regularization parameter have to be chosen. This paper describes an iterative method, based on Golub-Kahan bidiagonalization, for solving large-scale Tikhonov minimization problems with a linear regularization operator of general form. The regularization parameter is determined by the discrepancy principle. Computed examples illustrate the performance of the method. \nKey words. Discrete ill-posed problem, iterative method, Tikhonov regularization, general\nlinear regularization operator, discrepancy principle.

About this research paper

What this paper is about

Tikhonov regularization is one of the most popular approaches to solve discrete ill-posed problems with error-contaminated data. A regularization operator and a suitable value of a regularization parameter have to be chosen. This paper describes an iterative method, based on Golub-Kahan bidiagonalization, for solving large-scale Tikhonov minimization problems with a linear regularization operator of general form. The regularization parameter is determined by the discrepancy principle. Computed examples illustrate the performance of the method. \nKey words. Discrete ill-posed problem, iterative method, Tikhonov regularization, general\nlinear regularization operator, discrepancy principle.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Tikhonov regularization is one of the most popular approaches to solve discrete ill-posed problems with error-contaminated data. A regularization operator and a suitable value of a regularization parameter have to be chosen. This paper describes an iterative method, based on Golub-Kahan bidiagonalization, for solving large-scale Tikhonov minimization problems with a linear regularization operator of general form. The regularization parameter is determined by the discrepancy principle. Computed examples illustrate the performance of the method. \nKey words. Discrete ill-posed problem, iterative method, Tikhonov regularization, general\nlinear regularization operator, discrepancy principle.

Key concepts: Tikhonov regularization, Regularization perspectives on support vector machines, Backus–Gilbert method, Regularization (linguistics), Proximal gradient methods for learning, Mathematics, Applied mathematics, Operator (biology)

Related papers

Back to paper searchBrowse research topicsOriginal source
An iterative method for Tikhonov regularization with a general linear regularization operator — Research Paper | ScholarLens