Solving the general split common fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operator norms
From MaRDI portal
Publication:5005850
DOI10.2298/FIL1703559ZzbMath1479.47081MaRDI QIDQ5005850
Publication date: 11 August 2021
Published in: Filomat (Search for Journal in Brave)
iterative algorithmweak convergenceHilbert spacequasi-nonexpansive mappingsplit common fixed-point problemmultiple-set split feasibility problem
Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
An iterative algorithm for solving split equilibrium problems and split equality variational inclusions for a class of nonexpansive-type maps ⋮ An iterative algorithm for solving split equality fixed point problems for a class of nonexpansive-type mappings in Banach spaces
Cites Work
- Regularized methods for the split feasibility problem
- A note on the split common fixed-point problem for quasi-nonexpansive operators
- Algorithms for the split variational inequality problem
- A multiprojection algorithm using Bregman projections in a product space
- On the Mann-type iteration and the convex feasibility problem
- Strong convergence of the CQ method for fixed point iteration processes
- Geometric properties of Banach spaces and nonlinear iterations
- A hybrid iteration scheme for equilibrium problems, variational inequality problems and common fixed point problems in Banach spaces
- A simple projection method for solving the multiple-sets split feasibility problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- 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
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Fixed points of quasi-nonexpansive mappings
- A note on the CQ algorithm for the split feasibility problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item