Mathematical Problems in Engineering

Volume 2013, Article ID 638468, 5 pages

http://dx.doi.org/10.1155/2013/638468

## Weak and Strong Convergence of an Algorithm for the Split Common Fixed-Point of Asymptotically Quasi-Nonexpansive Operators

^{1}School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China^{2}Henan Polytechnic University, Jiaozuo 454000, China

Received 28 June 2013; Revised 10 October 2013; Accepted 24 October 2013

Academic Editor: Joao B. R. Do Val

Copyright © 2013 Yazheng Dang and Yan Gao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Inspired by the Moudafi (2010), we propose an algorithm for solving the split common fixed-point problem for a wide class of asymptotically quasi-nonexpansive operators and the weak and strong convergence of the algorithm are shown under some suitable conditions in Hilbert spaces. The algorithm and its convergence results improve and develop previous results for split feasibility problems.

#### 1. Introduction

Fixed-point problem is a classical problem in nonlinear analysis and it has application in a wide spectrum of fields such as economics, physics, and applied sciences. In this paper, We are concerned with the split common fixed point problem (SCFP). In fact, the SCFP is an extension of the split feasibility problem (SFP) and the convex feasibility problem (CFP), see [1]. The CFP and SCFP have many applications such as approximation theory [2], image reconstruction, radiation therapy [3, 4], and control [5]. The SFP in finite-dimensional space was first introduced by Censor and Elfving [6] for modeling inverse problems, which arise from phase retrievals, and in medical image reconstruction [7]. Recently, it has been found that the SFP can also be used in various disciplines such as image restoration, computer tomograph, and radiation therapy treatment planning [8, 9]. The SFP in an infinite-dimensional Hilbert space can be found in [10–13].

Throughout this paper, we assume that both and are real Hilbert spaces, “” and “” denote strong and weak convergence, respectively, denotes the set of the fixed points of an operator , that is, and . Let and be two asymptotically quasi-nonexpansive mappings with nonempty fixed-point sets and , respectively. The split common fixed point problem for operators and is to find where is bounded linear. Denote the solution set of the two-operator SCFP by

The split common fixed point problem for quasi-nonexpansive mapping in the setting of Hilbert space was first introduced and studied by Moudafi [14]. However, the algorithm presented in [14] has only weak convergence. The purpose of this paper is to propose an algorithm of split common fixed point problem for asymptotically quasi-nonexpanding operator which includes the quasi-nonexpansive mapping and the weak and strong convergence of the algorithm are shown under some suitable conditions in Hilbert spaces. The algorithm and the convergence results improve and develop previously discussed split feasibility problems.

The paper is organized as follows. In Section 2, we recall some preliminaries. In Section 3, we present an algorithm and show its weak convergence and strong convergence. Section 4 gives some concluding remarks.

#### 2. Preliminaries

Recall that a mapping is said to be nonexpansive if

A mapping is called asymptotically nonexpansive if there exists a sequence with as such that, for all ,

A mapping is called quasi-nonexpansive if for all

A mapping is called asymptotically quasi-nonexpansive if there exists a sequence with as such that, for all ,

A mapping is said to be uniformly -Lipschitzian if there exists a constant such that for all ,

A mapping is said to be semicompact if for any bounded sequence with there exists a subsequence of such that converges strongly to a point .

Let be a Banach space. A mapping is said to be demiclosed at origin, if for any sequence with and , .

Lemma 1. *Let be asymptotically quasi-nonexpansive and set for . Then, for any and , one has the following.*(1)*;
*(2)*;
*(3)*;*(4)*. *

Lemma 2 (see [15]). *Suppose is a sequence of nonnegative real numbers such that
**
if and. Then, exists. In particular, if has a subsequence which converges strongly to zero, then .*

#### 3. The Algorithm and Its Asymptotic Convergence

We now give a description of an algorithm.

*Algorithm 3. *Initialization: let be arbitrary.

Iterative step: for , set , let
where , and .

In what follows, we establish the weak convergence and strong convergence of Algorithm 3.

Lemma 4 (Opial [16]). *Let be a Hilbert space and let be a sequence in such that there exists a nonempty set satisfying the following:*(1)*For every , exists.*(2)*Any weak cluster point of the sequence belongs to .**
Then, there exists such that weakly converges to .*

Theorem 5. *Let and be two asymptotically quasi-nonexpansive operators with nonempty and . Assume that and are demiclosed at and , , and and are uniformly Lipschitzian. Then,*(I)*any sequence generated by Algorithm 3 converges weakly to a point ;*(II)*if is also semi-compact, then both and generated by Algorithm 3 converge strongly to a point .*

*Proof. *First, we prove that for each , and exist. Also and .

By using (1) in Lemma 1, from (9) we obtain
By deducing, it follows that
that is,
Setting and using (1) of Lemma 1, we obtain
The key inequality mentioned above, combined with (12), yields
Substituting (14) into (10) yields
where . Since , we have , From Lemma 1, it follows that exists. By the virtue of (14), we know that exists. Therefore, from (15), we have
By the assumptions on and , we get
*Step 1*. Now, we prove that and . As a matter of a fact, it follows from (9) that
In view of (17), we have that
Similarly, it follows from (9), (17), and (19) that
*Step 2*. We prove that and . Setting , since is uniformly -Lipschitzian continuous, it follows from (14) and (17) that
in other words,
Similarly, we have
*Step 3*. Finally, we prove that and , where . Denote by a weak-cluster point of , and denote by a subsequence of . Obviously,
Then, from (23) and the demiclosedness of at , we obtain

it follows that, .

Noticing , it follows that . By the demiclosedness of at , we have
Hence, , and therefore .

Since there is no more than one weak cluster point, the weak convergence of the whole sequence follows by applying Lemma 4 with .*The Proof of Conclusion (II)*. Since is semi-compact, it follows from (22) that there exists a subsequence of such that (some point in ). Since , this implies that . Therefore, as . Since for any and exist, we know that . This implies that and both converge strongly to a point . The proof is completed.

#### 4. Concluding Remarks

In this paper, we have proposed an algorithm for solving the SCFP in the wide class of asymptotically quasi-nonexpansive operators and obtained its weak and strong convergence in general Hilbert spaces in a new way. Next, we will improve the algorithm to solve the multiple split common fixed point problem in infinite Hilbert spaces.

#### Acknowledgments

This work was supported by the National Science Foundation of China (under Grant 11171221), Shanghai Leading Academic Discipline Project (under Grant XTKX2012), Basic and Frontier Research Program of Science and Technology Department of Henan Province (under Grant 112300410277), Innovation Program of Shanghai Municipal Education Commission (under Grant 14YZ094), Doctoral Program Foundation of Institutions of Higher Education of China (under Grant 20123120110004), Doctoral Starting Projection of the University of Shanghai for Science and Technology (under Grant ID-10-303-002), and Young Teacher Training Projection Program of Shanghai for Science and Technology.

#### References

- C. Byrne, “Iterative oblique projection onto convex sets and the split feasibility problem,”
*Inverse Problems*, vol. 18, no. 2, pp. 441–453, 2002. View at Publisher · View at Google Scholar · View at MathSciNet - F. Deutsch, “The method of alternating orthogonal projections,” in
*Approximation Theory, Spline Functions and Applications*, vol. 356, pp. 105–121, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1992. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Censor, “Parallel application of block-iterative methods in medical imaging and radiation therapy,”
*Mathematical Programming*, vol. 42, no. 2, pp. 307–325, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. T. Herman,
*Image Reconstruction from Projections: The Fundamentals of Computerized Tomography*, Academic Press, New York, NY, USA, 1980. View at MathSciNet - Y. Gao, “Determining the viability for a affine nonlinear control system,”
*Control Theory and Applications*, vol. 26, no. 6, pp. 654–656, 2009 (Chinese). View at Google Scholar · View at Scopus - Y. Censor and T. Elfving, “A multiprojection algorithm using Bregman projections in a product space,”
*Numerical Algorithms*, vol. 8, no. 2–4, pp. 221–239, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Censor, T. Elfving, N. Kopt, and T. Bortfeld, “The multiple-sets split feasibility problem and its applications,”
*Inverse Problems*, vol. 21, no. 6, pp. 2071–2084, 2005. View at Publisher · View at Google Scholar - Y. Censor, T. Bortfeld, B. Martin, and A. Trofimov, “A unified approach for inversion problems in intensity-modulated radiation therapy,”
*Physics in Medicine and Biology*, vol. 51, no. 10, pp. 2353–2365, 2006. View at Publisher · View at Google Scholar · View at Scopus - C. Byrne, “A unified treatment of some iterative algorithms in signal processing and image reconstruction,”
*Inverse Problems*, vol. 20, no. 1, pp. 103–120, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Dang and Y. Gao, “The strong convergence of a KM-CQ-like algorithm for a split feasibility problem,”
*Inverse Problems*, vol. 27, no. 1, Article ID 015007, 9 pages, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. K. Xu, “A variable Krasnosel'skii-Mann algorithm and the multiple-set split feasibility problem,”
*Inverse Problems*, vol. 22, no. 6, pp. 2021–2034, 2006. View at Publisher · View at Google Scholar · View at MathSciNet - Q. Yang, “The relaxed CQ algorithm solving the split feasibility problem,”
*Inverse Problems*, vol. 20, no. 4, pp. 1261–1266, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - J. Zhao and Q. Yang, “Several solution methods for the split feasibility problem,”
*Inverse Problems*, vol. 21, no. 5, pp. 1791–1799, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Moudafi, “The split common fixed-point problem for demicontractive mappings,”
*Inverse Problems*, vol. 26, no. 5, Article ID 055007, 6 pages, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - G. Crombez, “A geometrical look at iterative methods for operators with fixed points,”
*Numerical Functional Analysis and Optimization*, vol. 26, no. 2, pp. 157–175, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Z. Opial, “Weak convergence of the sequence of successive approximations for nonexpansive mappings,”
*Bulletin of the American Mathematical Society*, vol. 73, pp. 591–597, 1967. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet