Year: 2026
Type: preprint
Abstract: In this paper, we prove the weak and linear convergence of Tseng algorithm applied to the zero of sum of two operators problem where each operator is not necessarily monotone while existing researches in the literature require the monotonicity of both operators. Consequently it allows us to decompose more efficiently and can reduce the Lipschitz constant significantly, which is meaningful especially in big data. Numerical examples supporting the theoretical results are also provided.
Source: arXiv (Cornell University)
Authors: Ba Khiet Le, Minh Thuan, Tien Pham, Kim Thuong Vo
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7204225004