A new extragradient-type algorithm for the split feasibility problem
type: Item
instance of: scholarly article
title: A new extragradient-type algorithm for the split feasibility problem
zbMATH Open document ID: 1400.90301
DOI: 10.1155/2016/6851393
author: Yan Gao
author: Bo Wang
author: Yazheng Dang
published in: Mathematical Problems in Engineering
publication date: 2018-10-12T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C48
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 47J20
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6953480
Wikidata QID: Q59141110
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2016/6851393
OpenAlex ID: W2280383143
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: A unified treatment of some iterative algorithms in signal processing and image reconstruction
cites work: Parallel application of block-iterative methods in medical imaging and radiation therapy
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
cites work: The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces
cites work: Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
cites work: A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: Several solution methods for the split feasibility problem
cites work: Q5445188
cites work: Q4110807
cites work: Weak convergence theorem by an extragradient method for nonexpansive mappings and monotone mappings
cites work: An extragradient method for solving split feasibility and fixed point problems
cites work: Variant extragradient-type method for monotone variational inequalities
cites work: The subgradient extragradient method for solving variational inequalities in Hilbert space
cites work: Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space
cites work: Q3322631
cites work: Weak convergence theorems for nonexpansive mappings and monotone mappings
cites work: Iterative Algorithms for Nonlinear Operators
description: scientific article; zbMATH DE number 6953480