Algorithmic and analytical approach to the split common fixed points problem

DOI10.1186/1687-1812-2014-172zbMath1351.49044OpenAlexW2113550930WikidataQ59323328 ScholiaQ59323328MaRDI QIDQ286569

Yonghong Yao, Li-Jun Zhu, Yeong-Cheng Liou, Kang, Shin Min

Publication date: 20 May 2016

Published in: Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1687-1812-2014-172

zbMATH Keywords

weak convergencesplit common fixed point problempseudo-contractive mappingsquasi-nonexpansive mappings

Mathematics Subject Classification ID

Convex programming (90C25) Variational inequalities (49J40) Set-valued and variational analysis (49J53) Iterative procedures involving nonlinear operators (47J25) Numerical methods based on nonlinear programming (49M37) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical methods for variational inequalities and related problems (65K15)

Related Items (2)

Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction ⋮ Iterative methods for solving the split common fixed point problem of demicontractive mappings in Hilbert spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• An extragradient method for solving split feasibility and fixed point problems
• Implicit and explicit algorithms for solving the split feasibility problem
• Perturbed projections and subgradient projections for the multiple-sets 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
• Zeros of accretive operators
• A modified Halpern's iterative scheme for solving split feasibility 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
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• 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
• Several solution methods for the split feasibility problem
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces

This page was built for publication: Algorithmic and analytical approach to the split common fixed points problem