Strong convergence theorem of two-step iterative algorithm for split feasibility problems
From MaRDI portal
Publication:257834
DOI10.1186/1029-242X-2014-280zbMath1332.90204WikidataQ59323329 ScholiaQ59323329MaRDI QIDQ257834
Publication date: 17 March 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Convex programming (90C25) Nonlinear programming (90C30) Iterative procedures involving nonlinear operators (47J25)
Related Items
An algorithm for the split-feasibility problems with application to the split-equality problem ⋮ Convergence analysis of a Halpern-like iterative algorithm in Hilbert spaces ⋮ On the split common fixed point problem for strict pseudocontractive and asymptotically nonexpansive mappings in Banach spaces
Cites Work
- Unnamed Item
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- On Chidume's open questions and approximate solutions of multivalued strongly accretive mapping equations in Banach spaces
- On variable-step relaxed projection algorithm for variational inequalities
- A relaxed alternating CQ-algorithm for convex feasibility problems
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- Solving the split feasibility problem without prior knowledge of matrix norms
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A relaxed projection method for variational inequalities
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Several solution methods for the split feasibility problem
