Abstract and Applied Analysis

Volume 2013 (2013), Article ID 613928, 13 pages

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

Research Article

A Unified Iterative Treatment for Solutions of Problems of Split Feasibility and Equilibrium in Hilbert Spaces

Young-Ye Huang¹ and Chung-Chien Hong²

¹Department of Accounting Information, Southern Taiwan University of Science and Technology, 1 Nantai Street, Yongkang District, Tainan 71005, Taiwan

²Department of Industrial Management, National Pingtung University of Science and Technology, 1 Shuefu Road, Neipu, Pingtung 91201, Taiwan

Received 21 May 2013; Revised 30 August 2013; Accepted 1 September 2013

Academic Editor: Simeon Reich

Copyright © 2013 Young-Ye Huang and Chung-Chien Hong. 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.

We at first raise the so called split feasibility fixed point problem which covers the problems of split feasibility, convex feasibility, and equilibrium as special cases and then give two types of algorithms for finding solutions of this problem and establish the corresponding strong convergence theorems for the sequences generated by our algorithms. As a consequence, we apply them to study the split feasibility problem, the zero point problem of maximal monotone operators, and the equilibrium problem and to show that the unique minimum norm solutions of these problems can be obtained through our algorithms. Since the variational inequalities, convex differentiable optimization, and Nash equilibria in noncooperative games can be formulated as equilibrium problems, each type of our algorithms can be considered as a generalized methodology for solving the aforementioned problems.

1. Introduction

Throughout this paper, denotes a real Hilbert space with inner product and the norm , the identity mapping on , the set of all natural numbers, and the set of all real numbers. For a self-mapping on , denotes the set of all fixed points of . If is a set-valued mapping; then denotes its domain, that is, .

Let and be nonempty closed convex subsets of two Hilbert spaces and , respectively, and let be a bounded linear mapping. The split feasibility problem (SFP) is the problem of finding a point with the property

The SFP was first introduced by Censor and Elfving [1] for modeling inverse problems which arise from phase retrievals and medical image reconstruction. Recently, it has been found that the SFP can also be used to model the intensity-modulated radiation therapy. For details, the readers are referred to Xu [2] and the references therein.

Assume that the SFP has a solution. There are many iterative methods designed to approximate its solutions. The most popular algorithm is the algorithm introduced by Byrne [3, 4].

Start with any and generate a sequence through the iteration

where , the adjoint of , and and are the metric projections onto and , respectively.

The sequence generated by the algorithm (2) converges weakly to a solution of SFP(1), cf. [2–4]. Under the assumption that SFP(1) has a solution, it is known that a point solves SFP(1) if and only if is a fixed point of the operator

cf. [2], where Xu also proposed the regularized method,

and proved that the sequence converges strongly to the minimum norm solution of SFP(1) provided that the parameters and verify some suitable conditions. This regularized method was further investigated by Yao et al. [5] and Yao et al. [6].

Putting and , SFP(1) is of the forms:

As a metric projection is firmly nonexpansive, it is reasonable to require the and in (5) to be firmly nonexpansive only and call it a split feasibility fixed point problem (SFFP). Many interesting problems in the literature can be described as SFFP.

(i) A set-valued map is called monotone if

for all and for any , . is said to be maximal monotone if its graph is not properly contained in the graph of any other monotone operator. A point is called a zero point of a maximal monotone operator if . The set of all zero points of is denoted by , which is equal to for any , where denotes the resolvent of a monotone operator ; that is, for any . It is known that for any , is firmly nonexpansive. Now, let and be two maximal monotone operators on and , respectively. Replacing and with and , respectively, in (1), the SFP becomes a SFFP:

Putting , the previous SFFP is reduced to the common zero point problem of two maximal monotone operators:

(ii) Let . An equilibrium problem is the problem of finding such that

whose solution set is denoted by . For solving an equilibrium problem, we usually assume that the function satisfies the following conditions:

(A1)  ,  for all   ;(A2)    is monotone, that is,   ,  for all   ;(A3)  for all   ,   ;(A4) for all   is convex and lower semicontinuous.

Blum and Oettli [7] and Aoyama et al. [8] showed that there exists a unique such that

Moreover, For , define by

for all . Combettes and Hirstoaga [9] showed that there hold

(a)  is single-valued;(b)  is firmly nonexpansive;(c);(d)  is closed and convex.

Now, let and be two functions satisfying conditions (A1)–(A4). Replacing and with and , respectively, in (1), the SFP becomes a SFFP:

Putting , , and , the previous SFFP is reduced to the common equilibrium problem:

(iii) When , and the bounded linear operator is the identity mapping, SFP(1) is reduced to the convex feasibility problem (CFP):

which in turn can be described as a SFFP:

where and . Although SFFP(5) contains CFP as a special case, it cannot cover the multiple-set split convex feasibility problem described in [10].

In this paper, we are concerned with iterative methods for SFFP(5). We derive some weak convergence theorems for SFFP(5) in Section 3. In Section 4, we describe SFFP(5) in a more general form.

Let     and     be two families of firmly nonexpansive self-mappings on     and ,  respectively, so that     and  

and obtain the following main result.

Let   ,   ,   ,  and     be sequences in     with     and     for all   . Let be a sequence in and let be a bounded sequence in . Suppose that the solution set of  SFFP(16)  is nonempty. For any , start with an arbitrary and define a sequence by

Then, the sequence converges strongly to provided that the following conditions are satisfied:

(i),   ,   ;(ii),   ;(iii)there are two nonnegative real-valued functions    and     on     with

Based on the concept of using contractions to approximate nonexpansive mappings, another type of algorithms for SFFP(5) is also introduced, and the corresponding strong convergence theorem for the sequence generated by such algorithm is given too.

In Section 5, since resolvents of monotone operators are firmly nonexpansive, we replace the sequences and of firmly nonexpansive mappings in the previous condition (iii) by two sequences of resolvents of maximal monotone operators. Then, the proposed algorithm becomes a scheme to approach the minimum norm solution of zero point problem of maximal monotone operators and the equilibrium problem. It is worth noting that as Blum and Oettli [7] showed that the variational inequalities, convex differentiable optimization, and Nash equilibria in noncooperative games can be formulated as equilibrium problems, the proposed algorithm can be considered as a generalized methodology for solving all aforementioned problems.

2. Preliminaries

In order to facilitate our investigation in this paper, we recall some basic facts. A mapping is said to be

(i)nonexpansive if

(ii)firmly nonexpansive if

(iii)-averaged by if

for some and some nonexpansive mapping ;(iv)-inverse strongly monotone (-ism), with , if

If is nonexpansive, then the fixed point set of is closed and convex, cf. [11]. If is averaged, then is nonexpansive with . It is well known that is firmly nonexpansive if and only if it is -averaged, cf. [11], and so is . Here we would like to mention that the term “averaged mapping” originated in [12, 13]. In [12], Baillon el at. showed that if is a -averaged mapping by on a nonempty closed convex subset of a uniformly convex Banach space, then if and only if for all in . Moreover, in [13], Bruck and Reich showed that if the above satisfies and is odd, then converges strongly to a fixed point of .

Let be a nonempty closed convex subset of . The metric projection from onto is the mapping that assigns each the unique point in with the property

It is known that is firmly nonexpansive and characterized by the inequality: for any ,

We need some lemmas that will be quoted in the sequel.

Lemma 1 (see [4]). If is a self-mapping on , then the following assertions hold.

(a) is nonexpansive if and only if the complement is -averaged.(b)If is -ism and , then is ()-ism.(c) is -averaged if and only if is ()-ism.(d)If is -averaged and is -averaged, then the composite is -averaged.(e)If and are averaged on so that , then

For , the resolvent of a maximal monotone operator on has the following properties.

Lemma 2. Let be a maximal monotone operator on . Then,

(a) is single-valued and firmly nonexpansive;(b) and ;(c) (the resolvent identity) for , the following identity holds:

We referred readers to [14–24] for maximal monotone operators and their related algorithms.

Lemma 3. Let . Then,

(a);(b)for any ,

(c)for with ,

Lemma 4 (see [11] (demiclosedness principle)). Let be a nonexpansive self-mapping on and suppose that is a sequence in such that converges weakly to some and . Then, .

Lemma 5 (see [23]). Let be a sequence of nonnegative real numbers satisfying

where , , and verify the following conditions:

(i), ;(ii);(iii) and .

Then, .

Lemma 6 (see [25]). Let be a sequence in that does not decrease at infinity in the sense that there exists a subsequence such that

For any , define . Then, as and , for all .

3. Weak Convergence Theorems

In this section, we at first transform SFFP(5) into a fixed point problem for the operator , where is any positive real number. And then use fixed point algorithms to solve SFFP(5). From now on until the end of this paper, unless we state specifically, and , (resp., and , ) are firmly nonexpansive self-mappings on (resp., ), and denotes a bounded linear operator from into with adjoint .

Lemma 7. Let be a firmly nonexpansive self-mapping on with . Then, for any , one has

Proof. Since and is firmly nonexpansive, we have

and hence,

Although , for all is similar to the characterization inequality (24) for the metric projection , as needs not to be in , it is in general different from . For example, let for all , which is obviously firmly nonexpansive with . Thus, for all , while for all .

Proposition 8. For any , the operator is -averaged and is -averaged.

Proof. Using the fact that is firmly nonexpansive, it is routine to show that is -ism, and so is -ism by Lemma 1(b). Thus, Lemma 1(c) shows that is -averaged. As is firmly nonexpansive, it is -averaged. Therefore, is -averaged by Lemma 1(d).

Proposition 9. Let be the solution set of SFFP(5); that is, . For any , let . Suppose that . Then, .

Proof. If solves SFFP(5), we have and . Now, note that implies

and so

which means that . Consequently, . This shows that .

For the inverse inclusion, let be any member of and pick . It is readily seen from that

Since , an application of Lemma 7 yields

which together with (36) implies that

This comes to conclude that , and hence once we note that . Finally, since by assumption, we have . Thus, follows from Lemma 1(e).

Proposition 10 (see [2, 4]). If is an averaged self-mapping on with , then for any , the sequence converges weakly to a fixed point of .

An immediate consequence of Propositions 8, 9, and 10 is the following convergence result.

Theorem 11. Assume that SFFP(5) has a solution. Then, for any and starting with any point , the sequence generated by

converges weakly to a solution of SFFP(5).

Proposition 12 (see [2]). Let be a -averaged self-mapping on with and assume that is a sequence in such that

Then, for any , the sequence generated by the Mann's algorithm

converges weakly to a fixed point of .

Applying Propositions 8, 9, and 12, we have the following result.

Theorem 13. Assume that SFFP(5) has a solution and . Let be a sequence in with

Then, for any , the sequence generated by the Mann's algorithm

converges weakly to a solution of SFFP(5).

4. Strong Convergence Theorems

In this section, we devise two algorithms, one for SFFP(16) and the other for SFFP(5). We deal with SFFP(16) firstly. To begin with, we need a lemma.

Lemma 14. For any and all , one has

Proof. Since is firmly nonexpansive, so is . Hence, for all , we have

Consequently,

Theorem 15. Let , , , and be sequences in with and for all . Let be a sequence in and let be a bounded sequence in . Suppose that the solution set of SFFP(16) is nonempty. For any , start with any and define a sequence by

Then the sequence converges strongly to provided that the following conditions are satisfied:

(i),   ,   ;(ii),   ;(iii)there are two nonnegative real-valued functions and on with

Proof. Put . For simplicity, put . In view of Proposition 9, is nonexpansive, so

from which follows that is a bounded sequence. Taking into account Lemma 3, we get

Meanwhile, we have by Lemma 14 that

Therefore, we deduce that

We now carry on with the proof by considering the following two cases: (I) is eventually decreasing and (II) is not eventually decreasing.

Case I. Suppose that is eventually decreasing; that is, there is such that is decreasing. In this case, exists in . From inequality (52) we have

which together with the boundedness of and conditions (i) and (ii) implies

Then, an application of condition (iii) follows that for all ,

Since is bounded, it has a subsequence such that converges weakly to some and

where the last inequality follows from (24) since by Lemma 4. Choose so that . From (52) we have

Accordingly, because of (56) and condition (i), we can apply Lemma 5 to inequality (57) with , , , and to conclude that

Case II. Suppose that is not eventually decreasing. In this case, by Lemma 6, there exists a nondecreasing sequence in such that and

Then, it follows from (52) and (59) that

Therefore,

and then proceeding just as in the proof in Case I, we obtain

which in conjunction with condition (iii) shows that for all

and then follows that

From (60) we have

and thus,

Letting and using (64) and condition (i), we obtain

Also, since

which together with (62) and condition (i) implies that , and so

by virtue of (67). Consequently, we conclude that via (59) and (69). This completes the proof.

This theorem says that the sequence converges strongly to a point of which is the nearest to . In particular, if is taken to be , then the limit point of the sequence is the unique minimum solution of SFFP(16).

Corollary 16. Let , , and be sequences in with and for all . Let be a sequence in and let be a bounded sequence in . Suppose that the solution set of SFFP(16) is nonempty. For any , start with any and define a sequence by

Then, the sequence converges strongly to provided that the following conditions are satisfied:

(i),   ,   ;(ii),   ;(iii)there are two nonnegative real-valued functions and on with

(iv)either or .

Proof. Put and . Let and define a sequence iteratively by

We have by Theorem 15. Since

the limit follows by applying Lemma 5 to (74), and thus,

If the sequence (resp., ) of firmly nonexpansive mappings consists of a single mapping (resp., ), then and obviously verify condition (iii), and hence, we have the following corollary.

Corollary 17. Let , , , and be sequences in with and for all . Let be a sequence in and let be a bounded sequences in . Assume that the solution set of SFFP(5) is nonempty. For any , start with an arbitrary and define the sequence by

Then, converges strongly to provided that the following conditions are satisfied:

(i),   ,   ;(ii),   .

When the sequence is taken to be a constant , then because is an averaged mapping, we can apply Corollary 3.4 of Huang and Hong [26] to obtain the following result.

Theorem 18. Let , , , and be sequences in with and for all . Suppose that and suppose that is a bounded sequence in . Assume that the solution set of SFFP(5) is nonempty. For any , start with an arbitrary and define the sequence by

Then, converges strongly to provided that the following conditions are satisfied:

(i),   ,   ;(ii),   .

Since both condition (ii) of Corollary 17 and Theorem 18 are equivalent provided that for every , Theorem 18 also follows from Corollary 17.

We now turn to SFFP(5) for another algorithm, which essentially follows the argument of Wang and Xu [27]. For the sake of completeness, we still give a detailed proof.

Theorem 19. Let be a sequence in . Suppose that and assume that the solution set of SFFP(5) is nonempty. Start with any and define a sequence by

Then, the sequence converges strongly to the minimum norm solution of SFFP(5) provided that the following conditions are satisfied:

(i);(ii);(iii)either    or   .

Proof. Put  , , and for all . Then,

Take . From Proposition 9, we have

Hence,

from which follows that is bounded and so is . Choose so that for all . We have

In view of conditions (i), (ii), and (iii), we can apply Lemma 5 to (82) to get

and then from

we see that

Consequently, the demiclosedness principle ensures that each weak limit point of is a fixed point of the averaged mapping . And then we conclude from Proposition 9 that each weak limit point of lies in .

Let be the minimum norm element of ; that is, . We shall show that converges strongly to . To see this, we compute as follows:

If , then an application of Lemma 5 to (86) yields that . Hence, to complete the proof, it suffices to show that . For this, taking into account Proposition 8, we can write for some and some nonexpansive mapping . Then, from

we obtain

which ensures that , and hence,

once we note that . Since is bounded, we can take a subsequence so that it is weakly convergent to and

where the last inequality comes from the characterization inequality of a metric projection. Now, applying (89) and (90) to the equality

we obtain

and thus,

This completes the proof.

5. Applications

In this section, we shall apply the results in Section 4 to approximate zeros of maximal monotone operators and solutions of equilibrium problems.

Theorem 20. Suppose that and are two maximal monotone operators on and , respectively, and suppose that is a bounded linear operator with adjoint . Suppose further that , , , and are sequences in with and for all . Let and be sequences in , a sequence in , and a bounded sequence in . Assume that the solution set of the problem

is nonempty. For any , start with an arbitrary and define a sequence by

Then, the sequence converges strongly to provided that the following conditions are satisfied:

(i), , ;(ii), ;(iii), .

Proof. For any , letting and , then we have by Lemma 2(b) that and for all , and hence, as shown in Section 1, the problem (94) becomes SFFP(16). Since all the requirements of Theorem 15 are satisfied except condition (iii), we have to check this condition. Because , by assumption, we may assume that there is so that and for all . Let and . Then, by virtue of the resolvent identity and the nonexpansiveness of , one has for all that

and thus,

The same argument shows for all that

Therefore, condition (iii) of Theorem 15 is true for and , and then the desired conclusion follows from Theorem 15.

Replacing and with and , respectively, in Theorem 19, we obtain the following result.

Theorem 21. Suppose that and are two maximal monotone operators on and , respectively, and suppose that is a bounded linear operator with adjoint . Let be a sequence in , , and and assume that the solution set of problem (94) is nonempty. Start with any and define a sequence by

Then, the sequence converges strongly to the minimum norm solution of problem (94) provided that the following conditions are satisfied:

(i);(ii);(iii)either or .

Recall some facts in Section 1. For a nonempty closed convex subset of , let be a function satisfying conditions (A1)–(A4), which are described in Section 1. The solution set of the equilibrium problem

is denoted by , which is equal to for any , where is a function on into defined by

for all . is a single-valued firmly nonexpansive mapping.

Theorem 22. Suppose that and are two nonempty closed convex subsets of and , respectively, and suppose that is a bounded linear operator with adjoint . Let and be functions satisfying conditions (A1)–(A4). Suppose further that , , , and are sequences in with and for all . Let and be sequences in , a sequence in , and a bounded sequence in . Assume that the solution set of the problem

is nonempty. For any , start with an arbitrary and define a sequence by

Then, the sequence converges strongly to provided that the following conditions are satisfied:

(i), , ;(ii), ;(iii), .

Proof. Define two set-valued mappings and on and , respectively, by

As shown in Takahashi et al. [21], the set-valued mapping (resp., ) is a maximal monotone operator with (resp., ), and for any (resp., for any ). With and in Theorem 20, the desired conclusion follows.

If , , , and is the identity transformation on , then (102) is reduced to the usual equilibrium problem, and we have the following corollary.

Corollary 23. Suppose that is a nonempty closed convex subsets of and is a function satisfying conditions (A1)–(A4). Let , , , and be sequences in with and for all . Let and be sequences in , and let be a sequence in and suppose that is a bounded sequence in . Assume that the solution set of the problem

is nonempty. For any , start with an arbitrary and define a sequence by

Then, the sequence converges strongly to provided that the following conditions are satisfied:

(i), , ;(ii), ;(iii), .

As shown in Blum and Oettli [7] that the variational inequalities, convex differentiable optimization, Nash equilibria in noncooperative games and so on can be formulated as equilibrium problems, we see that the pervious corollary may be applied to approximate solutions of all aforementioned problems. The readers may readily write down the details.

Just as Theorem 21 to Theorem 20, there are similar results corresponding to Theorem 22 and Corollary 23. We leave the work to readers.

References

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.

H.-K. Xu, “Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces,” Inverse Problems, vol. 26, no. 10, Article ID 105018, 2010.

C. Byrne, “Iterative oblique projection onto convex sets and the split feasibility problem,” Inverse Problems, vol. 18, no. 2, pp. 441–453, 2002.

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.

Y. Yao, W. Jigang, and Y.-C. Liou, “Regularized methods for the split feasibility problem,” Abstract and Applied Analysis, vol. 2012, Article ID 140679, 13 pages, 2012.

Y. Yao, Y.-C. Liou, and N. Shahzad, “A strongly convergent method for the split feasibility problem,” Abstract and Applied Analysis, vol. 2012, Article ID 125046, 15 pages, 2012.

E. Blum and W. Oettli, “From optimization and variational inequalities to equilibrium problems,” The Mathematics Student, vol. 63, no. 1–4, pp. 123–145, 1994.

K. Aoyama, Y. Kimura, and W. Takahashi, “Maximal monotone operators and maximal monotone functions for equilibrium problems,” Journal of Convex Analysis, vol. 15, no. 2, pp. 395–409, 2008.

P. L. Combettes and S. A. Hirstoaga, “Equilibrium programming in Hilbert spaces,” Journal of Nonlinear and Convex Analysis, vol. 6, no. 1, pp. 117–136, 2005.

E. Masad and S. Reich, “A note on the multiple-set split convex feasibility problem in Hilbert space,” Journal of Nonlinear and Convex Analysis, vol. 8, no. 3, pp. 367–371, 2007.

K. Goebel and W. A. Kirk, Topics in Metric Fixed Point Theory, vol. 28 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge, UK, 1990.

J. B. Baillon, R. E. Bruck, and S. Reich, “On the asymptotic behavior of nonexpansive mappings and semigroups in Banach spaces,” Houston Journal of Mathematics, vol. 4, no. 1, pp. 1–9, 1978.

R. E. Bruck and S. Reich, “Nonexpansive projections and resolvents of accretive operators in Banach spaces,” Houston Journal of Mathematics, vol. 3, no. 4, pp. 459–470, 1977.

O. A. Boikanyo and G. Moroşanu, “Inexact Halpern-type proximal point algorithm,” Journal of Global Optimization, vol. 51, no. 1, pp. 11–26, 2011.

O. A. Boikanyo and G. Moroşanu, “Four parameter proximal point algorithms,” Nonlinear Analysis: Theory, Methods & Applications, vol. 74, no. 2, pp. 544–555, 2011.

O. A. Boikanyo and G. Moroşanu, “A proximal point algorithm converging strongly for general errors,” Optimization Letters, vol. 4, no. 4, pp. 635–641, 2010.

S. Kamimura and W. Takahashi, “Approximating solutions of maximal monotone operators in Hilbert spaces,” Journal of Approximation Theory, vol. 106, no. 2, pp. 226–240, 2000.

G. Marino and H.-K. Xu, “Convergence of generalized proximal point algorithms,” Communications on Pure and Applied Analysis, vol. 3, no. 4, pp. 791–808, 2004.

R. T. Rockafellar, “Monotone operators and the proximal point algorithm,” SIAM Journal on Control and Optimization, vol. 14, no. 5, pp. 877–898, 1976.

M. V. Solodov and B. F. Svaiter, “Forcing strong convergence of proximal point iterations in a Hilbert space,” Mathematical Programming, vol. 87, no. 1, pp. 189–202, 2000.

S. Takahashi, W. Takahashi, and M. Toyoda, “Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces,” Journal of Optimization Theory and Applications, vol. 147, no. 1, pp. 27–41, 2010.

F. Wang and H. Cui, “On the contraction-proximal point algorithms with multi-parameters,” Journal of Global Optimization, vol. 54, no. 3, pp. 485–491, 2012.

H.-K. Xu, “A regularization method for the proximal point algorithm,” Journal of Global Optimization, vol. 36, no. 1, pp. 115–125, 2006.

H.-K. Xu, “Iterative algorithms for nonlinear operators,” Journal of the London Mathematical Society, vol. 66, no. 1, pp. 240–256, 2002.

P.-E. Maingé, “Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization,” Set-Valued Analysis, vol. 16, no. 7-8, pp. 899–912, 2008.

Y.-Y. Huang and C.-C. Hong, “Approximating common fixed points of averaged self-mappings with applications to the split feasibility problem and maximal monotone operators in Hilbert spaces,” Fixed Point Theory and Applications, vol. 2013, article 190, 2013.

F. Wang and H.-K. Xu, “Approximating curve and strong convergence of the algorithm for the split feasibility problem,” Journal of Inequalities and Applications, vol. 2010, Article ID 102085, 13 pages, 2010.