A stopping criterion for iterative regularization methods

Abstract

We present a discrepancy-like stopping criterium for iterative regularization methods for the solution of linear discrete ill-posed problems. The presented criterium terminates the iterations of the iterative method when the residual norm of the computed solution becomes less or equal to the residual norm of a regularized Truncated Singular Value Decomposition (TSVD) solution. We present two algorithms for the automatic computation of the TSVD residual norm using the Discrete Picard Condition. The first algorithm uses the SVD coefficients while the second one uses the Fourier coefficients. In this work, we mainly focus on the Conjugate Gradient Least Squares method, but the proposed criterium can be used for terminating the iterations of any iterative regularization method. Many numerical tests on some selected one dimensional and image deblurring problems are presented and the results are compared with those obtained by state-of-the-art parameter selection rules. The numerical results show the efficiency and robustness of the proposed criterium.