2021
DOI: 10.1007/s10915-020-01385-9
|View full text |Cite
|
Sign up to set email alerts
|

Inertial-Type Algorithm for Solving Split Common Fixed Point Problems in Banach Spaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 45 publications
(23 citation statements)
references
References 44 publications
0
17
0
Order By: Relevance
“…The inertial method involves a two-step iteration in which the next iterate is defined by making use of the previous two iterates and this generally increase the rate of convergence of iterative algorithms. The inertial type algorithm has been studied and modified in various forms by many authors (see [2,3,4,9,47,51,52]). For example, an inertial hybrid proximal-extragradient algorithm which is a combination of hybrid proximal extragradient and inertial type algorithm for a maximal monotone operator was proposed by Bot and Csetnek [9].…”
Section:     mentioning
confidence: 99%
“…The inertial method involves a two-step iteration in which the next iterate is defined by making use of the previous two iterates and this generally increase the rate of convergence of iterative algorithms. The inertial type algorithm has been studied and modified in various forms by many authors (see [2,3,4,9,47,51,52]). For example, an inertial hybrid proximal-extragradient algorithm which is a combination of hybrid proximal extragradient and inertial type algorithm for a maximal monotone operator was proposed by Bot and Csetnek [9].…”
Section:     mentioning
confidence: 99%
“…Observe that u n can be rewritten as u n = K F r n (x n − r n g(x n )) for each n. Fix p ∈ Ω. Since p = K F r n (p − r n p), g is β-inverse strongly monotone and r n ∈ (0, 2β), for any n ∈ R, we have from (21) and Lemma 2 (ii) that…”
Section: Proofmentioning
confidence: 99%
“…For an arbitrary x 0 ∈ H 1 , let {x n } ⊂ H 1 be a sequence defined iteratively by (21) satisfying the conditions of Lemma 6. Then {x n } converges strongly to p ∈ Ω, where p = P Ω ∇ f (p).…”
Section: Proofmentioning
confidence: 99%
See 1 more Smart Citation
“…In general, the convergence rate of Krasnoselski-Mann iterative method and hybrid iterative method is slow. In particular, the term θ n (x nx n-1 ) which is called the inertial extrapolation term was proposed as a remarkable tool for speeding up the convergence properties of iterative methods, and the inertial type algorithm has been studied and modified in various forms by many authors (see [1,4,6,37,42,51]). For example, the inertial forward-backward splitting methods [35], the inertial Douglas-Rachford splitting methods [8] and the inertial proximal methods [40], the inertial extragradient methods [27], the inertial subgradient extragradient methods [43], the inertial shrinking projection methods [41].…”
Section: Introductionmentioning
confidence: 99%