Two iterative algorithms for solving the split common fixed point problems
From MaRDI portal
Publication:5081338
DOI10.2298/FIL2013375WzbMath1498.47149OpenAlexW3140449335MaRDI QIDQ5081338
Publication date: 14 June 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil2013375w
Convex programming (90C25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15) Fixed-point iterations (47J26)
Cites Work
- Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
- Regularized methods for the split feasibility problem
- A note on the split common fixed-point problem for quasi-nonexpansive operators
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- The relaxed inexact projection methods for the split feasibility problem
- A new iterative scheme for numerical reckoning fixed points of Suzuki's generalized nonexpansive mappings
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- A new iterative scheme of modified Mann iteration in Banach space
- Strong convergence of a self-adaptive method for the split feasibility problem
- Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Modified extragradient algorithms for solving monotone variational inequalities and fixed point problems
- Systems of variational inequalities with hierarchical variational inequality constraints for Lipschitzian pseudocontractions
- Gradient methods with selection technique for the multiple-sets split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- Several solution methods for the split feasibility problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Two iterative algorithms for solving the split common fixed point problems
