Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions

In this paper, we establish, for the first time in the literature, the convergence of the practical versions of the Inexact Proximal Point Algorithm (IPPA) and the Inexact Tseng Algorithm (ITA) for computing approximate solutions to monotone inclusions in Hilbert spaces under the the presence of nonsummable errors. Our ap- proach relies on Tikhonov regularization, the contraction property of the associated monotone operators, and the recently developed R-continuity theory. The proposed techniques and results can be extended to analyze various important inexact algorithms in optimization-related problems with nonsummable errors.