An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings
From MaRDI portal
Publication:2068019
DOI10.1186/s13660-019-2203-7zbMath1499.47034OpenAlexW2973973812WikidataQ127231083 ScholiaQ127231083MaRDI QIDQ2068019
Meixia Li, Xueling Zhou, Hai-Tao Che
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2203-7
Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point iterations (47J26)
Related Items (2)
Iterative Algorithms for a System of Variational Inclusions Involving Set-Valued Quasi-Contractive Mappings in Banach Spaces ⋮ A Strong Convergence Theorem for Solving the Split Equality Fixed Point Problem
Cites Work
- A simultaneous iterative method for split equality problems of two finite
- Split equality fixed point problem for quasi-pseudo-contractive mappings with applications
- Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
- A note on the split common fixed-point problem for quasi-nonexpansive operators
- Split monotone variational inclusions
- Algorithms for the split variational inequality problem
- A multiprojection algorithm using Bregman projections in a product space
- Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
- 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
- A simultaneous iteration algorithm for solving extended split equality fixed point problem
- A new \(CQ\) method for solving split feasibility problem
- A new algorithm for solving the split common null point problem in Hilbert spaces
- A new halfspace-relaxation projection method for the split feasibility problem
- Several iterative algorithms for solving the split common fixed point problem of directed operators with applications
- A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem
- 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
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- Some problems and results in the study of nonlinear analysis
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Remark on the Successive Projection Algorithm for the Multiple-Sets Split Feasibility Problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings
