- Research
- Open access
- Published:
Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction
Fixed Point Theory and Applications volume 2015, Article number: 127 (2015)
Abstract
The split common fixed point problem for two quasi-pseudo-contractive operators is studied. Some properties for quasi-pseudo-contractive operators are presented. An iterative algorithm for solving the split common fixed point problem for two quasi-pseudo-contractive operators is constructed. Strong convergence theorems are proved. A unified framework for the study of this class problem and class of operators is provided.
1 Introduction
The split common fixed point problem has recently attracted so much attention (see, e.g., [1–13]) due to the fact that it is a generalization of the split feasibility problem and the convex feasibility problem. In this paper, we aim to construct iterative algorithms for solving the split common fixed point problem for the class of quasi-pseudo-contractive operators. This more general class, which properly includes the classes of quasi-nonexpansive operators, directed operators, and demicontractive operators, is more desirable for example in fixed point methods in image recovery where in many cases, it is possible to map the set of images possessing a certain property to the fixed point set of a nonlinear quasi-nonexpansive operator. Our work is related to significant real-world applications; see for instance [14–18] and [19–21], where such methods were applied to the inverse problem of intensity-modulated radiation therapy and to the dynamic emission tomographic image reconstruction. Based on the related work in the literature, we present a unified framework for the study of this class problem and class of operators and propose iterative algorithms and study their convergence.
To begin with, let us recall that the split feasibility problem is to find a point
where C and Q are two nonempty closed convex subsets of real Hilbert spaces \(H_{1}\) and \(H_{2}\), respectively and \(A:H_{1}\to H_{2}\) is a bounded linear operator.
The split feasibility problem in finite-dimensional Hilbert spaces was first introduced by Censor and Elfving [14] for modeling inverse problems which arise from phase retrievals and in medical image reconstruction. They used their simultaneous multiprojections algorithm to obtain iterative algorithms to solve the split feasibility problem. Their algorithms, as well as others, see, e.g., Byrne [22], involve matrix inversion at each iterative step. Calculating the inverses of matrices is very time-consuming, particularly if the dimensions are large. Therefore, a new algorithm for solving the split feasibility problem was devised by Byrne [15], called the CQ-algorithm, with the following iterative step:
where \(0<\gamma<2/\|A\|^{2}\) and \(P_{Q}\) denotes the nearest point projection from \(H_{2}\) onto Q. The CQ-algorithm converges to a solution of the split feasibility problem, for any starting vector \(x_{0} \in\mathbb{R}^{N}\), whenever the split feasibility problem has a solution. When the split feasibility problem has no solutions, the CQ-algorithm converges to a minimizer of \(\|P_{Q}(Ac)-Ac\|\) over all \(c \in C\), whenever such a minimizer exists.
In the case where C and Q in (1.1) are the intersections of finitely many fixed point sets of nonlinear operators, problem (1.1) is called by Censor and Segal [1] the split common fixed point problem. More precisely, the split common fixed point problem requires one to seek an element \(x^{*}\in H\) satisfying
where \(\operatorname{Fix}(T_{i})\) and \(\operatorname{Fix}(S_{j})\) denote the fixed point sets of two classes of nonlinear operators \(T_{i}:H_{1}\to H_{1}\) and \(S_{j}: H_{2}\to H_{2}\), respectively.
Remark 1.1
If we set \(C=\bigcap_{i=1}^{m}\operatorname{Fix}(T_{i})\) and \(Q=\bigcap_{j=1}^{n}\operatorname{Fix}(S_{j})\), a natural problem arises: could we use iterative algorithm (1.2) to approach the solution of the split common fixed point problem (1.3)? However, in this situation, Byrne’s CQ-algorithm does not work because the metric projection onto fixed point sets is generally not easy to calculate.
Consequently, in order to solve the two-set split common fixed point problem, Censor and Segal [1] constructed the following iterative algorithm without using the projection.
Algorithm 1.2
Initialization: Let \(x_{0}\in\mathbb{R}^{N}\) be arbitrary.
Iterative step: For \(k\ge0\) let
where T and S are directed operators and \(\lambda\in(0,2/\gamma)\) with γ being the spectral radius of the operator \(A^{*}A\).
They have shown the following convergence theorem.
Theorem 1.3
Assume that \(T-I\) and \(S-I\) are demiclosed at 0. If \(\Gamma:=\{x\in \operatorname{Fix}(T); Ax\in \operatorname{Fix}(S)\}\ne\emptyset\), i.e., the problem is consistent, then any sequence \(\{x_{k}\}\), generated by Algorithm 1.2, converges to a split common fixed point \(x^{*}\in\Gamma\).
Remark 1.4
Note that the underlying space in Theorem 1.3 is a finite-dimensional space \(\mathbb{R}^{N}\). Hence, the strong convergence and weak convergence are consistent. Could we extend it to an infinite-dimensional space?
In [2], Moudafi demonstrated this work for us. He not only extended the space to the infinite-dimensional case but also extended the operators to a general class of operators and obtained the following algorithm and result.
Algorithm 1.5
Initialization: Let \(x_{0}\in H_{1}\) be arbitrary.
Iterative step: For \(k\in\mathbb{N}\) set \(u_{k}=x_{k}+\lambda A^{*}(S-I)Ax_{k}\) and let
where \(\lambda\in(0,\frac{1-\mu}{\gamma})\) with γ being the spectral radius of the operator \(A^{*}A\) and \(\alpha_{k}\in(0,1)\).
Theorem 1.6
Given a bounded linear operator \(A:H_{1}\to H_{2}\), let \(T: H_{1}\to H_{1}\) and \(S:H_{2}\to H_{2}\) be demicontractive operators (with constants β and μ, respectively) with nonempty \(\operatorname{Fix}(T)=C\) and \(\operatorname{Fix}(S)=Q\). Assume that \(T-I\) and \(S-I\) are demiclosed at 0. If \(\Gamma\ne\emptyset\), then any sequence \(\{x_{k}\}\) generated by the Algorithm 1.5 converges weakly to a split common fixed point \(x^{*}\in\Gamma\), provided that \(\alpha_{k}\in(\delta, 1-\beta-\delta)\) for a small enough \(\delta>0\).
Remark 1.7
It is clear that Algorithm 1.5 is a relaxation version of Algorithm 1.2. Theorem 1.6 extended Theorem 1.3 from directed operators to demicontractive operators and from finite-dimensional spaces to infinite-dimensional spaces.
Remark 1.8
Notice that Theorem 1.6 has only weak convergence in infinite-dimensional spaces, and it is well known that the strong convergence theorem is always more convenient to use. Could we construct an algorithm such that the strong convergence is guaranteed in the infinite-dimensional spaces?
For this purpose, He and Du [23] presented the following hybrid algorithm.
Algorithm 1.9
where P is a projection operator.
Remark 1.10
Algorithm 1.9 has strong convergence under some mild assumptions. However, Algorithm 1.9 is involved with the computation of metric projection. This might seriously affect the efficiency of the method.
To overcome the above difficulty, the so-called self-adaptive method which permits step-size being selected self-adaptively was developed. Especially, in [24], Yao et al. presented the following algorithm.
Algorithm 1.11
Let C and Q be nonempty closed convex subsets of real Hilbert spaces \(H_{1}\) and \(H_{2}\), respectively. Let \(\psi\colon C\to H_{1}\) be a δ-contraction with \(\delta\in[0,\frac{\sqrt{2}}{2})\). Let \(A\colon H_{1}\to H_{2}\) be a bounded linear operator. For given \(x_{0}\in C\), assume that \(\{x_{n}\}\) has been constructed. If \(\nabla f(x_{n})=0\), then stop and \(x_{n}\) is a solution of the (1.1). Otherwise, continue and compute \(x_{n+1}\) by the recursion
where \(\{\alpha_{n}\}\subset(0,1)\) and \(\{\rho_{n}\}\subset(0,2)\).
Consequently, Yao et al. proved the strong convergence of (1.7) under some additional conditions. Further, Zhou and Wang [25] used a new analysis technique to prove the convergence of (1.7) under some mild conditions.
The purpose of this paper is twofold. First, we will consider the split common fixed point problem for the class of quasi-pseudo-contractive operators which is more general than that the classes of quasi-nonexpansive operators, directed operators and demicontractive operators. Secondly, we will construct iterative algorithms with strong convergence without using the projection. Our results provide a unified framework for the study of this problem and this class of operators.
2 Preliminaries
In this section, we collect some tools including some definitions, some useful inequalities and lemmas which will be used to derive our main results in the next section.
Let H be a real Hilbert space with inner product \(\langle\cdot,\cdot\rangle\) and norm \(\|\cdot\|\), respectively. Let C be a nonempty closed convex subset of H. Let \(T:C\to C\) be an operator. We use \(\operatorname{Fix}(T)\) to denote the set of fixed points of T, that is, \(\operatorname{Fix}(T)=\{x\mid x=Tx, x\in C\}\).
Definition 2.1
An operator \(T:C\to C\) is said to be
-
(i)
Nonexpansive if \(\|Tx-Ty\|\le\|x-y\|\) for all \(x,y\in C\).
-
(ii)
Quasi-nonexpansive if \(\|Tx-x^{*}\|\le\|x-x^{*}\|\) for all \(x\in C\) and \(x^{*}\in \operatorname{Fix}(T)\).
-
(iii)
Firmly nonexpansive if \(\|Tx-Ty\|^{2}\le\|x-y\|^{2}-\| (I-T)x-(I-T)y\|^{2}\) for all \(x,y\in C\).
-
(iv)
Firmly quasi-nonexpansive if \(\|Tx-x^{*}\|^{2}\le\|x-x^{*}\|^{2}-\| Tx-x\|^{2}\) for all \(x\in C\) and \(x^{*}\in \operatorname{Fix}(T)\).
-
(v)
Strictly pseudo-contractive if \(\|Tx-Ty\|^{2}\le\|x-y\|^{2}+k\| (I-T)x-(I-T)y\|^{2}\) for all \(x,y\in C\), where \(k\in[0, 1)\).
-
(vi)
Directed if \(\langle Tx-x^{*}, Tx-x\rangle\le0\) for all \(x\in C\) and \(x^{*}\in \operatorname{Fix}(T)\).
-
(vii)
Demicontractive if \(\|Tx-x^{*}\|^{2}\le\|x-x^{*}\|^{2}+k\|Tx-x\| ^{2}\) for all \(x\in C\) and \(x^{*}\in \operatorname{Fix}(T)\), where \(k\in[0, 1)\).
Remark 2.2
The concept of directed operators was introduced and investigated by Bauschke and Combettes in [26] and by Combettes in [27]. They proved that \(T:C\to C\) is directed if and only if
for all \(x\in C\) and \(x^{*}\in \operatorname{Fix}(T)\). It can be seen easily that the class of directed operators coincides with that of firmly quasi-nonexpansive operators.
Remark 2.3
From the above definitions, we note that the class of demicontractive operators contains important operators such as the directed operators, the quasi-nonexpansive operators and the strictly pseudo-contractive operators with fixed points. Such a class of operators is fundamental because it includes many types of nonlinear operators arising in applied mathematics and optimization.
Definition 2.4
An operator \(T:C\to C\) is said to be pseudo-contractive if
for all \(x, y\in C\).
The interest of pseudo-contractive operators lies in their connection with monotone operators; namely, T is a pseudo-contraction if and only if the complement \(I-T\) is a monotone operator. It is well known that T is pseudo-contractive if and only if
for all \(x,y\in C\).
Definition 2.5
An operator \(T:C\to C\) is said to be quasi-pseudo-contractive if
for all \(x\in C\) and \(x^{*}\in \operatorname{Fix}(T)\).
It is obvious that the class of quasi-pseudo-contractive mappings includes the class of demicontractive mappings.
Definition 2.6
An operator \(T:C\to C\) is said to be L-Lipschitzian if there exists \(L>0\) such that
for all \(x,y\in C\).
Usually, the convergence of fixed point algorithms requires some additional smoothness properties of the mapping T such as demi-closedness.
Definition 2.7
An operator 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, then \(T(\tilde{x})=z\).
For all \(x, y\in H\), the following conclusions hold:
and
Lemma 2.8
([28])
Assume that \(\{a_{n}\}\) is a sequence of nonnegative real numbers such that
where \(\{\gamma_{n}\}\) is a sequence in \((0,1)\) and \(\{\delta_{n}\}\) is a sequence such that
-
(1)
\(\sum_{n=1}^{\infty}\gamma_{n}=\infty\);
-
(2)
\(\limsup_{n\rightarrow\infty}\frac{\delta_{n}}{\gamma_{n}}\leq0\) or \(\sum_{n=1}^{\infty}|\delta_{n}|<\infty\).
Then \(\lim_{n\rightarrow\infty}a_{n}=0\).
Lemma 2.9
([29])
Let \(\{w_{n}\}\) be a sequence of real numbers. Assume \(\{w_{n}\}\) does not decrease at infinity, that is, there exists at least a subsequence \(\{w_{n_{k}}\}\) of \(\{w_{n}\}\) such that \(w_{n_{k}}\le w_{n_{k}+1}\) for all \(k\ge0\). For every \(n\ge N_{0}\), define an integer sequence \(\{\tau(n)\}\) as
Then \(\tau(n)\to\infty\) as \(n\to\infty\) and for all \(n\ge N_{0}\)
3 Main results
In this section, we first show several properties for Lipschitzian operators and quasi-pseudo-contractive operators. These properties will be very useful for our main theorem. The first property is said to be commutativity in the sense of the set of fixed points of two operators.
Property 3.1
(Commutativity)
Let H be a Hilbert space. Let \(T:H \to H \) be an L-Lipschitzian operator with \(L>1\). Then
for all \(\zeta\in(0,\frac{1}{L})\).
Proof
We will divide our proof into two steps:
-
(i)
\(\operatorname{Fix}(((1-\zeta)I+\zeta T)T)=\operatorname{Fix}(T)\);
-
(ii)
\(\operatorname{Fix}(T((1-\zeta)I+\zeta T))=\operatorname{Fix}(T)\).
Proof of (i). \(\operatorname{Fix}(T)\subset \operatorname{Fix}(((1-\zeta)I+\zeta T)T)\) is obvious. We only need to prove that \(\operatorname{Fix}(((1-\zeta)I+\zeta T)T) \subset \operatorname{Fix}(T)\). Let \(x^{\dagger}\in \operatorname{Fix}(((1-\zeta)I+\zeta T)T)\). Thus, \(((1-\zeta)I+\zeta T)Tx^{\dagger}=x^{\dagger}\). Observe that
Since \(\zeta L<1\), we get \(x^{\dagger}=Tx^{\dagger}\). That is, \(x^{\dagger}\in \operatorname{Fix}(T)\). Hence, \(\operatorname{Fix}(((1-\zeta)I+\zeta T)T) \subset \operatorname{Fix}(T)\).
Proof of (ii). \(\operatorname{Fix}(T)\subset \operatorname{Fix}(T((1-\zeta)I+\zeta T))\) is obvious. Next, we show that \(\operatorname{Fix}(T((1-\zeta)I+\zeta T)) \subset \operatorname{Fix}(T)\).
Take any \(x^{*}\in \operatorname{Fix}(T((1-\zeta)I+\zeta T))\). We have \(T((1-\zeta )I+\zeta T)x^{*}=x^{*}\). Set \(U=(1-\zeta)I+\zeta T\). We have \(TUx^{*}=x^{*}\). Write \(Ux^{*}=y^{*}\). Then \(Ty^{*}=x^{*}\). Now we show \(x^{*}=y^{*}\). In fact,
Since \(\zeta<\frac{1}{L}\), we deduce \(y^{*}=x^{*}\in \operatorname{Fix}(U)=\operatorname{Fix}(T)\). Thus, \(x^{*}\in \operatorname{Fix}(T)\). Hence, \(\operatorname{Fix} (T((1-\zeta)I+\zeta T))\subset \operatorname{Fix}(T)\). Therefore, \(\operatorname{Fix}(T((1-\zeta)I+\zeta T))= \operatorname{Fix}(T)\). □
The second property is the demiclosed principle for the operator \(I-T((1-\zeta)I+\zeta T)\) under some mild conditions.
Property 3.2
(Demiclosedness)
Let H be a Hilbert space. Let \(T:H\to H\) be an L-Lipschitzian operator with \(L>1\). If \(I-T\) is demiclosed at 0, then \(I-T((1-\zeta )I+\zeta T)\) is also demiclosed at 0 when \(\zeta\in(0, \frac{1}{L})\).
Proof
Let the sequence \(\{u_{n}\}\subset H\) satisfying \(u_{n}\rightharpoonup \tilde{x}\) and \(u_{n}-T((1-\zeta)I+\zeta T)u_{n}\to0\). Next, we will show that \(\tilde{x}\in \operatorname{Fix}(T((1-\zeta)I+\zeta T))\).
From Property 3.1, we only need to prove that \(\tilde{x}\in \operatorname{Fix}(T)\). As a matter of fact, since T is L-Lipschizian, we have
It follows that
Hence,
By the demi-closedness of \(I-T\), we immediately deduce \(\tilde{x}\in \operatorname{Fix}(T)\). □
The third property is the quasi-nonexpansivity of the composite quasi-pseudo-contractive operator under some mild assumptions.
Property 3.3
(Quasi-nonexpansivity)
Let H be a Hilbert space. Let \(T:H \to H \) be an L-Lipschitz quasi-pseudo-contractive operator. Then the operator \((1-\xi)I+\xi T((1-\eta)I+\eta T)\) is quasi-nonexpansive when \(0<\xi<\eta<\frac{1}{\sqrt{1+L^{2}}+1}\). That is,
for all \(x\in H\) and \(u^{\dagger}\in \operatorname{Fix}(T)\).
Proof
Since \(u^{\dagger}\in \operatorname{Fix}(T)\), we have from (2.1)
and
for all \(x\in H\).
Since T is L-Lipschitzian and \(x-((1-\eta)x+\eta Tx)=\eta(x-Tx)\), we have
By (3.1), (3.4), and (3.5), we obtain
Since \(\eta<\frac{1}{\sqrt{1+L^{2}}+1}\), we deduce
From (3.6), we deduce
for all \(x\in H\) and \(u^{\dagger}\in \operatorname{Fix}(T)\).
Combine (2.2) and (3.7) to get
This together with \(\xi<\eta\) implies that
This completes the proof. □
In the sequel, we introduce our algorithm and prove its strong convergence.
Some assumptions on the underlying spaces and involved operators are listed below.
-
(R1)
\(H_{1}\) and \(H_{2}\) are two real Hilbert spaces.
-
(R2)
\(A: H_{1} \to H_{2}\) is a bounded linear operator with its adjoint \(A^{*}\) and \(B:H_{1}\to H_{1}\) is a strong positive linear bounded operator with coefficient \(\xi>\rho\).
-
(R3)
\(f:H_{1}\to H_{1}\) is a ρ-contraction, \(S:H_{2}\to H_{2}\) is an \(L_{1}\)-Lipschitzian quasi-pseudo-contractive operator with \(L_{1}>1\) and \(T:H_{1}\to H_{1}\) is an \(L_{2}\)-Lipschitzian quasi-pseudo-contractive operator with \(L_{2}>1\).
Our object is to solve the following two-set split common fixed point problem:
We use Γ to denote the set of solutions of (3.8), that is,
In the sequel, we assume \(\Gamma\ne\emptyset\).
Now, we present our algorithm for finding \(x^{*}\in\Gamma\).
Algorithm 3.4
Initialization: Let \(x_{0}\in H_{1}\) be arbitrary.
Iterative step: For \(n\ge0\) let
where \(\{\alpha_{n}\}_{n\in\mathbb{N}}\), \(\{\beta_{n}\}_{n\in\mathbb {N}}\), \(\{\gamma_{n}\}_{n\in\mathbb{N}}\), \(\{\zeta_{n}\}_{n\in\mathbb {N}}\), and \(\{\eta_{n}\}_{n\in\mathbb{N}}\) are five real number sequences in \((0,1)\) and δ is a constant in \((0, \frac{1}{\|A\|^{2}})\).
Theorem 3.5
Suppose \(T-I\) and \(S-I\) are demiclosed at 0. Assume that the following conditions are satisfied:
-
(C1)
\(\lim_{n\to\infty}\alpha_{n}=0\);
-
(C2)
\(\sum_{n=1}^{\infty}\alpha_{n}=\infty\);
-
(C3)
\(0< a_{1}<\beta_{n}<c_{1}<\gamma_{n}<b_{1}<\frac{1}{\sqrt{1+L_{2}^{2}}+1}\);
-
(C4)
\(0< a_{2}<\zeta_{n}<c_{2}<\eta_{n}<b_{2}<\frac{1}{\sqrt{1+L_{1}^{2}}+1}\).
Then the sequence \(\{x_{n}\}\) generated by algorithm (3.9) converges strongly to \(x^{*}=P_{\Gamma}(f+I-B)x^{*}\).
Proof
Let \(x^{*}=P_{\Gamma}(f+I-B)x^{*}\). Then we have \(x^{*}\in \operatorname{Fix}(T)\) and \(Ax^{*}\in \operatorname{Fix}(S)\). From Property 3.1 and Property 3.2, we get
From (2.1), we deduce
This together with (3.9) and (2.2) implies that
Note that
By (2.3), we have
Since A is a linear operator, with adjoint \(A^{*}\), we have
Again using (2.3), we obtain
From (3.10), (3.14), and (3.15), we get
So,
It follows that
Substituting (3.18) into (3.12), we deduce that
From (3.11) and (3.19), we get
The boundedness of the sequence \(\{x_{n}\}\) yields the result.
Next, we focus our analysis on the fact that the real sequence \(\{\|x_{n}-x^{*}\|\}\) is either monotone decreasing at infinity (Case 1) or not (Case 2):
Case 1. There exists \(n_{0}\) such that the sequence \(\{\|x_{n}-x^{*}\|\} _{n\ge n_{0}}\) is decreasing.
Case 2. For any \(n_{0}\), there exists an integer \(m\ge n_{0}\) such that \(\| x_{m}-x^{*}\|\le\|x_{m+1}-x^{*}\|\).
More precisely, regarding the situation when \(\{\|x_{n}-x^{*}\|\}\) is monotonous at infinity (Case 1) and bounded (hence convergent), we prove that its only possible limit is zero.
In Case 1, we assume there exists some integer \(n_{0}>0\) such that \(\{\| x_{n}-x^{*}\|\}\) is decreasing for all \(n\ge n_{0}\). In this case, we know that \(\lim_{n\to\infty}\|x_{n}-x^{*}\|\) exists. Returning to (3.12), we have
where \(M>0\) is a constant such that
Hence,
Since \(\lim_{n\to\infty}\|x_{n}-x^{*}\|\) exists and \(\alpha_{n}\to0\), we obtain
Therefore,
We have
It follows that
Hence,
Note that
This together with (3.21) implies that
From (3.10) and (3.20), we deduce
It follows that
Therefore,
Observe that
Thus,
This together with (3.24) implies that
Now, we show that
Choose a subsequence \(\{u_{n_{i}}\}\) of \(\{u_{n}\}\) such that
Since the sequence \(\{u_{n_{i}}\}\) is bounded, we can choose a subsequence \(\{u_{n_{i_{j}}}\}\) of \(\{u_{n_{i}}\}\) such that \(u_{n_{i_{j}}}\rightharpoonup z\). For the sake of convenience, we assume (without loss of generality) that \(u_{n_{i}}\rightharpoonup z\). Consequently, we derive from the above conclusions that
By the demi-closedness of \(T-I\) and \(S-I\), we deduce \(Az\in \operatorname{Fix}(S)\) and \(z\in \operatorname{Fix}(T)\). That is to say, \(z\in\Gamma\).
Therefore,
Using (2.4), we have
Therefore,
Applying Lemma 2.8 and (3.28) to (3.30), we deduce \(x_{n}\to x^{*}\).
In Case 2 above, we know that, for any integer \(n_{0}\), there exists another integer \(p\ge n_{0}\) such that \(\|x_{p}-x^{*}\|\le\|x_{p+1}-x^{*}\|\). Let \(n_{0}\) be such that \(\|x_{n_{0}}-x^{*}\|\le\|x_{n_{0}+1}-x^{*}\|\). Set \(\omega_{n}=\{\|x_{n}-x^{*}\|\}\). Then we have
Define an integer sequence \(\{\tau_{n}\}\) for all \(n\ge n_{0}\) as follows:
It is clear that \(\tau(n)\) is a non-decreasing sequence satisfying
and
for all \(n\ge n_{0}\).
By a similar argument to that of Case 1, we can obtain
and
This implies that
Thus, we obtain
Since \(\omega_{\tau(n)}\le\omega_{\tau(n)+1}\), we have from (3.30)
It follows that
Combining (3.31) and (3.33), we have
and hence
From (3.32), we deduce
This together with (3.34) implies that
Applying Lemma 2.9 to get
Therefore, \(\omega_{n}\to0\). That is, \(x_{n}\to x^{*}\). This completes the proof. □
From Algorithm 3.4 and Theorem 3.5, we can deduce easily the following algorithms and corollaries.
Algorithm 3.6
Initialization: Let \(x_{0}\in H_{1}\) be arbitrary.
Iterative step: For \(n\ge0\) let
where \(\{\alpha_{n}\}_{n\in\mathbb{N}}\), \(\{\beta_{n}\}_{n\in\mathbb {N}}\), \(\{\gamma_{n}\}_{n\in\mathbb{N}}\), \(\{\zeta_{n}\}_{n\in\mathbb {N}}\), and \(\{\eta_{n}\}_{n\in\mathbb{N}}\) are five real number sequences in \((0,1)\) and δ is a constant in \((0, \frac{1}{\|A\|^{2}})\).
Corollary 3.7
Suppose \(T-I\) and \(S-I\) are demiclosed at 0. Assume that the following conditions are satisfied:
-
(C1)
\(\lim_{n\to\infty}\alpha_{n}=0\);
-
(C2)
\(\sum_{n=1}^{\infty}\alpha_{n}=\infty\);
-
(C3)
\(0< a_{1}<\beta_{n}<c_{1}<\gamma_{n}<b_{1}<\frac{1}{\sqrt{1+L_{2}^{2}}+1}\);
-
(C4)
\(0< a_{2}<\zeta_{n}<c_{2}<\eta_{n}<b_{2}<\frac{1}{\sqrt{1+L_{1}^{2}}+1}\).
Then the sequence \(\{x_{n}\}\) generated by algorithm (3.35) converges strongly to \(x^{*}=P_{\Gamma}(f)x^{*}\).
Algorithm 3.8
Initialization: Let \(x_{0}\in H_{1}\) be arbitrary.
Iterative step: For \(n\ge0\) let
where \(\{\alpha_{n}\}_{n\in\mathbb{N}}\), \(\{\beta_{n}\}_{n\in\mathbb {N}}\), \(\{\gamma_{n}\}_{n\in\mathbb{N}}\), \(\{\zeta_{n}\}_{n\in\mathbb {N}}\), and \(\{\eta_{n}\}_{n\in\mathbb{N}}\) are five real number sequences in \((0,1)\) and δ is a constant in \((0, \frac{1}{\|A\|^{2}})\).
Corollary 3.9
Suppose \(T-I\) and \(S-I\) are demiclosed at 0. Assume that the following conditions are satisfied:
-
(C1)
\(\lim_{n\to\infty}\alpha_{n}=0\);
-
(C2)
\(\sum_{n=1}^{\infty}\alpha_{n}=\infty\);
-
(C3)
\(0< a_{1}<\beta_{n}<c_{1}<\gamma_{n}<b_{1}<\frac{1}{\sqrt{1+L_{2}^{2}}+1}\);
-
(C4)
\(0< a_{2}<\zeta_{n}<c_{2}<\eta_{n}<b_{2}<\frac{1}{\sqrt{1+L_{1}^{2}}+1}\).
Then the sequence \(\{x_{n}\}\) generated by algorithm (3.36) converges strongly to \(x^{*}=P_{\Gamma}(0)x^{*}\), which is the minimum norm element in Γ.
Remark 3.10
From Remark 2.3, we know that if S and T are quasi-nonexpansive operators or directed operators or demicontractive operators, the above corollaries are still valid.
Note that the pseudo-contractive operator satisfies the following demi-closedness principle.
Lemma 3.11
([30])
Let H be a real Hilbert space, C a closed convex subset of H. Let \(U:C\to C\) be a continuous pseudo-contractive operator. Then
-
(i)
\(\operatorname{Fix}(U)\) is a closed convex subset of C,
-
(ii)
\((I-U)\) is demiclosed at zero.
Corollary 3.12
Suppose that \(S:H_{2}\to H_{2}\) is an \(L_{1}\)-Lipschitzian pseudo-contractive operator with \(L_{1}>1\) and \(T:H_{1}\to H_{1}\) is an \(L_{2}\)-Lipschitzian pseudo-contractive operator with \(L_{2}>1\). Assume the following conditions are satisfied:
-
(C1)
\(\lim_{n\to\infty}\alpha_{n}=0\);
-
(C2)
\(\sum_{n=1}^{\infty}\alpha_{n}=\infty\);
-
(C3)
\(0< a_{1}<\beta_{n}<c_{1}<\gamma_{n}<b_{1}<\frac{1}{\sqrt{1+L_{2}^{2}}+1}\);
-
(C4)
\(0< a_{2}<\zeta_{n}<c_{2}<\eta_{n}<b_{2}<\frac{1}{\sqrt{1+L_{1}^{2}}+1}\).
Then the sequence \(\{x_{n}\}\) generated by algorithm (3.9) converges strongly to \(x^{*}=P_{\Gamma}(f+I-B)x^{*}\).
Remark 3.13
Our algorithms and results provide a unified framework for the study of the two-set split common fixed point problem.
References
Censor, Y, Segal, A: The split common fixed point problem for directed operators. J. Convex Anal. 16, 587-600 (2009)
Moudafi, A: The split common fixed-point problem for demicontractive mappings. Inverse Probl. 26, 055007 (2010)
Moudafi, A: A note on the split common fixed-point problem for quasi-nonexpansive operators. Nonlinear Anal. 74, 4083-4087 (2011)
Wang, F, Xu, HK: Cyclic algorithms for split feasibility problems in Hilbert spaces. Nonlinear Anal. 74, 4105-4111 (2011)
Zhao, J, He, S: Alternating Mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings. Fixed Point Theory Appl. 2013, Article ID 288 (2013)
Cui, H, Wang, F: Iterative methods for the split common fixed point problem in Hilbert spaces. Fixed Point Theory Appl. 2014, Article ID 78 (2014)
He, ZH, Du, WS: On hybrid split problem and its nonlinear algorithms. Fixed Point Theory Appl. 2013, Article ID 47 (2013)
Yao, Y, Agarwal, RP, Postolache, M, Liou, YC: Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem. Fixed Point Theory Appl. 2014, Article ID 183 (2014)
Zhu, LJ, Liou, YC, Kang, SM, Yao, Y: Algorithmic and analytical approach to the split common fixed points problem. Fixed Point Theory Appl. 2014, Article ID 172 (2014)
Chang, SS, Wang, L, Tang, YK, Yang, L: The split common fixed point problem for total asymptotically strictly pseudocontractive mappings. J. Appl. Math. 2012, Article ID 385638 (2012)
Cholamjiak, P, Shehu, Y: Iterative approximation for split common fixed point problem involving an asymptotically nonexpansive semigroup and a total asymptotically strict pseudocontraction. Fixed Point Theory Appl. 2014, Article ID 131 (2014)
Zhao, J, He, S: Alternating Mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings. Fixed Point Theory Appl. 2013, Article ID 288 (2013)
He, ZH, Du, WS: Nonlinear algorithms approach to split common solution problems. Fixed Point Theory Appl. 2012, Article ID 130 (2012)
Censor, Y, Elfving, T: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 8, 221-239 (1994)
Byrne, C: Iterative oblique projection onto convex subsets and the split feasibility problem. Inverse Probl. 18, 441-453 (2002)
Xu, HK: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 26, 105018 (2010)
Byrne, C: A unified treatment of some iterative algorithms in signal processing and image reconstruction. Inverse Probl. 20, 103-120 (2004)
Censor, Y, Bortfeld, T, Martin, B, Trofimov, A: A unified approach for inversion problems intensity-modulated radiation therapy. Phys. Med. Biol. 51, 2353-2365 (2006)
Huang, X, Lu, X, Wen, X: New common fixed point theorem for a family of non-self mappings in cone metric spaces. J. Nonlinear Sci. Appl. 8, 387-401 (2015)
He, F: Common fixed point of four self maps on dislocated metric spaces. J. Nonlinear Sci. Appl. 8, 301-308 (2015)
Purtas, Y, Kiziltunc, H: Weak and strong convergence of an explicit iteration process for an asymptotically quasi-i-nonexpansive mapping in Banach spaces. J. Nonlinear Sci. Appl. 5, 403-411 (2012)
Byrne, C: Bregman-Legendre multidistance projection algorithms for convex feasibility and optimization. In: Butnariu, D, Censor, Y, Reich, S (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 87-100. Elsevier, Amsterdam (2001)
He, ZH, Du, WS: On split common solution problems: new nonlinear feasible algorithms, strong convergence results and their applications. Fixed Point Theory Appl. 2014, Article ID 219 (2014)
Yao, Y, Postolache, M, Liou, YC: Strong convergence of a self-adaptive method for the split feasibility problem. Fixed Point Theory Appl. 2013, Article ID 201 (2013)
Zhou, H, Wang, P: Some remarks on the paper ‘Strong convergence of a self-adaptive method for the spilt feasibility problem’. Numer. Algorithms (2014). doi:10.1007/s11075-014-9949-2
Bauschke, HH, Combettes, PL: A weak-to-strong convergence principle for Fejer-monotone methods in Hilbert spaces. Math. Oper. Res. 26, 248-264 (2001)
Combettes, PL: Quasi-Fejerian analysis of some optimization algorithms. In: Butnariu, D, Censor, Y, Reich, S (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, pp. 115-152. Elsevier, Amsterdam (2001)
Xu, HK: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 66, 240-256 (2002)
Mainge, PE: Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces. J. Math. Anal. Appl. 325, 469-479 (2007)
Zhou, H: Strong convergence of an explicit iterative algorithm for continuous pseudocontractions in Banach spaces. Nonlinear Anal. 70, 4039-4046 (2009)
Acknowledgements
Yeong-Cheng Liou was supported in part by NSC 101-2628-E-230-001-MY3 and NSC 101-2622-E-230-005-CC3. Jen-Chih Yao was partially supported by the Grant MOST 103-2923-E-039-001-MY3.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Yao, Y., Liou, YC. & Yao, JC. Split common fixed point problem for two quasi-pseudo-contractive operators and its algorithm construction. Fixed Point Theory Appl 2015, 127 (2015). https://doi.org/10.1186/s13663-015-0376-4
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13663-015-0376-4