A New Extragradient-Type Algorithm for the Split Feasibility Problem
Copyright policy )A New Extragradient-Type Algorithm for the Split Feasibility Problem
We consider the split feasibility problem (SFP) in Hilbert spaces, inspired by extragradient method presented by Ceng, Ansari for split feasibility problem, subgradient extragradient method proposed by Censor, and variant extragradient-type method presented by Yao 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.
- University of Shanghai for Science and Technology China (People's Republic of)
Programming in abstract spaces, Convex programming, Numerical mathematical programming methods, Variational and other types of inequalities involving nonlinear operators (general)
Programming in abstract spaces, Convex programming, Numerical mathematical programming methods, Variational and other types of inequalities involving nonlinear operators (general)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!