Algorithmic and analytical approach to the split common fixed points problem
From MaRDI portal
weak convergencesplit common fixed point problempseudo-contractive mappingsquasi-nonexpansive mappings
Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40) Set-valued and variational analysis (49J53) Numerical methods for variational inequalities and related problems (65K15)
Recommendations
- Iterative algorithms for the split problem and its convergence analysis
- New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
- Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
- Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
- A new iterative algorithm for split solution problems of quasi-nonexpansive mappings
Cites work
- scientific article; zbMATH DE number 5624813 (Why is no real title available?)
- scientific article; zbMATH DE number 4021000 (Why is no real title available?)
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- A modified Halpern's iterative scheme for solving split feasibility problems
- A modified extragradient method for the split feasibility and fixed point problems
- A multiprojection algorithm using Bregman projections in a product space
- A note on the split common fixed-point problem for quasi-nonexpansive operators
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An extragradient method for solving split feasibility and fixed point problems
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Implicit and explicit algorithms for solving the split feasibility problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Regularized methods for the split feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Several solution methods for the split feasibility problem
- Strong convergence of an explicit iterative algorithm for continuous pseudo-contractions in Banach spaces
- The relaxed CQ algorithm solving the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Zeros of accretive operators
Cited in
(15)- Iterative methods for solving the split common fixed point problem of demicontractive mappings in Hilbert spaces
- Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
- Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem
- Iterative solutions of the split common fixed point problem for strictly pseudo-contractive mappings
- The split common fixed-point problem for demicontractive mappings and quasi-nonexpansive mappings
- Algorithms for solving common fixed point problems
- Split common fixed point and common null point problem
- Algorithmic and analytical approaches to the split feasibility problems and fixed point problems
- An accelerate algorithm for the split equality common fixed-point problem of directed operators
- Algorithm of Common Solutions to the Cayley Inclusion and Fixed Point Problems
- An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings
- New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
- Split common fixed point problem for a class of total asymptotic pseudocontractions
- Iterative algorithms for the split problem and its convergence analysis
- General method for solving the split common fixed point problem
This page was built for publication: Algorithmic and analytical approach to the split common fixed points problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286569)