Generalized Forward-Backward Methods and Splitting Operators for a Sum of Maximal Monotone Operators

被引:0
|
作者
Xiao, Hongying [1 ]
Li, Zhaofeng [2 ]
Zhang, Yuanyuan [2 ]
Liu, Xiaoyou [3 ]
机构
[1] Yibin Univ, Fac Sci, Yibin 644000, Peoples R China
[2] China Three Gorges Univ, Dept Math, Yichang 443002, Peoples R China
[3] Hunan Univ Sci & Technol, Sch Math & Comp Sci, Xiangtan 411201, Peoples R China
来源
SYMMETRY-BASEL | 2024年 / 16卷 / 07期
关键词
proximal point algorithm; maximal monotone; generalized forward-backward splitting; PROXIMAL POINT ALGORITHM; CONVERGENCE;
D O I
10.3390/sym16070880
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Suppose each of A(1),& mldr;, A(n) is a maximal monotone, and beta B is firmly nonexpansive with beta > 0. In this paper, we have two purposes: the first is finding the zeros of & sum;(n )(j=1)A(j )+ B, and the second is finding the zeros of & sum;(n )(j=1)A(j). To address the first problem, we produce fixed-point equations on the original Hilbert space as well as on the product space and find that these equations associate with crucial operators which are called generalized forward-backward splitting operators. To tackle the second problem, we point out that it can be reduced to a special instance of n = 2 by defining new operators on the product space. Iterative schemes are given, which produce convergent sequences and these sequences ultimately lead to solutions for the last two problems.
引用
收藏
页数:16
相关论文
共 50 条