On the convergence of algorithms with Tikhonov regularization terms

We consider the strongly convergent modified versions of the Krasnosel’skiĭ-Mann, the forward-backward and the Douglas-Rachford algorithms with Tikhonov regularization terms, introduced by Radu Boţ, Ernö Csetnek and Dennis Meier. We obtain quantitative information for these modified iterations, namely rates of asymptotic regularity and metastability. Furthermore, our arguments avoid the use of sequential weak compactness and use only a weak form of the projection argument.