Volume 2012, Issue 1 804538
Research Article
Open Access

Convergence Theorems for Maximal Monotone Operators, Weak Relatively Nonexpansive Mappings and Equilibrium Problems

Kamonrat Nammanee

Kamonrat Nammanee

School of Science, University of Phayao, Phayao 56000, Thailand up.ac.th

Search for more papers by this author
Suthep Suantai

Suthep Suantai

Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand cmu.ac.th

Centre of Excellence in Mathematics, CHE, Si Ayutthaya Road, Bangkok 10400, Thailand

Search for more papers by this author
Prasit Cholamjiak

Corresponding Author

Prasit Cholamjiak

School of Science, University of Phayao, Phayao 56000, Thailand up.ac.th

Centre of Excellence in Mathematics, CHE, Si Ayutthaya Road, Bangkok 10400, Thailand

Search for more papers by this author
First published: 25 June 2012
Citations: 1
Academic Editor: Rudong Chen

Abstract

We introduce hybrid-iterative schemes for solving a system of the zero-finding problems of maximal monotone operators, the equilibrium problem, and the fixed point problem of weak relatively nonexpansive mappings. We then prove, in a uniformly smooth and uniformly convex Banach space, strong convergence theorems by using a shrinking projection method. We finally apply the obtained results to a system of convex minimization problems.

1. Introduction

Let E be a real Banach space and C a nonempty subset of E. Let E* be the dual space of E. We denote the value of x*E* at xE by 〈x*, x〉. Let T : CC be a nonlinear mapping. We denote by F(T) the fixed points set of T, that is, F(T) = {xC : x = Tx}. Let be a set-valued mapping. We denote D(A) by the domain of A, that is, D(A) = {xE : Ax} and also denote G(A) by the graph of A, that is, G(A) = {(x, x*) ∈ E × E* : x*Ax}. A set-valued mapping A is said to be monotone if 〈x*y*, xy〉 ≥ 0 whenever (x, x*), (y, y*) ∈ G(A). It is said to be maximal monotone if its graph is not contained in the graph of any other monotone operators on E. It is known that if A is maximal monotone, then the set A−1(0*) = {zE : 0*Az} is closed and convex.

The problem of finding a zero point of maximal monotone operators plays an important role in optimizations. This is because it can be reformulated to a convex minimization problem and a variational inequality problem. Many authors have studied the convergence of such problems in various spaces (see, e.g., [116]). Initiated by Martinet [17], in a real Hilbert space H, Rockafellar [18] introduced the following iterative scheme: x1H and
()
where {λn} ⊂ (0, ), Jλ is the resolvent of A defined by Jλ : = JλA = (I+λA)−1 for all λ > 0, and A is a maximal monotone operator on H. Such an algorithm is called the proximal point algorithm. It was proved that the sequence {xn} generated by (1.1) converges weakly to an element in A−1(0) provided that liminf nλn > 0. Recently, Kamimura and Takahashi [19] introduced the following iteration in a real Hilbert space: x1H and
()
where {αn} ⊂ [0,1] and {λn} ⊂ (0, ). The weak convergence theorems are also established in a real Hilbert space under suitable conditions imposed on {αn} and {λn}.
In 2004, Kamimura et al. [20] extended the above iteration process to a much more general setting. In fact, they proposed the following algorithm: x1E and
()
where {αn} ⊂ [0,1], {λn} ⊂ (0, ), and Jλ : = JλA = (J+λA)−1J for all λ > 0. They proved, in a uniformly smooth and uniformly convex Banach space, a weak convergence theorem.
Let F : C × C, where is the set of real numbers, be a bifunction. The equilibrium problem is to find xC such that
()
The solutions set of (1.4) is denoted by EP (F).
For solving the equilibrium problem, we assume that
  • (A1)

    F(x, x) = 0 for all xC,

  • (A2)

    F is monotone, that is F(x, y) + F(y, x) ≤ 0 for all x, yC,

  • (A3)

    for all x, y, zC, limsup t↓0F(tz + (1 − t)x, y) ≤ F(x, y),

  • (A4)

    for all xC, F(x, ·) is convex and lower semi-continuous.

Recently, Takahashi and Zembayashi [21] introduced the following iterative scheme for a relatively nonexpansive mapping T : CC in a uniformly smooth and uniformly convex Banach space: x1C and
()
where {αn} ⊂ [0,1] and {rn} ⊂ (0, ). Such an algorithm is called the shrinking projection method which was introduced by Takahashi et al. [22]. They proved that the sequence {xn} converges strongly to an element in F(T)∩EP (F) under appropriate conditions. The equilibrium problem has been intensively studied by many authors (see, e.g., [2331]).

Motivated by the previous results, we introduce a hybrid-iterative scheme for finding a zero point of maximal monotone operators (i = 1,2, …, N) which is also a common element in the solutions set of an equilibrium problem for F and in the fixed points set of weak relatively nonexpansive mappings Ti : CC  ( i = 1,2, …). Using the projection technique, we also prove that the sequence generated by a constructed algorithm converges strongly to an element in in a uniformly smooth and uniformly convex Banach space. Finally, we apply our results to a system of convex minimization problems.

2. Preliminaries and Lemmas

In this section, we give some useful preliminaries and lemmas which will be used in the sequel.

Let E be a real Banach space and let U = {xE : ∥x∥ = 1} be the unit sphere of E. A Banach space E is said to be strictly convex if for any x, yU,
()
A Banach space E is said to be uniformly convex if, for each ɛ ∈ (0,2], there exists δ > 0 such that for any x, yU,
()
It is known that a uniformly convex Banach space is reflexive and strictly convex. The function δ : [0,2] → [0,1] which is called the modulus of convexity of E is defined as follows:
()
Then E is uniformly convex if and only if δ(ɛ) > 0 for all ɛ ∈ (0,2]. A Banach space E is said to be smooth if the limit
()
exists for all x, yU. It is also said to be uniformly smooth if the limit (2.4) is attained uniformly for x, yU. The duality mapping is defined by
()
for all xE. It is also known that if E is uniformly smooth, then J is uniformly norm-to-norm continuous on bounded subsets of E (see [32] for more details).
Let E be a smooth Banach space. The function ϕ : E × E is defined by
()
for all x, yE. From the definition of ϕ, we see that
()
for all x, y, zE.

Let C be a closed and convex subset of E, and let T be a mapping from C into itself. A point p in C is said to be an asymptotic fixed point of T [33] if C contains a sequence {xn} which converges weakly to p such that lim n ∥xnTxn∥ = 0. The set of asymptotic fixed points of T will be denoted by . A mapping T is said to be relatively nonexpansive [33, 34] if and ϕ(p, Tx) ≤ ϕ(p, x) for all pF(T) and xC. A point p in C is said to be a strong asymptotic fixed point of T if C contains a sequence {xn} which converges strongly to p such that lim n ∥xnTxn∥ = 0. The set of strong asymptotic fixed points of T will be denoted by . A mapping T is said to be weak relatively nonexpansive [35] if and ϕ(p, Tx) ≤ ϕ(p, x) for all pF(T) and xC. It is obvious by definition that the class of weak relatively nonexpansive mappings contains the class of relatively nonexpansive mappings. Indeed, for any mapping T : CC, we see that . Therefore, if T is a relatively nonexpansive mapping, then .

Nontrivial examples of weak relatively nonexpansive mappings which are not relatively nonexpansive can be found in [36].

Let E be a reflexive, strictly convex and smooth Banach space, and let C be a nonempty, closed, and convex subset of E. The generalized projection mapping, introduced by Alber [37], is a mapping ΠC : EC, that assigns to an arbitrary point xE the minimum point of the function ϕ(y, x), that is, , where is the solution to the minimization problem
()
In a Hilbert space, ΠC is coincident with the metric projection denoted by PC.

Lemma 2.1 (see [38].)Let E be a uniformly convex and smooth Banach space and let {xn}, {yn} be two sequences in E. If lim nϕ(xn, yn) = 0 and either {xn} or {yn} is bounded, then lim n ∥xnyn∥ = 0.

Lemma 2.2 (see [37], [38].)Let C be a nonempty, closed, and convex subset of a smooth, strictly convex and reflexive Banach space E, let xE and let zC. Then z = ΠC(x) if and only if 〈yz, JxJz〉 ≤ 0 for all yC.

Lemma 2.3 (see [37], [38].)Let C be a nonempty, closed, and convex subset of a smooth, strictly convex, and reflexive Banach space E. Then

()

Lemma 2.4 (see [39].)Let E be a smooth and strictly convex Banach space, and let C be a nonempty, closed, and convex subset of E. Let T be a mapping from C into itself such that F(T) is nonempty and ϕ(u, Tx) ≤ ϕ(u, x) for all (u, x) ∈ F(T) × C. Then F(T) is closed and convex.

Let E be a reflexive, strictly convex, and smooth Banach space. It is known that is maximal monotone if and only if R(J + λA) = E* for all λ > 0, where R(B) stands for the range of B.

Define the resolvent of A by JλA = (J+λA)−1J for all λ > 0. It is known that JλA is a single-valued mapping from E to D(A) and A−1(0*) = F(JλA) for all λ > 0. For each λ > 0, the Yosida approximation of A is defined by
()
for all xE. We know that Aλ(x) ∈ A(JλA(x)) for all λ > 0 and xE.

Lemma 2.5 (see [5].)Let E be a smooth, strictly convex, and reflexive Banach space, let AE × E* be a maximal monotone operator with A−1(0*) ≠ , and let JλA = (J + λA) −1J for each λ > 0. Then

()
for all λ > 0, pA−1(0*), and xE.

Lemma 2.6 (see[40]). Let C be a closed and convex subset of a smooth, strictly convex, and reflexive Banach space E, let F be a bifunction from C × C to satisfying (A1)–(A4), and let r > 0 and xE. Then, there exists zC such that

()

Lemma 2.7 (see [41].)Let C be a closed and convex subset of a uniformly smooth, strictly convex, and reflexive Banach space E, and let F be a bifunction from C × C to satisfying (A1)–(A4). For all r > 0 and xE, define the mapping Tr : EC as follows:

()
Then, the following holds:
  • (1)

    Tr is single-valued;

  • (2)

    Tr is a firmly nonexpansive-type mapping [42], that is, for all x, yE,

    ()

  • (3)

    F(Tr) = EP (F);

  • (4)

    EP (F) is closed and convex.

Lemma 2.8 (see [41].)Let C be a closed and convex subset of a smooth, strictly, and reflexive Banach space E, let F be a bifunction from C × C to satisfying (A1)–(A4), let r > 0. Then

()
for all xE and pF(Tr).

3. Strong Convergence Theorems

In this section, we are now ready to prove our main theorem.

Theorem 3.1. Let E be a uniformly smooth and uniformly convex Banach space, and let C be a nonempty, closed and convex subset of E. Let (i = 1,2, …, N) be maximal monotone operators, let F : C × C be a bifunction, and let Ti : CC  ( i = 1,2, …) be weak relatively nonexpansive mappings such that . Let be the sequence such that lim nen = 0. Define the sequence in C as follows:

()
If for each i = 1,2, …, N and liminf nrn > 0, then the sequence {xn} converges strongly to q = Π(x1).

Proof. We split the proof into several steps as follows.

Step  1. Cn for all n ≥ 1.

From Lemma 2.4, we know that is closed and convex. From Lemma 2.7(4), we also know that EP (F) is closed and convex. On the other hand, since Ai (i = 1,2, …, N) are maximal monotone, are closed and convex for each i = 1,2, …, N; consequently, is closed and convex. Hence is a nonempty, closed, and convex subset of C.

We next show that Cn is closed and convex for all n ≥ 1. Obviously, C1 = C is closed and convex. Now suppose that Ck is closed and convex for some k. Then, for each zCk and i ≥ 1, we see that ϕ(z, Tiuk) ≤ ϕ(z, xk) is equivalent to

()
By the construction of the set Ck+1, we see that
()
Hence, Ck+1 is closed and convex. This shows, by induction, that Cn is closed and convex for all n ≥ 1. It is obvious that C1 = C. Now, suppose that Ck for some k. For any p, by Lemmas 2.5 and 2.8, we have
()
This shows that Ck+1. By induction, we can conclude that Cn for all n ≥ 1.

Step  2. lim nϕ(xn, x1) exists.

From and , we have

()
From Lemma 2.3, for any pCn, we have
()
Combining (3.5) and (3.6), we conclude that lim nϕ(xn, x1) exists.

Step  3. lim n ∥J(Tiyn) − J(xn + en)∥ = 0.

Since for m > n ≥ 1, by Lemma 2.3, it follows that

()
Letting m, n, we have ϕ(xm, xn) → 0. By Lemma 2.1, it follows that ∥xmxn∥ → 0 as m, n. Therefore, {xn} is a Cauchy sequence. By the completeness of the space E and the closedness of C, we can assume that xnqC as n. In particular, we obtain that
()
Since en → 0, we have
()
Since , for each i ≥ 1,
()
Since E is uniformly smooth, J is uniformly norm-to-norm continuous on bounded sets. It follows from (3.9) and by the boundedness of {xn} that
()
for all i = 1,2, …. So from Lemma 2.1, we have
()
and, since en → 0, therefore
()
for all i = 1,2, …. Since J is uniformly norm-to-norm continuous on bounded subsets of E,
()
for all i = 1,2, ….

Step  4. lim n ∥Tiunun∥ = 0 for all i = 1,2, ….

Denote that for each i ∈ {1,2, …, N} and for each n ≥ 1. We note that for each n ≥ 1.

To this end, we will show that

()
for all i = 1,2, …, N.

For any p, by (3.4), we see that

()
Since p, by Lemma 2.5 and (3.16), it follows that
()
From (3.13) and (3.14), we get that . So we obtain that
()
Again, since p,
()
From (3.13) and (3.14), we get that
()
It also follows that
()
Continuing in this process, we can show that
()
So, we now conclude that
()
for each i = 1,2, …, N. By the uniform norm-to-norm continuity of J, we also have
()
for each i = 1,2, …, N. Using (3.23), it is easily seen that
()
From , by Lemma 2.8, it follows that
()
This implies that lim nϕ(un, yn) = 0 and hence
()
Combining (3.13), (3.25), and (3.27), we obtain that
()
for all i ≥ 1.

Step  5. .

Since xnq and en → 0, xn + enq. So from (3.25) and (3.27), we have unq. Note that Ti (i = 1,2, …) are weak relatively nonexpansive. Using (3.28), we can conclude that for all i ≥ 1. Hence .

Step  6. .

Noting that for each i = 1,2, …, N, we obtain that

()
From (3.24) and , we have
()
We note that for each i = 1,2, …, N. If (w, w*) ∈ G(Ai) for each i = 1,2, …, N, then it follows from the monotonicity of Ai that
()
We see that for each i = 1,2, …, N. Thus, from (3.30) and (3.31), we have
()
By the maximality of Ai, it follows that for each i = 1,2, …, N. Therefore, .

Step  7. qEP (F).

From , we have

()
By (A2), we have
()
Note that ∥JunJyn∥/rn → 0 since liminf nrn > 0. From (A4) and unq, we get F(y, q) ≤ 0 for all yC. For 0 < t < 1 and yC, define that yt = ty + (1 − t)q. Then ytC, which implies that F(yt, q) ≤ 0. From (A1), we obtain that 0 = F(yt, yt) ≤ tF(yt, y) + (1 − t)F(yt, q) ≤ tF(yt, y). Thus, F(yt, y) ≥ 0. From (A3), we have F(q, y) ≥ 0 for all yC. Hence, qEP (F). From Steps 5, 6, and 7, we now can conclude that q.

Step  8. q = Π(x1).

From , we have

()
Since Cn, we also have
()
Letting n in (3.36), we obtain that
()
This shows that q = Π(x1) by Lemma 2.2. We thus complete the proof.

As a direct consequence of Theorem 3.1, we can also apply to a system of convex minimization problems.

Theorem 3.2. Let E be a uniformly smooth and uniformly convex Banach space, and let C be a nonempty, closed, and convex subset of E. Let fi : E → (−, ] (i = 1,2, …, N) be proper lower semicontinuous convex functions, let F : C × C be a bifunction, and let Ti : CC (i = 1,2, …) be weak relatively nonexpansive mappings such that . Let be the sequence such that lim nen = 0. Define the sequence in C as follows:

()
If for each i = 1,2, …, N and liminf nrn > 0, then the sequence {xn} converges strongly to q = Π(x1).

Proof. By Rockafellar′s theorem [43, 44], fi are maximal monotone operators for each i = 1,2, …, N. Let λi > 0 for each i = 1,2, …, N. Then, if and only if

()
which is equivalent to
()
Using Theorem 3.1, we thus complete the proof.

If E = H is a real Hilbert space, we then obtain the following results.

Corollary 3.3. Let C be a nonempty, closed and convex subset of a real Hilbert space H. Let Ai : H → 2H (i = 1,2, …, N) be maximal monotone operators, let F : C   ×  C  → be a bifunction, and let Ti : CC (i = 1,2, …) be weak relatively nonexpansive mappings such that . Let be the sequence such that lim nen = 0. Define the sequence in C as follows:

()
If for each i = 1,2, …, N and liminf nrn > 0, then the sequence {xn} converges strongly to q = P(x1).

Corollary 3.4. Let C be a nonempty, closed, and convex subset of a real Hilbert space H. Let fi : H → (−, ] (i = 1,2, …, N) be proper lower semi-continuous convex functions, let F : C × C be a bifunction, and let Ti : CC (i = 1,2, …) be weak relatively nonexpansive mappings such that . Let be the sequence such that lim nen = 0. Define the sequence in C as follows:

()
If for each i = 1,2, …, N and liminf nrn > 0, then the sequence {xn} converges strongly to q = P(x1).

Remark 3.5. Using the shrinking projection method, we can construct a hybrid-proximal point algorithm for solving a system of the zero-finding problems, the equilibrium problems, and the fixed point problems of weak relatively nonexpansive mappings.

Remark 3.6. Since every relatively nonexpansive mapping is weak relatively nonexpansive, our results also hold if Ti : CC (i = 1,2, …) are relatively nonexpansive mappings.

Acknowledgments

The authors thank the editor and the referee(s) for valuable suggestions. The first author was supported by the Thailand Research Fund, the Commission on Higher Education, and the University of Phayao under Grant MRG5380202. The second and the third authors wish to thank the Thailand Research Fund and the Centre of Excellence in Mathematics, Thailand.

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.