Iterative implementation of the adaptive regularization yields optimality

摘要

The adaptive regularization method is first proposed by Ryzhikov et al. for the deconvolution in elimination of multiples. This method is stronger than the Tikhonov reguiarization in the sense that it is adaptive, i.e. it eliminates the small eigenvalues of the adjoint operator when it is nearly singular. We will show in this paper that the adaptive regularization can be implemented iterately. Some properties of the proposed non-stationary iterated adaptive regularization method are analyzed. The rate of convergence for inexact data is proved. Therefore the iterative implementation of the adaptive regularization can yield optimality.