Convergence analysis of a novel iteration algorithm for solving split feasibility problems
From MaRDI portal
Publication:4631880
DOI10.22436/jnsa.010.02.27zbMath1412.47213OpenAlexW2589741897MaRDI QIDQ4631880
Publication date: 23 April 2019
Published in: The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22436/jnsa.010.02.27
Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak- and strong-convergence theorems of solutions to split feasibility problem for nonspreading type mapping in Hilbert spaces
- Weak convergence of a Mann-like algorithm for nonexpansive and accretive operators
- Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings
- Convergence analysis of an iterative algorithm for monotone operators
- Some results on generalized equilibrium problems involving strictly pseudocontractive mappings
- Strong convergence theorems for equilibrium problems and relatively nonexpansive mappings in Banach spaces
- Iterative methods for generalized equilibrium problems and fixed point problems with applications
- A simple proof of the mean ergodic theorem for nonlinear contractions in Banach spaces
- Weak convergence theorems for nonexpansive mappings in Banach spaces
- A multiprojection algorithm using Bregman projections in a product space
- On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
- A relaxed alternating CQ-algorithm for convex feasibility problems
- Strong convergence of a splitting algorithm for treating monotone operators
- A regularization method for treating zero points of the sum of two monotone operators
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Inequalities in Banach spaces with applications
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Fixed Points by a New Iteration Method
- The relaxed CQ algorithm solving the split feasibility problem
- WEAK CONVERGENCE OF A SPLITTING ALGORITHM IN HILBERT SPACES
- Several solution methods for the split feasibility problem
- Mean Value Methods in Iteration
