Convergence Theorems for Maximal Monotone Operators, Weak Relatively Nonexpansive Mappings and Equilibrium Problems
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 x ∈ E by 〈x*, x〉. Let T : C → C be a nonlinear mapping. We denote by F(T) the fixed points set of T, that is, F(T) = {x ∈ C : x = Tx}. Let be a set-valued mapping. We denote D(A) by the domain of A, that is, D(A) = {x ∈ E : 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*, x − y〉 ≥ 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*) = {z ∈ E : 0* ∈ Az} is closed and convex.
- (A1)
F(x, x) = 0 for all x ∈ C,
- (A2)
F is monotone, that is F(x, y) + F(y, x) ≤ 0 for all x, y ∈ C,
- (A3)
for all x, y, z ∈ C, limsup t↓0 F(tz + (1 − t)x, y) ≤ F(x, y),
- (A4)
for all x ∈ C, F(x, ·) is convex and lower semi-continuous.
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 : C → C ( 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 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→∞ ∥xn − Txn∥ = 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 p ∈ F(T) and x ∈ C. 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→∞ ∥xn − Txn∥ = 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 p ∈ F(T) and x ∈ C. 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 : C → C, 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].
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→∞ ∥xn − yn∥ = 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 x ∈ E and let z ∈ C. Then z = ΠC(x) if and only if 〈y − z, Jx − Jz〉 ≤ 0 for all y ∈ C.
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.
Lemma 2.5 (see [5].)Let E be a smooth, strictly convex, and reflexive Banach space, let A ⊂ E × E* be a maximal monotone operator with A−1(0*) ≠ ∅, and let JλA = (J + λA) −1J for each λ > 0. Then
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 x ∈ E. Then, there exists z ∈ C 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 x ∈ E, define the mapping Tr : E → C as follows:
- (1)
Tr is single-valued;
- (2)
Tr is a firmly nonexpansive-type mapping [42], that is, for all x, y ∈ E,
() - (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
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 : C → C ( i = 1,2, …) be weak relatively nonexpansive mappings such that . Let be the sequence such that lim n→∞ en = 0. Define the sequence in C as follows:
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 z ∈ Ck and i ≥ 1, we see that ϕ(z, Tiuk) ≤ ϕ(z, xk) is equivalent to
Step 2. lim n→∞ ϕ(xn, x1) exists.
From and , we have
Step 3. lim n→∞ ∥J(Tiyn) − J(xn + en)∥ = 0.
Since for m > n ≥ 1, by Lemma 2.3, it follows that
Step 4. lim n→∞ ∥Tiun − un∥ = 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 any p ∈ ℱ, by (3.4), we see that
Step 5. .
Since xn → q and en → 0, xn + en → q. So from (3.25) and (3.27), we have un → q. 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
Step 7. q ∈ EP (F).
From , we have
Step 8. q = Πℱ(x1).
From , we have
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 : C → C (i = 1,2, …) be weak relatively nonexpansive mappings such that . Let be the sequence such that lim n→∞ en = 0. Define the sequence in C as follows:
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
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 : C → C (i = 1,2, …) be weak relatively nonexpansive mappings such that . Let be the sequence such that lim n→∞ en = 0. Define the sequence in C as follows:
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 : C → C (i = 1,2, …) be weak relatively nonexpansive mappings such that . Let be the sequence such that lim n→∞ en = 0. Define the sequence in C as follows:
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 : C → C (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.