Back to Search
Start Over
Forward–Reflected–Backward Splitting Algorithms with Momentum: Weak, Linear and Strong Convergence Results.
- Source :
-
Journal of Optimization Theory & Applications . Jun2024, Vol. 201 Issue 3, p1364-1397. 34p. - Publication Year :
- 2024
-
Abstract
- This paper studies the forward–reflected–backward splitting algorithm with momentum terms for monotone inclusion problem of the sum of a maximal monotone and Lipschitz continuous monotone operators in Hilbert spaces. The forward–reflected–backward splitting algorithm is an interesting algorithm for inclusion problems with the sum of maximal monotone and Lipschitz continuous monotone operators due to the inherent feature of one forward evaluation and one backward evaluation per iteration it possesses. The results in this paper further explore the convergence behavior of the forward–reflected–backward splitting algorithm with momentum terms. We obtain weak, linear, and strong convergence results under the same inherent feature of one forward evaluation and one backward evaluation at each iteration. Numerical results show that forward–reflected–backward splitting algorithms with momentum terms are efficient and promising over some related splitting algorithms in the literature. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MONOTONE operators
*HILBERT space
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 00223239
- Volume :
- 201
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Journal of Optimization Theory & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 178047733
- Full Text :
- https://doi.org/10.1007/s10957-024-02410-9