`Journal of Function Spaces and ApplicationsVolume 2013 (2013), Article ID 151906, 7 pageshttp://dx.doi.org/10.1155/2013/151906`
Research Article

## Strong Convergence Theorems for Variational Inequalities and Split Equality Problem

1Tianjin Vocational Institute, Tianjin 300410, China
2Department of Mathematics, Tianjin Polytechnic University, Tianjin 300387, China

Received 5 July 2013; Revised 22 August 2013; Accepted 2 September 2013

Copyright © 2013 Yu Jing Wu et al. 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

Let and be real Hilbert spaces, let be two nonempty closed convex sets, and let be two bounded linear operators. The split equality problem (SEP) is to find such that . Let ; consider a contraction with coefficient , a strongly positive linear bounded operator with coefficient , and is a -inverse strongly monotone mapping. Let , and be defined by restricting to is and restricting to is , that is, has the matrix form . It is proved that the sequence generated by the iterative method converges strongly to which solves the SEP and the following variational inequality: and for all . Moreover, if we take , then is a -inverse strongly monotone mapping, and the sequence generated by the iterative method converges strongly to which solves the SEP and the following variational inequality: for all .

#### 1. Introduction and Preliminaries

Throughout this paper, let be a real Hilbert space and a nonempty closed convex subset of , and let denote the identity operator on Hilbert space , the set of the fixed points of an operator . An operator on a Hilbert space is nonexpansive if, for each and in , . is said to be strongly positive, if there exists such that for all . is said to be inverse strongly monotone if there exists such that for all . A bounded linear operator on a Hilbert space is positive operator if and for all in the spectrum of or equivalent to for all .

Let denote the projection from onto a nonempty closed convex subset of ; that is, It is well known that is characterized by the inequality and is nonexpansive.

Let and be nonempty closed convex subsets of real Hilbert spaces and , respectively, and let be a bounded linear operator. The split feasibility problem (SFP) is to find a point satisfying the property The SFP was first introduced by Censor and Elfving [1], which attracts many authors’ attention due to its application in signal processing [1]. Various algorithms have been invented to solve it (see [27]).

Recently, Moudafi [8] proposes a new split equality problem (SEP): let , , and be real Hilbert spaces, let , be two nonempty closed convex sets, and let , be two bounded linear operators. Find , satisfying When , SEP reduces to the well-known SFP. In the paper [8], Moudafi gives the alternating CQ-algorithm and relaxed alternating CQ-algorithm iterative algorithm to solve the split equality problem. We must point out that the above algorithms converge weakly to a solution of the SEP.

We use to denote the solution set of SEP, and letting in define by , then has the matrix form The original problem can now be reformulated as finding with or, more generally, minimizing the function over . Therefore solving SEP (4) is equivalent to solving the following minimization problem: In the paper [9], we use the well-known Tychonov regularization to get some algorithms converge strongly to the minimum-norm solution of the SEP. Moreover, in the paper [9], we obtain that, for , . That is to say, the set of the solution of SEP is equal to the fixed points set of the nonexpansive mapping .

Recall that the variational inequality problem is to find such that , for all , where is closed, convex, and nonempty, and is a mapping on . The set of solutions of the variational inequality is denoted by . In the paper [9], we also get that if and only if is a solution of the variational inequality , for all .

In this paper, we consider a contraction on with coefficient , a strongly positive linear bounded operator with coefficient , and is a -inverse strongly monotone mapping. Let , . We prove that the sequence generated by the iterative method converges strongly to which solves the SEP and the following variational inequality: and for all under some mild conditions for , , and .

We now collect some elementary facts which will be used in the proofs of our main results.

Lemma 1. Assuming is a positive operator, then is -inverse strongly monotone.

Proof. Since is a positive operator on , by the functional calculus of positive operator (for more details see [10, Chapter 4]), there exists positive operator such that and .
Hence, for any , . It follows that . That is to say, is -inverse strongly monotone.

Lemma 2 (see [11, 12]). Let be a Banach space, a closed convex subset of , and a nonexpansive mapping with . If is a sequence in weakly converging to and if converges strongly to , then .

Lemma 3 (see [13]). Let be a sequence of nonnegative real numbers, a sequence of real numbers in with , a sequence of nonnegative real numbers with , and a sequence of real numbers with . Suppose that Then .

Lemma 4 (see [14]). Assuming is a strongly positive linear bounded operator on a Hilbert space with coefficient , then for .

Lemma 5 (see [13]). Let be a nonempty and closed subset of a Banach space , and let be a family of mappings of into itself which satisfies the condition: for each bounded subset of , Then, for each , converges strongly to a point in . Moreover, is defined by Then, for each bounded subset of , and , if .

#### 2. Main Results

Theorem 6. Let denote the solutions set of the SEP, , a contraction on with coefficient , a strongly positive linear bounded operator with coefficient , and a -inverse strongly monotone mapping. Assume that , , and is the sequence generated by the following algorithm: , for all , where , and . If , , and are chosen such that for some with and(i),(ii), (iii),(v)(iv)then the sequence converges strongly to which solves the SEP and the following variational inequality: and for all .

Proof. First, we show that the sequence is bounded. Consider the mapping . Since is a -inverse strongly monotone mapping, we have that, for all , Since , we deduce that . That is to say, is nonexpansive.
Letting , , choosing , then and . is nonexpansive, which implies that Since is strongly positive linear bounded operator, is nonexpansive, and is contraction, we have It follows from induction that Hence, is bounded, so are , , , and .
Next, we show that and . In fact, in view that and are nonexpansive, we can get that Hence, Based on we deduce that By Lemma 3, we have On the other hand, since and we have Therefore, we have Since , , we can get that Furthermore, by the property of the projection , we have Then, we have which yields that Since , , and , we can get that Next, since we can get that Hence,
Let the mapping be defined by By Lemma 5 we can get that and Note that it is easy to check that is a contraction; by Banach contraction mapping principle, has a unique fixed point . By the property of the projection , we can get that Choose a subsequence of such that Since is bounded, there exists a subsequence of which converges weakly . Without loss of generality, we may assume that converges weakly . Note that, by , we can get converges weakly . Furthermore, ; by Lemmas 2 and 5, we obtain that .
Next we will prove that .
Choose , and let . Since , we can get . On the other hand, by the property of the projection and , we have It follows that Since and converges weakly , we can get that .
Note that is a -inverse strongly monotone mapping, and if , then for all . Hence, we can choose such that . By we can get that Hence It follows that . We obtain that and , for all .
Finally, we prove that . Since , we have Since , , , and , using Lemma 3, we can conclude that which completes the proof.

By Lemma 1, we know that is -inverse strongly monotone. Hence, letting , we can get the following Corollary.

Corollary 7. Let denote the solutions set of the SEP, , a contraction on with coefficient , a strongly positive linear bounded operator with coefficient . Assume that , , and is the sequence generated by the following algorithm: , for all , where , . If , , and are chosen so that for some with and(i),(ii)(iii)(v)(iv)then the sequence converges strongly to which solves the SEP and the following variational inequality: for all .

Furthermore, if and , changed slightly for Theorem 6, we get the following result.

Corollary 8. Let denote the solutions set of the SEP, , a contraction on with coefficient , a strongly positive linear bounded operator with coefficient . Assume that , , and is the sequence generated by the following algorithm: , for all , where , . If , are chosen so that for some with and(i),(ii)(iii)(v)then the sequence converges strongly to which solves the SEP and the following variational inequality: for all .

#### Acknowledgments

This research was supported by NSFC Grants nos. 11071279, 11226125, and 11301379.

#### References

1. 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.
2. C. Byrne, “Iterative oblique projection onto convex sets and the split feasibility problem,” Inverse Problems, vol. 18, no. 2, pp. 441–453, 2002.
3. 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.
4. B. Qu and N. Xiu, “A note on the CQ algorithm for the split feasibility problem,” Inverse Problems, vol. 21, no. 5, pp. 1655–1665, 2005.
5. 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.
6. Q. Yang, “The relaxed CQ algorithm solving the split feasibility problem,” Inverse Problems, vol. 20, no. 4, pp. 1261–1266, 2004.
7. Q. Yang and J. Zhao, “Generalized KM theorems and their applications,” Inverse Problems, vol. 22, no. 3, pp. 833–844, 2006.
8. A. Moudafi, “A relaxed alternating CQ-algorithm for convex feasibility problems,” Nonlinear Analysis: Theory, Methods & Applications, vol. 79, pp. 117–121, 2013.
9. L. Y. Shi, R. D. Chen, and Y. J. Wu, “Strong convergence of iterative algorithms for the split equality problem,” Inverse Problems. In press.
10. G. Ronald, Banach Algebra Techniques in Operator Theory, Springer, New York, NY, USA, 1972.
11. K. Goebel and W. A. Kirk, Topics in Metric Fixed Point Theory, vol. 28 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, Mass, USA, 1990.
12. K. Geobel and S. Reich, Uniform Convexity, Nonexpansive Mappings, and Hyperbolic Geometry, Dekker, New York, NY, USA, 1984.
13. K. Aoyama, Y. Kimura, W. Takahashi, and M. Toyoda, “Approximation of common fixed points of a countable family of nonexpansive mappings in a Banach space,” Nonlinear Analysis: Theory, Methods & Applications, vol. 67, no. 8, pp. 2350–2360, 2007.
14. G. Marino and H.-K. Xu, “A general iterative method for nonexpansive mappings in Hilbert spaces,” Journal of Mathematical Analysis and Applications, vol. 318, no. 1, pp. 43–52, 2006.