Iterative algorithms for the split problem and its convergence analysis

DOI10.1155/2014/897370zbMath1473.47051OpenAlexW2018396606WikidataQ59042702 ScholiaQ59042702MaRDI QIDQ1725220

Arif Rafiq, Li-Jun Zhu, Zhangsong Yao, Kang, Shin Min

Publication date: 14 February 2019

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/897370

zbMATH Keywords

iterative algorithmstrong convergencesplit common fixed point problempseudocontractions

Mathematics Subject Classification ID

Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point iterations (47J26)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear algorithms approach to split common solution problems
• Regularized methods for the split feasibility problem
• Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• Strong convergence of an explicit iterative algorithm for continuous pseudo-contractions in Banach spaces
• A multiprojection algorithm using Bregman projections in a product space
• Strong convergence of a self-adaptive method for the split feasibility problem
• On the Mann-type iteration and the convex feasibility problem
• Damped projection method for split common fixed point problems
• 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
• The split common fixed-point problem for demicontractive mappings
• Iterative oblique projection onto convex sets and the split feasibility problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• Several solution methods for the split feasibility problem