 Research
 Open Access
New algorithms designed for the split common fixed point problem of quasipseudocontractions
 LiJun Zhu^{1},
 YeongCheng Liou^{2, 3}Email author,
 JenChih Yao^{3, 4} and
 Yonghong Yao^{5}
https://doi.org/10.1186/1029242X2014304
© Zhu et al.; licensee Springer. 2014
Received: 22 April 2014
Accepted: 15 July 2014
Published: 19 August 2014
Abstract
In this paper, we study the split common fixed point problem, which is to find a fixed point of a quasipseudocontractive mapping in one space whose image under a linear transformation is a fixed point of anther quasipseudocontractive mapping in the image space. We design and analyze a new iterative algorithm for solving this split common fixed point problem. A weak convergence theorem is given.
MSC:49J53, 49M37, 65K10, 90C25.
Keywords
1 Background and motivation
where $A:{H}_{1}\to {H}_{2}$ is a bounded linear operator. The split feasibility problem in finitedimensional Hilbert spaces was first introduced by Censor and Elfving [1] for modeling inverse problems which arise from phase retrievals and in medical image reconstruction [2].
which has received considerable attention.
The wellknown projected Landweber algorithm [4] is widely used to solve (1.2). This algorithm generates a sequence $\{{x}_{n}\}$ in such a way that we have

initialization: ${x}_{0}$ selected in ${H}_{1}$ arbitrarily, and

iteration:${x}_{n+1}={P}_{C}({x}_{n}+\gamma {A}^{T}(bA{x}_{n})),$(1.3)
where ${P}_{C}$ denotes the nearest point projection from ${H}_{1}$ onto C, $\gamma >0$ is a parameter such that $0<\gamma <2/{\parallel A\parallel}^{2}$, and ${A}^{T}$ is the transpose of A.
The simultaneous algebraic reconstruction technique is a typical example of the Landweber algorithm (1.5) when the system (1.4) is finitedimensional.
where C and Q are closed convex sets of ${\mathbb{R}}^{n}$, and A is an $n\times n$ matrix of full rank. Here $A(C)=\{y\in {\mathbb{R}}^{n}:y=Ax,x\in C\}$ is the image of C under the matrix A.
where $0<\gamma <2/{\parallel A\parallel}^{2}$ and ${P}_{Q}$ denotes the nearest point projection from ${H}_{2}$ onto Q. Consequently, Xu [5] extend the above results from the finitedimensional spaces to the infinitedimensional spaces.
where U and T are demicontractive operators, $\beta \in (0,1)$, $\gamma \in (0,\frac{1\mu}{\lambda})$ with λ being the spectral radius of the operator ${A}^{\ast}A$ and ${\alpha}_{n}\in (0,1)$ is relaxation parameter. We note that the classes of directed and demicontractive operators are important classes since they include the orthogonal projections and the subgradient projectors. For some other related work, please refer to [8–26] and [27].
In the present paper, our main motivation is to extend the classes of directed and demicontractive operators to the class of quasipseudocontractions because the class of quasipseudocontractions includes the classes of directed and demicontractive operators as special cases. Interest in pseudocontractive mappings stems mainly from their firm connection with the class of monotone operators. We present a unified framework for the study of this problem and this class of operators. We propose an iterative algorithm and study its convergence.
2 Notations and lemmas
Let H be a real Hilbert space with inner product $\u3008\cdot ,\cdot \u3009$ and norm $\parallel \cdot \parallel $, respectively. Let C be a nonempty closed convex subset of H.
Recall that a mapping $T:C\to C$ is called

nonexpansive if $\parallel TxTy\parallel \le \parallel xy\parallel $ for all $x,y\in C$;

quasinonexpansive if $\parallel Tx{x}^{\ast}\parallel \le \parallel x{x}^{\ast}\parallel $ for all $x\in C$ and ${x}^{\ast}\in Fix(T)$;

firmly nonexpansive if ${\parallel TxTy\parallel}^{2}\le {\parallel xy\parallel}^{2}{\parallel (IT)x(IT)y\parallel}^{2}$ for all $x,y\in C$;

firmly quasinonexpansive if ${\parallel Tx{x}^{\ast}\parallel}^{2}\le {\parallel x{x}^{\ast}\parallel}^{2}{\parallel Txx\parallel}^{2}$ for all $x\in C$ and ${x}^{\ast}\in Fix(T)$;

strictly pseudocontractive if ${\parallel TxTy\parallel}^{2}\le {\parallel xy\parallel}^{2}+k{\parallel (IT)x(IT)y\parallel}^{2}$ for all $x,y\in C$, where $k\in [0,1)$;

directed if $\u3008Tx{x}^{\ast},Txx\u3009\le 0$ for all $x\in C$ and ${x}^{\ast}\in Fix(T)$;

demicontractive if ${\parallel Tx{x}^{\ast}\parallel}^{2}\le {\parallel x{x}^{\ast}\parallel}^{2}+k{\parallel Txx\parallel}^{2}$ for all $x\in C$ and ${x}^{\ast}\in Fix(T)$, where $k\in [0,1)$.
for all $x\in C$ and ${x}^{\ast}\in Fix(T)$. It can be seen easily that the class of directed operators coincides with that of firmly quasinonexpansive mappings.
From the above definitions, we note that the class of demicontractive operators contains important operators such as the directed operators, the quasinonexpansive operators and the strictly pseudocontractive mappings with fixed points. Such a class of operators is fundamental because they include many types of nonlinear operators arising in applied mathematics and optimization; see for example [29] and references therein.
for all $x\in C$ and ${x}^{\ast}\in Fix(T)$.
It is obvious that the class of quasipseudocontractive mappings includes the class of demicontractive mappings.
for all $x,y\in C$.
Usually, the convergence of fixed point algorithms requires some additional smoothness properties of the mapping T such as demiclosedness.
Recall that a mapping T is said to be demiclosed if, for any sequence $\{{x}_{n}\}$ which weakly converges to $\tilde{x}$, and if the sequence $\{T({x}_{n})\}$ strongly converges to z, we have $T(\tilde{x})=z$.
Observe also that the nonexpansive operators are both quasinonexpansive and strictly pseudocontractive maps and are well known for being demiclosed. For the pseudocontractions, the following demiclosedness principle is well known.
Lemma 2.1 ([30])
 (i)
$Fix(U)$ is a closed convex subset of C,
 (ii)
$(IU)$ is demiclosed at zero.
In the next section, we will need to impose the demiclosedness to the quasipseudocontractions.
for all $x,y\in H$ and $t\in [0,1]$.
Lemma 2.2 ([28])
 (i)
for every $u\in \mathrm{\Omega}$, ${lim}_{n}\parallel {u}_{n}u\parallel $ exists,
 (ii)
any weakcluster point of the sequence $\{{u}_{n}\}$ belongs in Ω.
Then there exists ${x}^{\u2020}\in \mathrm{\Omega}$ such that $\{{u}_{n}\}$ weakly converges to ${x}^{\u2020}$.
 1.
${\omega}_{w}({u}_{n})=\{x:\mathrm{\exists}{u}_{{n}_{j}}\to x\text{weakly}\}$ denote the weak ωlimit set of $\{{u}_{n}\}$;
 2.
${u}_{n}\rightharpoonup x$ stands for the weak convergence of $\{{u}_{n}\}$ to x;
 3.
${u}_{n}\to x$ stands for the strong convergence of $\{{u}_{n}\}$ to x.
3 Main results
for all $n\in \mathbb{N}$, where γ, ν, η, and β are four constants, $\{{\alpha}_{n}\}$, $\{{\delta}_{n}\}$, and $\{{\xi}_{n}\}$ are three sequences in $[0,1]$.
Now, we demonstrate the convergence analysis of the algorithm (3.1).
Theorem 3.2 Let ${H}_{1}$ and ${H}_{2}$ be two real Hilbert spaces. Let $A:{H}_{1}\to {H}_{2}$ be a bounded linear operator. Let $U:{H}_{1}\to {H}_{1}$ and $T:{H}_{2}\to {H}_{2}$ be two LLipschitzian quasipseudocontractions with nonempty $Fix(U)=C$ and $Fix(T)=Q$. Assume $TI$ and $UI$ are demiclosed at 0 and $\mathrm{\Gamma}\ne \mathrm{\varnothing}$. If the parameters γ, ν, η, β, $\{{\alpha}_{n}\}$, $\{{\delta}_{n}\}$, and $\{{\xi}_{n}\}$ satisfy the following control conditions:
(C_{1}): $0<\nu <1$ and $0<\gamma <\frac{1}{\lambda \nu}$, where λ is the spectral radius of the operator ${A}^{\ast}A$;
(C_{2}): $0<{lim\hspace{0.17em}inf}_{n\to \mathrm{\infty}}{\alpha}_{n}\le {lim\hspace{0.17em}sup}_{n\to \mathrm{\infty}}{\alpha}_{n}<1$;
(C_{3}): $0<1\eta \le \beta <\frac{1}{\sqrt{1+{L}^{2}}+1}$ and $0<a\le 1{\delta}_{n}\le {\xi}_{n}<\frac{1}{\sqrt{1+{L}^{2}}+1}$ for all $n\in \mathbb{N}$.
Then the sequence $\{{u}_{n}\}$ generated by algorithm (3.2) weakly converges to a split common fixed point $\mu \in \mathrm{\Gamma}$.
Remark 3.3 Without loss of generality, we may assume that the Lipschitz constant $L>1$. It is obvious that $\beta <\frac{1}{\sqrt{1+{L}^{2}}+1}<\frac{1}{L}$ for all $n\ge 1$.
for all $n\in \mathbb{N}$.
for all $\beta \in (0,\frac{1}{L})$.
Proof As a matter of fact, $Fix(T)\subset Fix(T((1\beta )I+\beta T))$ is obvious.
Next, we show that $Fix(T((1\beta )I+\beta T))\subset Fix(T)$.
Since $\beta <\frac{1}{L}$, we deduce ${y}^{\ast}={x}^{\ast}\in Fix(S)=Fix(T)$. Thus, ${x}^{\ast}\in Fix(T)$. Hence, $Fix(T((1\beta )I+\beta T))\subset Fix(T)$. Therefore, $Fix(T((1\beta )I+\beta T))=Fix(T)$. □
for all $x\in {H}_{2}$ and all $x\in Fix(T)$.
for all $x\in {H}_{2}$.
for all $x\in {H}_{2}$ and ${x}^{\ast}\in Fix(T)$.
□
Proposition 3.6 Let the mapping $T:{H}_{2}\to {H}_{2}$ be LLipschitzian with $L>1$. If $TI$ is demiclosed at 0, then $T((1\beta )I+\beta T)I$ is also demiclosed at 0 when $\beta \in (0,\frac{1}{L})$.
Proof Let the sequence $\{{x}_{n}\}\subset {H}_{2}$ satisfying ${x}_{n}\rightharpoonup \tilde{x}$ and ${x}_{n}T((1\beta )I+\beta T){x}_{n}\to 0$. Next, we will show that $\tilde{x}\in Fix(T((1\beta )I+\beta T))$.
Applying the demiclosedness of T, we immediately deduce $\tilde{x}\in Fix(T)$. □
Next, we prove Theorem 3.2.
for all $x\in C$.
Thus, $A\mu \in Fix(T((1\beta )I+\beta T))=Fix(T)$.
From (3.2) and (3.16), we have ${lim}_{n\to \mathrm{\infty}}\parallel {x}_{n}{u}_{n}\parallel =0$. Thus, $\omega {lim}_{j\to \mathrm{\infty}}{x}_{{n}_{j}}=\mu $. By the demiclosedness of $UI$ at 0 and (3.17), we get $\mu \in Fix(U)$. Hence, $\mu \in Fix(U)$. Therefore, $\mu \in \mathrm{\Gamma}$.
This is a contradiction. Hence, the weak convergence of the whole sequence $\{{u}_{n}\}$ follows by applying Lemma 2.2 with $\mathrm{\Omega}=\mathrm{\Gamma}$. This completes the proof. □
Remark 3.7 Since the class of quasipseudocontractions contains the demicontractive operators, the directed operators, the quasinonexpansive operators and the strictly pseudocontractive mappings with fixed points as special cases, our results present a unified framework for the study of this problem and this class of operators.
Corollary 3.8 Let ${H}_{1}$ and ${H}_{2}$ be two real Hilbert spaces. Let $A:{H}_{1}\to {H}_{2}$ be a bounded linear operator. Let $U:{H}_{1}\to {H}_{1}$ and $T:{H}_{2}\to {H}_{2}$ be two LLipschitzian demicontractive mappings with nonempty $Fix(U)=C$ and $Fix(T)=Q$. Assume $TI$ and $UI$ are demiclosed at 0 and $\mathrm{\Gamma}\ne \mathrm{\varnothing}$. If the parameters γ, ν, η, β, $\{{\alpha}_{n}\}$, $\{{\delta}_{n}\}$ and $\{{\xi}_{n}\}$ satisfy the following control conditions:
(C_{1}): $0<\nu <1$ and $0<\gamma <\frac{1}{\lambda \nu}$, where λ is the spectral radius of the operator ${A}^{\ast}A$;
(C_{2}): $0<{lim\hspace{0.17em}inf}_{n\to \mathrm{\infty}}{\alpha}_{n}\le {lim\hspace{0.17em}sup}_{n\to \mathrm{\infty}}{\alpha}_{n}<1$;
(C_{3}): $0<1\eta \le \beta <\frac{1}{\sqrt{1+{L}^{2}}+1}$ and $0<a\le 1{\delta}_{n}\le {\xi}_{n}<\frac{1}{\sqrt{1+{L}^{2}}+1}$ for all $n\in \mathbb{N}$.
Then the sequence $\{{u}_{n}\}$ generated by algorithm (3.2) weakly converges to a split common fixed point $\mu \in \mathrm{\Gamma}$.
Declarations
Acknowledgements
LiJun Zhu was supported in part by NNSF of China (61362033). YeongCheng Liou was supported in part by the Grants NSC 1012628E230001MY3 and NSC 1032923E037001MY3. JenChih Yao was partially supported by the Grant NSC 1032923E037001MY3.
Authors’ Affiliations
References
 Censor Y, Elfving T: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 1994, 8: 221–239. 10.1007/BF02142692MathSciNetView ArticleMATHGoogle Scholar
 Byrne C: Iterative oblique projection onto convex subsets and the split feasibility problem. Inverse Probl. 2002, 18: 441–453. 10.1088/02665611/18/2/310MathSciNetView ArticleMATHGoogle Scholar
 Eicke B: Iteration methods for convexly constrained illposed problems in Hilbert spaces. Numer. Funct. Anal. Optim. 1992, 13: 413–429. 10.1080/01630569208816489MathSciNetView ArticleMATHGoogle Scholar
 Landweber L: An iterative formula for Fredholm integral equations of the first kind. Am. J. Math. 1951, 73: 615–624. 10.2307/2372313MathSciNetView ArticleMATHGoogle Scholar
 Xu HK: Iterative methods for the split feasibility problem in infinitedimensional Hilbert spaces. Inverse Probl. 2010., 26: Article ID 105018Google Scholar
 Censor Y, Segal A: The split common fixed point problem for directed operators. J. Convex Anal. 2009, 16: 587–600.MathSciNetMATHGoogle Scholar
 Moudafi A: A note on the split common fixedpoint problem for quasinonexpansive operators. Nonlinear Anal. 2011, 74: 4083–4087. 10.1016/j.na.2011.03.041MathSciNetView ArticleMATHGoogle Scholar
 Ceng LC, Ansari QH, Yao JC: An extragradient method for split feasibility and fixed point problems. Comput. Math. Appl. 2012, 64: 633–642. 10.1016/j.camwa.2011.12.074MathSciNetView ArticleMATHGoogle Scholar
 Ceng LC, Ansari QH, Yao JC: Relaxed extragradient methods for finding minimumnorm solutions of the split feasibility problem. Nonlinear Anal. 2012, 75: 2116–2125. 10.1016/j.na.2011.10.012MathSciNetView ArticleMATHGoogle Scholar
 Ceng LC, Yao JC: Relaxed and hybrid viscosity methods for general system of variational inequalities with split feasibility problem constraint. Fixed Point Theory Appl. 2013., 2013: Article ID 43Google Scholar
 Dang Y, Gao Y: The strong convergence of a KMCQlike algorithm for a split feasibility problem. Inverse Probl. 2011., 27: Article ID 015007Google Scholar
 Wang F, Xu HK: Approximating curve and strong convergence of the CQ algorithm for the split feasibility problem. J. Inequal. Appl. 2010., 2010: Article ID 102085Google Scholar
 Wang F, Xu HK: Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Anal. 2011, 74: 4105–4111. 10.1016/j.na.2011.03.044MathSciNetView ArticleMATHGoogle Scholar
 Yang Q: The relaxed CQ algorithm solving the split feasibility problem. Inverse Probl. 2004, 20: 1261–1266. 10.1088/02665611/20/4/014View ArticleMathSciNetMATHGoogle Scholar
 Yao Y, Wu J, Liou YC: Regularized methods for the split feasibility problem. Abstr. Appl. Anal. 2012., 2012: Article ID 140679Google Scholar
 Yu X, Shahzad N, Yao Y: Implicit and explicit algorithms for solving the split feasibility problem. Optim. Lett. 2012, 6: 1447–1462. 10.1007/s1159001103400MathSciNetView ArticleMATHGoogle Scholar
 Yao Y, Kim TH, Chebbi S, Xu HK: A modified extragradient method for the split feasibility and fixed point problems. J. Nonlinear Convex Anal. 2012, 13: 383–396.MathSciNetMATHGoogle Scholar
 Zhao J, Yang Q: Several solution methods for the split feasibility problem. Inverse Probl. 2005, 21: 1791–1799. 10.1088/02665611/21/5/017View ArticleMathSciNetMATHGoogle Scholar
 He ZH, Du WS: On hybrid split problem and its nonlinear algorithms. Fixed Point Theory Appl. 2013., 2013: Article ID 47Google Scholar
 He ZH, Du WS: Nonlinear algorithms approach to split common solution problems. Fixed Point Theory Appl. 2012., 2012: Article ID 130Google Scholar
 Chang SS, Wang L, Tang YK, Yang L: The split common fixed point problem for total asymptotically strictly pseudocontractive mappings. J. Appl. Math. 2012., 2012: Article ID 385638Google Scholar
 Chang SS, Kim J, Cho YJ, Sim J: Weak and strong convergence theorems of solutions to split feasibility problem for nonspreading type mapping in Hilbert spaces. Fixed Point Theory Appl. 2014., 2014: Article ID 11Google Scholar
 Cui H, Su M, Wang F: Damped projection method for split common fixed point problems. J. Inequal. Appl. 2013., 2013: Article ID 123 10.1186/1029242X2013123Google Scholar
 Yao Y, Postolache M, Liou YC: Strong convergence of a selfadaptive method for the split feasibility problem. Fixed Point Theory Appl. 2013., 2013: Article ID 201Google Scholar
 Zhao J, He S: Alternating Mann iterative algorithms for the split common fixedpoint problem of quasinonexpansive mappings. Fixed Point Theory Appl. 2013., 2013: Article ID 288Google Scholar
 Deepho J, Kumam P: Mann’s type extragradient for solving split feasibility and fixed point problems of Lipschitz asymptotically quasinonexpansive mappings. Fixed Point Theory Appl. 2013., 2013: Article ID 349Google Scholar
 Ansari QH, Rehan A: Split feasibility and fixed point problems. In Nonlinear Analysis: Approximation Theory, Optimization and Applications. Edited by: Ansari QH. Springer, Berlin; 2014:271–314.Google Scholar
 Bauschke HH, Combettes PL: A weaktostrong convergence principle for Fejemonotone methods in Hilbert spaces. Math. Oper. Res. 2001, 26: 248–264. 10.1287/moor.26.2.248.10558MathSciNetView ArticleMATHGoogle Scholar
 Maruster S, Popirlan C: On the Manntype iteration and convex feasibility problem. J. Comput. Appl. Math. 2008, 212: 390–396. 10.1016/j.cam.2006.12.012MathSciNetView ArticleMATHGoogle Scholar
 Zhou H: Strong convergence of an explicit iterative algorithm for continuous pseudocontractions in Banach spaces. Nonlinear Anal. 2009, 70: 4039–4046. 10.1016/j.na.2008.08.012MathSciNetView ArticleMATHGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.