A fast nonstationary iterative method with convex penalty for inverse problems in Hilbert spaces
In this paper we consider the computation of approximate solutions for inverse problems in Hilbert spaces. In order to capture the special feature of solutions, non-smooth convex functions are introduced as penalty terms. By exploiting the Hilbert space structure of the underlying problems, we propose a fast iterative regularization method which reduces to the classical nonstationary iterated Tikhonov regularization when the penalty term is chosen to be the square of norm. Each iteration of the...[Show more]
|Collections||ANU Research Publications|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.