A new extragradient-type algorithm for the split feasibility problem (Q1793475)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new extragradient-type algorithm for the split feasibility problem |
scientific article; zbMATH DE number 6953480
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new extragradient-type algorithm for the split feasibility problem |
scientific article; zbMATH DE number 6953480 |
Statements
A new extragradient-type algorithm for the split feasibility problem (English)
0 references
12 October 2018
0 references
Summary: We consider the split feasibility problem (SFP) in Hilbert spaces, inspired by extragradient method presented by \textit{L. C. Ceng} et al. [Comput. Math. Appl. 64, No. 4, 633--642 (2012; Zbl 1252.65102)] for split feasibility problem, subgradient extragradient method proposed by \textit{Y. Censor} [Math. Program. 42, No. 2 (B), 307--325 (1988; Zbl 0658.90099)], and variant extragradient-type method presented by \textit{Y. Yao} et al. [Fixed Point Theory Appl. 2013, Paper No. 185, 15 p. (2013; Zbl 1476.47085)] for variational inequalities; we suggest an extragradient-type algorithm for the SFP. We prove the strong convergence under some suitable conditions in infinite-dimensional Hilbert spaces.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references