- Research
- Open Access
- Published:
New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
Journal of Inequalities and Applications volume 2014, Article number: 304 (2014)
Abstract
In this paper, we study the split common fixed point problem, which is to find a fixed point of a quasi-pseudocontractive mapping in one space whose image under a linear transformation is a fixed point of anther quasi-pseudocontractive 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.
1 Background and motivation
Let C and Q be nonempty closed convex subsets of real Hilbert spaces and , respectively. The split feasibility problem is formulated as finding a point with the property
where is a bounded linear operator. The split feasibility problem in finite-dimensional 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].
A special case of the split feasibility problem (1.1) is when is singleton and then (1.1) is reduced to the convexly constrained linear inverse problem [3]
which has received considerable attention.
The well-known projected Landweber algorithm [4] is widely used to solve (1.2). This algorithm generates a sequence in such a way that we have
-
initialization: selected in arbitrarily, and
-
iteration:
(1.3)
where denotes the nearest point projection from onto C, is a parameter such that , and is the transpose of A.
When the system (1.2) is reduced to the unconstrained linear system
then the projected Landweber algorithm [4] is turned to the Landweber algorithm:
The simultaneous algebraic reconstruction technique is a typical example of the Landweber algorithm (1.5) when the system (1.4) is finite-dimensional.
The first iterative algorithm for solving the split feasibility problem (1.1) in the finite-dimensional case is proposed by Censor and Elfving [1] who define a sequence by the recursion:
where C and Q are closed convex sets of , and A is an matrix of full rank. Here is the image of C under the matrix A.
Because of the presence of the inverse , the algorithm (1.6) has not become popular. A more popular algorithm that solves the split feasibility problem (1.1) is the so-called CQ algorithm introduced by Byrne [2]. This algorithm, which does not involve , generates a sequence as follows:
where and denotes the nearest point projection from onto Q. Consequently, Xu [5] extend the above results from the finite-dimensional spaces to the infinite-dimensional spaces.
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 [6] the split common fixed point problem. More precisely, the split common fixed point problem requires one to seek an element satisfying
where and denote the fixed point sets of two classes of nonlinear operators and . In this situation, Byrne’s CQ algorithm does not work because the metric projection onto fixed point sets is generally not easy to calculate. To solve the two-set split common fixed point problem, motivated by the algorithms (1.3) and (1.7), Censor and Segal [6] proposed the following iterative method: For any initial guess , define recursively by
where U and T are directed operators and is known as the step-size. They proved that if , then (1.9) converges to a split common fixed point . Consequently, Moudafi [7] extended (1.9) to the following relaxed algorithm:
where U and T are demicontractive operators, , with λ being the spectral radius of the operator and 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 quasi-pseudocontractions because the class of quasi-pseudocontractions 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 and norm , respectively. Let C be a nonempty closed convex subset of H.
Recall that a mapping is called
-
nonexpansive if for all ;
-
quasi-nonexpansive if for all and ;
-
firmly nonexpansive if for all ;
-
firmly quasi-nonexpansive if for all and ;
-
strictly pseudocontractive if for all , where ;
-
directed if for all and ;
-
demicontractive if for all and , where .
The concept of directed operators was introduced by Bauschke and Combettes [28] who proved that is directed if and only if
for all and . It can be seen easily that the class of directed operators coincides with that of firmly quasi-nonexpansive mappings.
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 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.
Recall also that a mapping is called pseudocontractive if
for all . It is well known that T is pseudocontractive if and only if
for all and is said to be quasi-pseudocontractive if
for all and .
It is obvious that the class of quasi-pseudocontractive mappings includes the class of demicontractive mappings.
A mapping is called L-Lipschitzian if there exists such that
for all .
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 which weakly converges to , and if the sequence strongly converges to z, we have .
Observe also that the nonexpansive operators are both quasi-nonexpansive 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])
Let H be a real Hilbert space, C a closed convex subset of H. Let be a continuous pseudocontractive mapping. Then
-
(i)
is a closed convex subset of C,
-
(ii)
is demiclosed at zero.
In the next section, we will need to impose the demiclosedness to the quasi-pseudocontractions.
It is well known that in a real Hilbert space H, the following equality holds:
for all and .
Lemma 2.2 ([28])
Let H be a Hilbert space and let be a sequence in H such that there exists a nonempty set satisfying the following:
-
(i)
for every , exists,
-
(ii)
any weak-cluster point of the sequence belongs in Ω.
Then there exists such that weakly converges to .
In the sequel we shall use the following notations:
-
1.
denote the weak ω-limit set of ;
-
2.
stands for the weak convergence of to x;
-
3.
stands for the strong convergence of to x.
3 Main results
In this section, we will focus our attention on the following general two-operator split common fixed point problem:
where is a bounded linear operator, is a quasi-pseudocontractive mapping and is a quasi-pseudocontractive mapping with nonempty fixed point sets and , and we denote the solution set of the two-operator split common fixed point problem by
Algorithm 3.1 For , define a sequence as follows:
for all , where γ, ν, η, and β are four constants, , , and are three sequences in .
Now, we demonstrate the convergence analysis of the algorithm (3.1).
Theorem 3.2 Let and be two real Hilbert spaces. Let be a bounded linear operator. Let and be two L-Lipschitzian quasi-pseudocontractions with nonempty and . Assume and are demiclosed at 0 and . If the parameters γ, ν, η, β, , , and satisfy the following control conditions:
(C1): and , where λ is the spectral radius of the operator ;
(C2): ;
(C3): and for all .
Then the sequence generated by algorithm (3.2) weakly converges to a split common fixed point .
Remark 3.3 Without loss of generality, we may assume that the Lipschitz constant . It is obvious that for all .
Since , we have
for all .
Proposition 3.4 Let the mapping be L-Lipschitzian with . Then
for all .
Proof As a matter of fact, is obvious.
Next, we show that .
Take any . We have . Set . We have . Write . Then . Now we show . In fact,
Since , we deduce . Thus, . Hence, . Therefore, . □
Proposition 3.5
for all and all .
Proof Since , we have from (2.1)
and
for all .
By (3.3), (2.2), and (3.4), we obtain
Noting that T is L-Lipschitzian and , we have
Since , we have
From (3.5), we can deduce
for all and .
Hence,
By (C3) and (3.7), we deduce
 □
Proposition 3.6 Let the mapping be L-Lipschitzian with . If is demiclosed at 0, then is also demiclosed at 0 when .
Proof Let the sequence satisfying and . Next, we will show that .
From Proposition 3.4, we only need to prove that . As a matter of fact, since T is L-Lipschitzian, we have
It follows that
Hence,
Applying the demiclosedness of T, we immediately deduce . □
Next, we prove Theorem 3.2.
Proof Let . Then we get and . From (2.2) and (3.2), we have
Since , we have from (2.1)
for all .
By a similar argument to that of (3.6), we obtain
Substituting (3.10) to (3.8) and noting that , we have
Since λ is the spectral radius of the operator , we deduce
This together with (3.2) implies that
By Proposition 3.5 and noting that , we have
At the same time, we have the following equality in Hilbert spaces:
In (3.13), picking up and we deduce
It follows that
Thus,
From (3.11), (3.12), and (3.14), we get
We deduce immediately that
Hence, exists. This implies that is bounded. Consequently, we have
Therefore,
Since is bounded, . We can take , that is, there exists such that . Since is demiclosed at 0, by Proposition 3.6, we see that is also demiclosed at 0. Then, from (3.16), we obtain
Thus, .
From (3.15), we deduce
This together with (C2) implies that
Noticing that , we get immediately
Since U is L-Lipschitzian, we have
It follows that
Since , we deduce
From (3.2) and (3.16), we have . Thus, . By the demiclosedness of at 0 and (3.17), we get . Hence, . Therefore, .
Note that there is no more than one weak-cluster point of . In fact, if we assume there exists another such that , then we can deduce . Now we show . By the Opial property of Hilbert space, we have
This is a contradiction. Hence, the weak convergence of the whole sequence follows by applying Lemma 2.2 with . This completes the proof. □
Remark 3.7 Since the class of quasi-pseudocontractions contains the demicontractive operators, the directed operators, the quasi-nonexpansive 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 and be two real Hilbert spaces. Let be a bounded linear operator. Let and be two L-Lipschitzian demicontractive mappings with nonempty and . Assume and are demiclosed at 0 and . If the parameters γ, ν, η, β, , and satisfy the following control conditions:
(C1): and , where λ is the spectral radius of the operator ;
(C2): ;
(C3): and for all .
Then the sequence generated by algorithm (3.2) weakly converges to a split common fixed point .
References
Censor Y, Elfving T: A multiprojection algorithm using Bregman projections in a product space. Numer. Algorithms 1994, 8: 221–239. 10.1007/BF02142692
Byrne C: Iterative oblique projection onto convex subsets and the split feasibility problem. Inverse Probl. 2002, 18: 441–453. 10.1088/0266-5611/18/2/310
Eicke B: Iteration methods for convexly constrained ill-posed problems in Hilbert spaces. Numer. Funct. Anal. Optim. 1992, 13: 413–429. 10.1080/01630569208816489
Landweber L: An iterative formula for Fredholm integral equations of the first kind. Am. J. Math. 1951, 73: 615–624. 10.2307/2372313
Xu HK: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces. Inverse Probl. 2010., 26: Article ID 105018
Censor Y, Segal A: The split common fixed point problem for directed operators. J. Convex Anal. 2009, 16: 587–600.
Moudafi A: A note on the split common fixed-point problem for quasi-nonexpansive operators. Nonlinear Anal. 2011, 74: 4083–4087. 10.1016/j.na.2011.03.041
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.074
Ceng LC, Ansari QH, Yao JC: Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem. Nonlinear Anal. 2012, 75: 2116–2125. 10.1016/j.na.2011.10.012
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 43
Dang Y, Gao Y: The strong convergence of a KM-CQ-like algorithm for a split feasibility problem. Inverse Probl. 2011., 27: Article ID 015007
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 102085
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.044
Yang Q: The relaxed CQ algorithm solving the split feasibility problem. Inverse Probl. 2004, 20: 1261–1266. 10.1088/0266-5611/20/4/014
Yao Y, Wu J, Liou YC: Regularized methods for the split feasibility problem. Abstr. Appl. Anal. 2012., 2012: Article ID 140679
Yu X, Shahzad N, Yao Y: Implicit and explicit algorithms for solving the split feasibility problem. Optim. Lett. 2012, 6: 1447–1462. 10.1007/s11590-011-0340-0
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.
Zhao J, Yang Q: Several solution methods for the split feasibility problem. Inverse Probl. 2005, 21: 1791–1799. 10.1088/0266-5611/21/5/017
He ZH, Du WS: On hybrid split problem and its nonlinear algorithms. Fixed Point Theory Appl. 2013., 2013: Article ID 47
He ZH, Du WS: Nonlinear algorithms approach to split common solution problems. Fixed Point Theory Appl. 2012., 2012: Article ID 130
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 385638
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 11
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/1029-242X-2013-123
Yao Y, Postolache M, Liou YC: Strong convergence of a self-adaptive method for the split feasibility problem. Fixed Point Theory Appl. 2013., 2013: Article ID 201
Zhao J, He S: Alternating Mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings. Fixed Point Theory Appl. 2013., 2013: Article ID 288
Deepho J, Kumam P: Mann’s type extragradient for solving split feasibility and fixed point problems of Lipschitz asymptotically quasi-nonexpansive mappings. Fixed Point Theory Appl. 2013., 2013: Article ID 349
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.
Bauschke HH, Combettes PL: A weak-to-strong convergence principle for Feje-monotone methods in Hilbert spaces. Math. Oper. Res. 2001, 26: 248–264. 10.1287/moor.26.2.248.10558
Maruster S, Popirlan C: On the Mann-type iteration and convex feasibility problem. J. Comput. Appl. Math. 2008, 212: 390–396. 10.1016/j.cam.2006.12.012
Zhou H: Strong convergence of an explicit iterative algorithm for continuous pseudo-contractions in Banach spaces. Nonlinear Anal. 2009, 70: 4039–4046. 10.1016/j.na.2008.08.012
Acknowledgements
Li-Jun Zhu was supported in part by NNSF of China (61362033). Yeong-Cheng Liou was supported in part by the Grants NSC 101-2628-E-230-001-MY3 and NSC 103-2923-E-037-001-MY3. Jen-Chih Yao was partially supported by the Grant NSC 103-2923-E-037-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 read and approved the final manuscript.
Rights and permissions
Open Access  This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.
The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
To view a copy of this licence, visit https://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Zhu, LJ., Liou, YC., Yao, JC. et al. New algorithms designed for the split common fixed point problem of quasi-pseudocontractions. J Inequal Appl 2014, 304 (2014). https://doi.org/10.1186/1029-242X-2014-304
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2014-304
Keywords
- split common fixed point
- quasi-pseudocontractive mappings
- weak convergence