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

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Le, Ba Khiet, Mordukhovich, Boris S., Thera, Michel A.
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910279213776896
author Le, Ba Khiet
Mordukhovich, Boris S.
Thera, Michel A.
author_facet Le, Ba Khiet
Mordukhovich, Boris S.
Thera, Michel A.
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2606_01536
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
Le, Ba Khiet
Mordukhovich, Boris S.
Thera, Michel A.
Optimization and Control
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.
title Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
topic Optimization and Control
url https://arxiv.org/abs/2606.01536