2020
DOI: 10.1007/s13398-020-00906-3
|View full text |Cite
|
Sign up to set email alerts
|

Algorithms for finding a common element of the set of common fixed points for nonexpansive semigroups, variational inclusions and generalized equilibrium problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 28 publications
0
1
0
Order By: Relevance
“…where I − λf is a forward step and (I + λg) − 1 is a backward step with λ > 0. is algorithm is a splitting algorithm which solves the difficulty of calculating of the resolvent of f + g. Recently, there has been increasing interest for studying common solution problems relevant to (1) (see for example, [17][18][19][20][21][22][23][24][25][26][27]). Especially, Zhao, Sahu, and Wen [28] presented an iterative algorithm for solving a system of variational inclusions involving accretive operators.…”
Section: Introductionmentioning
confidence: 99%
“…where I − λf is a forward step and (I + λg) − 1 is a backward step with λ > 0. is algorithm is a splitting algorithm which solves the difficulty of calculating of the resolvent of f + g. Recently, there has been increasing interest for studying common solution problems relevant to (1) (see for example, [17][18][19][20][21][22][23][24][25][26][27]). Especially, Zhao, Sahu, and Wen [28] presented an iterative algorithm for solving a system of variational inclusions involving accretive operators.…”
Section: Introductionmentioning
confidence: 99%