Abstract:The monotone inclusion problem is fundamental in applied mathematics and is closely related to a wide range of practical applications. However, existing solution methods typically require the underlying operator to be Lipschitz continuous. Recently, Hölder continuity, a weaker condition than Lipschitz continuity, has proven useful in characterizing certain real-world problems. To bridge this gap, we investigate the convergence rates of the Tseng's splitting method (a fundamental algorithm for monotone inclusion problem) and its two accelerated variants, the composite extra anchored gradient method and the symplectic composite extra gradient method, under the Hölder continuity assumption. Our numerical experiments demonstrate that the numerical performance of these algorithms aligns with their respective theoretical convergence rates.
From: Yi Zhang [view email]
[v1]
Sun, 21 Jun 2026 08:39:56 UTC (1,271 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。