The linear inverse problem corresponding to an equation with a bounded linear operator on a Hilbert space consists in finding an estimate of from not exactly given . One of the best known methods of solving such (possibly ill-posed) problems is the Tikhonov regularization method where a regularization functional has to be minimized which is a sum of discrepancy and additional quadratic constraints multiplied by the regularization parameter.
The authors present a new method which is a generalization of the Tikhonov method. Namely, in place of classical quadratic constraints, a weighted -norm () of expansion coefficients of with respect to a particular orthogonal basis in is taken as a penalization term added to the discrepancy in the regularization functional. The proposed minimization procedure promotes sparsity of the expansion of with respect to the basis under consideration. Wavelet bases as well as other orthogonal bases are taken into account.
To compute the corresponding regularized solution, the authors propose an iterative algorithm for solving a system of nonlinear equations related to the minimizing problem for the regularization functional. The detailed and full mathematical analysis of the proposed method is given. The strong convergence of successive iterates to the minimizer of the regularization functional is proved and stability of regularized solution is shown. The presented general regularization theorem establishes the convergence to the exact solution as the noise level tends to zero. Under some additional a priori assumptions error estimates are derived. Moreover, possible generalizations as well as the numerical complexity of the algorithm are discussed. In the Appendix a brief review of basic definitions of wavelets and their connection with Besov spaces is given.