
doi: 10.1002/mma.4644
The purpose of this paper is to introduce iterative algorithm which is a combination of hybrid viscosity approximation method and the hybrid steepest‐descent method for solving proximal split feasibility problems and obtain the strong convergence of the sequences generated by the iterative scheme under certain weaker conditions in Hilbert spaces. Our results improve many recent results on the topic in the literature. Several numerical experiments are presented to illustrate the effectiveness of our proposed algorithm, and these numerical results show that our result is computationally easier and faster than previously known results on proximal split feasibility problem.
Hilbert spaces, strong convergence, Iterative procedures involving nonlinear operators, proximal split feasibility problems, Contraction-type mappings, nonexpansive mappings, \(A\)-proper mappings, etc., Moreau-Yosida approximate, Nonlinear accretive operators, dissipative operators, etc.
Hilbert spaces, strong convergence, Iterative procedures involving nonlinear operators, proximal split feasibility problems, Contraction-type mappings, nonexpansive mappings, \(A\)-proper mappings, etc., Moreau-Yosida approximate, Nonlinear accretive operators, dissipative operators, etc.
| 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). | 9 | |
| 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. | Top 10% |
