- Research
- Open access
- Published:
A new hybrid general iterative algorithm for common solutions of generalized mixed equilibrium problems and variational inclusions
Journal of Inequalities and Applications volume 2012, Article number: 138 (2012)
Abstract
In this article, we introduce a new general iterative method for finding a common element of the set of solutions generalized for mixed equilibrium problems, the set of solution for fixed point for nonexpansive mappings and the set of solutions for the variational inclusions for β1, β2-inverse-strongly monotone mappings in a real Hilbert space. We prove that the sequence converges strongly to a common element of the above sets under some suitable conditions. Our results improve and extend the corresponding results of Marino and Xu, Su et al., Tan and Chang and some authors.
Mathematics subject Classification: 46C05; 47H09; 47H10.
1. Introduction
Let C be a closed convex subset of a real Hilbert space H with the inner product 〈·, ·〉 and the norm || · ||. Let F be a bifunction of C × C into , where is the set of real numbers, Ψ : C → H be a mapping and be a real-valued function. The generalized mixed equilibrium problem for finding x ∈ C such that
The set of solutions of (1.1) is denoted by GMEP(F, φ, Ψ), that is
If F ≡ 0, the problem (1.1) is reduced into the mixed variational inequality of Browder type[1] for finding x ∈ C such that
The set of solutions of (1.2) is denoted by MVI(C, φ, Ψ).
If Ψ ≡ 0, the problem (1.1) is reduced into the mixed equilibrium problem for finding x ∈ C such that
The set of solutions of (1.3) is denoted by MEP(F, φ).
If φ ≡ 0, the problem (1.3) is reduced into the equilibrium problem[2] for finding x ∈ C such that
The set of solutions of (1.4) is denoted by EP(F). See, e.g. [3–6] and the references therein.
If F ≡ 0 and φ ≡ 0, the problem (1.1) is reduced into the Hartmann-Stampacchia variational inequality[7] for finding x ∈ C such that
The set of solutions of (1.5) is denoted by VI(C, Ψ).
If F ≡ 0 and Ψ ≡ 0, the problem (1.1) is reduced into the minimize problem for finding x ∈ C such that
The set of solutions of (1.6) is denoted by Argmin(φ).
Iterative methods for nonexpansive mappings have recently been applied to solve convex minimization problems. Convex minimization problems have a great impact and influence in the development of almost all branches of pure and applied sciences. A typical problem is to minimize a quadratic function over the set of the fixed points of a nonexpansive mapping on a real Hilbert space H:
where A is a linear bounded operator, F(S) is the fixed point set of a nonexpansive mapping S and y is a given point in H[8].
Recall, a mapping S : C → C is said to be nonexpansive if
If C is bounded closed convex and S is a nonexpansive mapping of C into itself, then F(S) is nonempty [9]. A mapping S : C → C is said to be a k-strictly pseudo-contraction[10] if there exists 0 ≤ k < 1 such that
where I denotes the identity operator on C. A mapping A of C into H is called monotone if
A mapping A of C into H is called an α-inverse-strongly monotone if there exists a positive real number α such that
A mapping A of C into H is called α-strongly monotone if there exists a positive real number α such that
A linear bounded operator A is called strongly positive if there exists a constant with the property
A self mapping f : C → C is called contraction on C if there exists a constant α ∈ (0, 1) such that
Let B : H → H be a single-valued nonlinear mapping and M : H → 2Hbe a set-valued mapping. The variational inclusion problem is to find x ∈ H such that
where θ is the zero vector in H. The set of solutions of problem (1.8) is denoted by I(B, M). The variational inclusion has been extensively studied in the literature. See, e.g. [11–15] and the reference therein.
A set-valued mapping M : H → 2His called monotone if for all x, y ∈ H, f ∈ M(x) and g ∈ M(y) imply 〈x - y, f - g〉 ≥ 0. A monotone mapping M is maximal if its graph G(M) := {(f, x) ∈ H × H : f ∈ M(x)} of M is not properly contained in the graph of any other monotone mapping. It is known that a monotone mapping M is maximal if and only if for (x, f) ∈ H × H, 〈x - y, f - g〉 > 0 for all (y, g) ∈ G(M) imply f ∈ M(x).
Let B be an inverse-strongly monotone mapping of C into H and let N C v be normal cone to C at v ∈ C, i.e., N C v = {w ∈ H : 〈v - u, w〉 ≥ 0, ∀u ∈ C}, and define
Then M is a maximal monotone and θ ∈ Mν if and only if v ∈ VI(C, B) [16].
Let M : H → 2Hbe a set-valued maximal monotone mapping, then the single-valued mapping JM,λ: H → H defined by
is called the resolvent operator associated with M, where λ is any positive number and I is the identity mapping. In the worth mentioning that the resolvent operator is nonexpansive, 1-inverse-strongly monotone and that a solution of problem (1.8) is a fixed point of the operator JM,λ(I - λB) for all λ > 0 (see also [17]).
In 2000, Moudafi [18] introduced the viscosity approximation method for nonexpansive mapping and proved that if H is a real Hilbert space, the sequence {x n } defined by the iterative method below, with the initial guess x0 ∈ C is chosen arbitrarily,
where {α n } ⊂ (0, 1) satisfies certain conditions, converge strongly to a fixed point of S (say ) which is the unique solution of the following variational inequality.
In 2005, Iiduka and Takahashi [19] introduced following iterative process x0 ∈ C,
where u ∈ C, {α n } ⊂ (0, 1) and {λ n } ⊂ [a, b] for some a, b with 0 < a < b < 2β. They proved that under certain appropriate conditions imposed on {α n } and {λ n }, the sequence {x n } converges strongly to a common element of the set of fixed points of nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly monotone mapping (say ) which solve some variational inequality.
In 2006, Marino and Xu [8] introduced a general iterative method for nonexpansive mapping. They defined the sequence {x n } generated by the algorithm x0 ∈ C,
where {α n } ⊂ (0, 1) and A is a strongly positive linear bounded operator. They proved that if C = H then the sequence {x n } converges strongly to a fixed point of S (say ) which is the unique solution of the following variational inequality.
In 2008, Su et al. [20] introduced the following iterative scheme by the viscosity approximation method in a real Hilbert space: x1, u n ∈ H
for all n ∈ ℕ, where {α n } ⊂ [0, 1) and {r n } ⊂ (0, ∞) satisfy some appropriate conditions. Furthermore, they proved {x n } and {u n } converge strongly to the same point z, where z = PF(S)∩VI(C,A)∩ EP(F)f(z).
In 2011, Tan and Chang [14] introduced following iterative process for {T n : C → C} be a sequence of nonexpansive mappings. Let {x n } be the sequence defined by
where {α n } ⊂ (0, 1), λ ∈ (0, 2α] and μ ∈ (0, 2β]. The sequence {x n } converges strongly to a common element of the set of fixed points of nonexpansive mapping, the set of solutions of the variational inequality and the generalized equilibrium problem.
In this article, we modify by Marino and Xu [8], Su et al. [20] and Tan and Chang [14], the purpose of this article, we show that under some control conditions the sequence {x n } converges strongly to a common element of the set of fixed points of nonexpansive mappings, the solution of the generalized mixed equilibrium problems and the solution of the variational inclusions in a real Hilbert space.
2. Preliminaries
Let H be a real Hilbert space and C be a nonempty closed convex subset of H. We denote weak convergence and strong convergence by notations ⇀ and →, respectively. Recall that the metric (nearest point) projection P C from H onto C assigns to each x ∈ H, the unique point in P C x ∈ C satisfying the property
The following characterizes the projection P C . We recall some lemmas which will be needed in the rest of this article.
Lemma 2.1. The function u ∈ C is a solution of the variational inequality (1.5) if and only if u ∈ C satisfies the relation u = P C (u - λ Ψu) for all λ > 0.
Lemma 2.2. For a given z ∈ H, u ∈ C, u = P C z ⇔ 〈u - z, v - u〉 ≥ 0, ∀v ∈ C.
It is well known that P C is a firmly nonexpansive mapping of H onto C and satisfies
Moreover, P C x is characterized by the following properties: P C x ∈ C and for all x ∈ H, y ∈ C,
Lemma 2.3. [21]Let M : H → 2Hbe a maximal monotone mapping and let B : H → H be a monotone and Lipshitz continuous mapping. Then the mapping L = M + B : H → 2His a maximal monotone mapping.
Lemma 2.4. [22]Each Hilbert space H satisfies Opial's condition, that is, for any sequence {x n } ⊂ H with x n ⇀ x, the inequality lim infn→∞||x n - x|| < lim infn→∞||x n - y||, hold for each y ∈ H with y ≠ x.
Lemma 2.5. [23]Assume {a n } is a sequence of nonnegative real numbers such that
where {γ n } ⊂ (0, 1) and {δ n } is a sequence insuch that
-
(i)
.
-
(ii)
or .
Then limn→∞a n = 0.
Lemma 2.6. [24]Let C be a closed convex subset of a real Hilbert space H and let S : C → C be a nonexpansive mapping. Then I - S is demiclosed at zero, that is,
implies x = Sx.
For solving the mixed equilibrium problem, let us assume that the bifunction and satisfies the following conditions:
(A1) F(x, x) = 0 for all x ∈ C;
(A2) F is monotone, i.e., F(x, y) + F(y, x) ≤ 0 for any x, y ∈ C;
(A3) for each fixed y ∈ C, x ↦ F(x, y) is weakly upper semicontinuous;
(A4) for each fixed x ∈ C, y ↦ F(x, y) is convex and lower semicontinuous;
(B1) for each x ∈ C and r > 0, there exist a bounded subset D x ⊆ C and y x ∈ C such that for any z ∈ C \ D x ,
(B2) C is a bounded set.
Lemma 2.7. [25]Let C be a nonempty closed convex subset of a real Hilbert space H. Letbe a bifunction mapping satisfies (A1)-(A4) and letis convex and lower semicontinuous such that. Assume that either (B1) or (B2) holds. For r > 0 and x ∈ H, then there exists z ∈ C such that
Define a mapping as follows:
for all x ∈ H. Then, the following hold:
-
(i)
is single-valued;
-
(ii)
is firmly nonexpansive, i.e., for any x, y ∈ H,
-
(iii)
;
-
(iv)
MEP(F, φ) is closed and convex.
Lemma 2.8. [8]Assume A is a strongly positive linear bounded operator on a Hilbert space H with coefficientand 0 < ρ ≤ ||A||-1, then.
Lemma 2.9. [26]Let H be a real Hilbert space and A : H → H a mapping.
-
(i)
If A is a δ-strongly monotone and μ-strictly pseudo-contraction with δ + μ > 1, then I - A is a contraction with constant .
-
(ii)
If A is a δ-strongly monotone and μ-strictly pseudo-contraction with δ + μ > 1, then for any fixed number τ ∈ (0, 1), I - τA is a contraction with constant .
3. Strong convergence theorems
In this section, we show a strong convergence theorem which solves the problem of finding a common element of F(S), GMEP(F1, φ1, B1), GMEP(F2, φ2, B2), I(A1, M1) and I(A2, M2).
Theorem 3.1. Let H be a real Hilbert space, C be a closed convex subset of H. Let F1, F2be bifunctions of C × C intosatisfying (A1)-(A4) and A1, A2, B1, B2 : C → H be β1, β2, η, ρ-inverse-strongly monotone mappings, be convex and lower semicontinuous functions, f : C → C be a contraction with coefficient α (0 < α < 1), M1, M2 : H → 2Hbe maximal monotone mappings and A is a δ-strongly monotone and μ-strictly pseudo-contraction with δ + μ > 1, γ is a positive real number such that. Assume that either (B1) or (B2) holds. Let S be a nonexpansive mapping of C into itself such that
Suppose {x n } is a sequences generated by the following algorithm x0 ∈ C arbitrarily:
where {α n }, {ξ n } ⊂ (0, 1), λ1 ∈ (0, 2β1) such that 0 < a1 ≤ λ1 < b1 < 2β1, λ2 ∈ (0, 2β2) such that 0 < a1 ≤ λ2 ≤ b2 < 2β2, r n ∈ (0, 2η) with 0 < c ≤ d ≤ 1 - η and s n ∈ (0, 2ρ) with 0 < e ≤ f ≤ 1 - ρ satisfy the following conditions:
(C1): limn→∞α n = 0, ,
(C2): 0 < lim infn→∞ξ n < lim supn→∞ξ n < 1, ,
(C3): lim infn→∞r n > 0 and limn→∞|rn+1- r n | = 0,
(C4): lim infn→∞s n > 0 and limn→∞|sn+1- s n | = 0.
Then {x n } converges strongly to q ∈ Θ, where q = PΘ(γf + I - A)(q) which solves the following variational inequality:
which is the optimality condition for the minimization problem
where h is a potential function for γf (i.e., h'(q) = γf(q) for q ∈ H).
Proof. Since A1, A2 are β1, β2-inverse-strongly monotone mappings, we have
In similar way, we can obtain
And B1, B2 are η, ρ-inverse-strongly monotone mappings, we have
In similar way, we can obtain
It is clear that if 0 < λ1 < 2β1, 0 < λ2 < 2β2, 0 < r n < 2η, 0 < s n ≤ 2ρ then I - λ1A1, I - λ2A2, I - r n B1, I - s n B2 are all nonexpansive. We will divide the proof into six steps.
Step 1. We will show {x n } is bounded. Put for all n ≥ 0 and for all n ≥ 0. It follows that
In similar way, we can obtain
Put . It follows that
By Lemma 2.7, we have for all n ≥ 0. Then, we have
In similar way, we can obtain
Put z n = P C [α n γf(x n ) + (I - α n A)SP C y n ] for all n ≥ 0. From (3.1) and by Lemma 2.9
(ii), we deduce that
It follows from induction that
Therefore {x n } is bounded, so are {y n },{z n },{P C w n },{SP C y n },{f(x n )} and {ASP C y n }.
Step 2. We claim that limn→∞||xn+2- xn+1|| = 0. From (3.1), we have
Since I - λ2A2 be nonexpansive, we have
On the other hand, from and , it follows that
and
Substituting y = v n in (3.11) and y = vn-1in (3.12), we get
and
From (A2), we obtain
and then
so
It follows that
Without loss of generality, let us assume that there exists a real number e such that sn- 1> e > 0, for all n ∈ ℕ. Then, we have
and hence
where M1 = sup{||v n - x n || : n ∈ ℕ}. Substituting (3.13) into (3.9) and (3.10) that
By Lemma 2.9 (ii), it follow that
Since I - λ1A1 be nonexpansive, we have
On the other hand, from and , it follows that
and
Substituting y = u n in (3.17) and y = un-1in (3.18), we get
and
From (A2), we obtain
and then
so
It follows that
Without loss of generality, let us assume that there exists a real number c such that rn- 1> c > 0, for all n∈ℕ. Then, we have
and hence
where M2 = sup{||u n - x n || : n ∈ ℕ}. Substituting (3.19) into (3.16), we have
Substituting (3.20) into (3.15), we obtain that
And substituting (3.10), (3.13), (3.21) into (3.9), we get
where M3 > 0 is a constant satisfying
This together with (C1)-(C4) and Lemma 2.5, imply that
From (3.20) and (C3), we also have ||yn+1- y n || → 0 as n → ∞.
Step 3. We show the followings:
-
(i)
limn→∞||A 1 u n - A 1 q|| = 0;
-
(ii)
limn→∞||A 2 v n - A 2 q|| = 0;
-
(iii)
limn→∞||B 1 x n - B 1 q|| = 0;
-
(iv)
limn→∞||B 2 x n - B 2 q|| = 0.
For q ∈ Θ and , then we get
Using (3.5), it follows that
By the convexity of the norm ||·||, we have
Substituting (3.4), (3.7), (3.24) into (3.25), we obtain
So, we obtain
where . Since conditions (C1), (C2) and limn→∞||xn+1-x n || = 0, then we obtain that ||A1u n - A1q|| → 0 as n → ∞. For q ∈ Θ and , then we get
Substituting (3.24), (3.26) into (3.25), we obtain
So, we obtain
where . Since conditions (C1), (C2), limn→∞||xn+1- x n || = 0 and limn→∞||A1u n - A1q|| → 0 then we obtain that ||A2v n - A2q|| → 0 as n → ∞. We consider this inequality in (3.24) that
Substituting (3.3) and (3.6) into (3.27), we have
Substituting (3.4), (3.7) and (3.28) into (3.25), we obtain
So, we also have
where . Since conditions (C1), (C2), (C3), limn→∞||xn+1- x n || = 0, then we obtain that ||B1x n - B1q|| → 0 as n → ∞. Substituting (3.4), (3.7) and (3.28) into (3.25), we obtain
So, we also have
where . Since conditions (C1), (C2), (C4), limn→∞||xn+1- x n || = 0 and limn→∞||B1x n - B1q|| = 0, then we obtain that ||B2x n - B2q|| → 0 as n → ∞.
Step 4. We show the followings:
-
(i)
limn→∞||x n - u n || = 0;
-
(ii)
limn→∞||u n - y n || = 0;
-
(iii)
limn→∞||x n - v n || = 0;
-
(iv)
limn→∞||v n - w n || = 0;
-
(v)
;
-
(vi)
.
Since is firmly nonexpansive, we observe that
Hence, we have
Since is 1-inverse-strongly monotone, we compute
which implies that
Substitute (3.30) into (3.31), we have
Substitute (3.32) into (3.27), we have
Since is firmly nonexpansive, we observe that
Hence, we have
Since is 1-inverse-strongly monotone, we compute
which implies that
Substitute (3.34) into (3.35), we have
Substitute (3.33) and (3.36) into (3.25), we obtain
Then, we derive
By conditions (C1)-( C4), limn→∞||x n -xn+1|| = 0, limn→∞||B1x n -B1q|| = 0, limn→∞||B2x n -B2q|| = 0, limn→∞||A1u n - A1q|| = 0 and limn→∞||A2v n - A2q|| = 0. So, we have ||x n - u n || → 0, ||u n - y n || → 0, ||x n - v n || → 0, ||v n - w n || → 0 as n → ∞.
From (2.1), we have
which implies that
Substitute (3.30) into (3.37), we have
We consider this inequality in (3.24) that
Substitute (3.38) into (3.39), we have
Substitute (3.36) and (3.40) into (3.25), we obtain
Then, we derive
By conditions (C1)-(C4), limn→∞||x n -xn+1|| = 0, limn→∞||B1x n -B1q|| = 0, limn→∞||B2x n -B2q|| = 0, limn→∞||A1u n - A1q|| = 0, limn→∞||A2v n - A2q|| = 0, ||x n - u n || → 0, ||x n - v n || → 0, ||v n - w n || → 0 as n → ∞. So, we have . It follows that
We compute that
From limn→∞||x n - w n || = 0, limn→∞||xn+1- x n || = 0, and hence
It follows by step 4 (i) and (ii),
Since
So, by (3.41) and limn→∞||x n - y n || = 0, we obtain
We show as n → ∞. By nonexpansiveness of P C notice that
By condition (C1), we get . Since , so by (3.42), and , we obtain .
Step 5. We show that q ∈ Θ := F(S) ∩ GMEP(F1, φ1, B1) ∩ GMEP(F2, φ2, B2) ∩ I(Al, M1) ∩ I(A2, M2) and . It is easy to see that PΘ(γf + (I - A)) is a contraction of H into itself. In fact, from Lemma 2.9, we have
Hence H is complete, there exists a unique fixed point q ∈ H such that q = PΘ(γf + (I - A))(q). By Lemma 2.2 we obtain that 〈(γf - A)q, w - q〉 ≤ 0 for all w ∈ Θ.
Next, we show that , where q = PΘ(γf + I - A)(q) is the unique solution of the variational inequality 〈(γf - A)q, p - q〉 ≥ 0, ∀p ∈ Θ. We can choose a subsequence of such that
Since is bounded, there exists a subsequence of which converges weakly to w. We may assume without loss of generality that .
We claim that w ∈ Θ. Since and by Lemma 2.6, we have w ∈ F(S).
Next, we show that w ∈ GMEP(F1, φ1, B1). Since , we know that
It follows by (A2) that
Hence,
For t ∈ (0, 1] and y ∈ H, let y t = ty + (1 - t)w. From (3.43), we have
From , we have . Further, from (A4) and the weakly lower semicontinuity of and , we have
From (A1), (A4) and (3.44), we have
and hence
Letting t → 0, we have, for each y ∈ C,
This implies that w ∈ GMEP(F1, φ1, B1). By following the same arguments, we can show that w ∈ GMEP(F2, φ2, B2).
Lastly, we show that w ∈ I(A1, M2). In fact, since A1 is a β1-inverse-strongly monotone, A1 is monotone and Lipschitz continuous mapping. It follows from Lemma 2.3 that M1 + A1 is a maximal monotone. Let (v, g) ∈ G(M1 + A1), since g - A1v ∈ M1(v). Again since , we have , that is, . By virtue of the maximal monotonicity of M1 + A1, we have
and hence
It follows from limn→∞||u n - y n || = 0, we have limn→∞||A1u n - A1y n || = 0 and that
It follows from the maximal monotonicity of A1 + M1 that θ ∈ (M1 + A1)(w), that is, w ∈ I(A1, M1). By following the same arguments, we can show that w ∈ I(A2, M2). Therefore, w ∈ Θ. It follows that
Step 6. We prove x n → q. By using (3.1), Lemma 2.9 (ii) and together with Schwarz inequality, we have
Since {x n } is bounded, where for all n ≥ 0. It follows that
where . By , we get lim supn→∞ς n ≤ 0. Applying Lemma 2.5, we can conclude that x n → q. This completes the proof. □
Next, the following example shows that all conditions of Theorem 3.1 are satisfied.
Example 3.2. For instance, let and , then, we will show that the sequences {α n } satisfy the condition (C1). Indeed, we take then we have
and
Then, the sequence {α n } satisfy the condition (C1).
We will show that the sequences {ξ n } satisfy the condition (C2). Indeed, we set . By similarly (C1), it is easy to see that 0 < lim infn→∞ξ n < lim supn→∞ξ n < 1 and .
Next, we will show that the condition (C3) is achieves. We take , then we compute
Then, we have and also limn→∞|rn+1- r n | = 0.
The sequence {r n } satisfy the condition (C3). In the same way with (C4). □
Corollary 3.3. Let H be a real Hilbert space, C be a closed convex subset of H. Let F1, F2be bifunctions of C × C intosatisfying (A1)-(A4) and B, B1, B2 : C → H be β, η, ρ-inverse-strongly monotone mappings, be convex and lower semicontinuous functions, f : C → C be a contraction with coefficient α (0 < α < 1), M : H → 2Hbe a maximal monotone mapping. Assume that either (B1) or (B2) holds. Let S be a nonexpansive mapping of C into itself such that
Suppose {x n } is a sequences generated by the following algorithm x0 ∈ C arbitrarily:
where {α n }, {ξ n } ⊂ (0, 1), λ ∈ (0, 2β) such that 0 < a ≤ λ ≤ b < 2β, r n ∈ (0, 2η) with 0 < c ≤ d ≤ 1 - η and s n ∈ (0, 2ρ) with 0 < e ≤ f ≤ 1 - ρ satisfy the following conditions:
(C1): limn→∞α n = 0, ,
(C2): 0 < lim infn→∞ξ n < lim supn→∞ξ n < 1, ,
(C3): lim infn→∞r n > 0 and limn→∞|rn+1- r n | = 0,
(C4): lim infn→∞s n > 0 and limn→∞|sn+1- s n | = 0.
Then {x n } converges strongly to q ∈ Θ1, wherewhich solves the following variational inequality:
Proof. Putting A ≡ I, γ ≡ 1, and A2 ≡ 0 in Theorem 3.1, we can obtain desired conclusion immediately. □
Corollary 3.4. Let H be a real Hilbert space, C be a closed convex subset of H. Let F1, F2be bifunctions of C × C intosatisfying (A1)-(A4) and B,B1,B2 : C → H be β, η, ρ-inverse-strongly monotone mappings, be convex and lower semicontinuous functions. Assume that either (B1)or (B2) holds. Let S be a nonexpansive mapping of C into itself such that
Suppose {x n } is a sequences generated by the following algorithm x0 ∈ C arbitrarily:
where {α n }, {ξ n } ⊂ (0, 1), λ ∈ (0, 2β) such that 0 < a ≤ λ ≤ b < 2β, r n ∈ (0, 2η) with 0 < c ≤ d ≤ 1 - η and s n ∈ (0, 2ρ) with 0 < e ≤ f ≤ 1 - ρ satisfy the following conditions:
(C1): limn→∞α n = 0, ,
(C2): 0 < lim infn→∞ξ n < lim supn→∞ξ n < 1, ,
(C3): lim infn→∞r n > 0 and limn→∞|rn+1- r n | = 0,
(C4): lim infn→∞s n > 0 and limn→∞|sn+1- s n | = 0.
Then {x n } converges strongly to q ∈ Θ1, wherewhich solves the following variational inequality:
Proof. Putting f ≡ u ∈ C in Corollary 3.3, we can obtain desired conclusion immediately. □
Corollary 3.5. Let H be a real Hilbert space, C be a closed convex subset of H. Let F1, F2be bifunctions of C × C intosatisfying (A1)-(A4) and B,B1,B 2 : C → H be β, η, ρ-inverse-strongly monotone mappings, be convex and lower semicontinuous functions, f : C → C be a contraction with coefficient α (0 < α < 1) and A is a δ-strongly monotone and μ-strictly pseudo-contraction with δ + μ > 1, γ is a positive real number such that. Assume that either (B1) or (B2) holds. Let S be a nonexpansive mapping of C into itself such that
Suppose {x n } is a sequences generated by the following algorithm x0 ∈ C arbitrarily:
where {α n }, {ξ n } ⊂ (0, 1), λ ⊂ (0, 2β) such that 0 < a ≤ λ ≤ b < 2β, r n ∈ (0, 2η) with 0 < c ≤ d ≤ 1 - η and s n ∈ (0, 2ρ) with 0 < e ≤ f ≤ 1 - ρ satisfy the following conditions:
(C1): limn→∞α n = 0, ,
(C2): 0 < lim infn→∞ξ n < lim supn→∞ξ n < 1, ,
(C3): lim infn→∞r n > 0 and limn→∞|rn+ 1- r n | = 0,
(C4): lim infn→∞s n > 0 and limn→∞|sn+1- s n | = 0.
Then {x n } converges strongly to q ∈ Θ2, wherewhich solves the following variational inequality:
Proof. Taking and A2 ≡ 0 in Theorem 3.1, we can obtain desired conclusion immediately. □
Corollary 3.6. Let H be a real Hilbert space, C be a closed convex subset of H. Let F1, F2be bifunctions of C × C intosatisfying (A1)-(A4) and B1, B2 : C → H be η, ρ-inverse-strongly monotone mappings, be convex and lower semicontinuous functions, f : C → C be a contraction with coefficient α (0 < α < 1). Assume that either (B1) or (B2) holds. Let S be a nonexpansive mapping of C into itself such that
Suppose {x n } is a sequences generated by the following algorithm x0 ∈ C arbitrarily:
where {α n }, {ξ n } ⊂ (0, 1), r n ∈ (0, 2η) with 0 < c ≤ d ≤ 1 - η and s n ∈ (0, 2ρ) with 0 < e ≤ f ≤ 1 - ρ satisfy the following conditions:
(C1): limn→∞α n = 0, ,
(C2): 0 < lim infn→∞ξ n < lim supn→∞ξ n < 1, ,
(C3): lim infn→∞r n > 0 and limn→∞|rn+1- r n | = 0,
(C4): lim infn→∞s n > 0 and limn→∞|sn+1- s n | = 0.
Then {x n } converges strongly to q ∈ Θ3, wherewhich solves the following variational inequality:
Proof. Taking γ ≡ 1, A ≡ I and B ≡ 0 in Corollary 3.5, we can obtain desired conclusion immediately. □
References
Browder FE: Existence and approximation of solutions of nonlinear variational inequalities. Proc Natl Acad Sci USA 1966, 56: 1080–1086. 10.1073/pnas.56.4.1080
Blum E, Oettli W: From optimization and variational inequalities to equilibrium problems. Math Student 1994, 63: 123–145.
Chang SS, Lee HWJ, Chan CK: A new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization. Nonlinear Anal Theory Method Appl 2009, 670: 3307–3319.
Shehu Y: A new iterative scheme for a countable family of relatively nonex- pansive mappings and an equilibrium problem in Banach spaces. J Global Optim
Ye J, Huang J: Strong convergence theorems for fixed point problems and generalized equilibrium problems of three relatively quasi-nonexpansive mappings in Banach spaces. J Math Comput Sci 2011, 1: 1–18.
Yang S, Li W: Iterative solutions of a system of equilibrium problems in Hilbert spaces. Adv Fixed Point Theory 2011, 1: 15–26.
Hartman P, Stampacchia G: On some nonlinear elliptic differential functional equations. Acta Math 1966, 115: 271–310. 10.1007/BF02392210
Marino G, Xu HK: A general iterative method for nonexpansive mapping in Hilbert space. J Math Anal Appl 2006, 318: 43–52. 10.1016/j.jmaa.2005.05.028
Kirk WA: Fixed point theorem for mappings which do not increase distance. Am Math Monthly 1965, 72: 1004–1006. 10.2307/2313345
Browder FE, Petryshym WV: Construction of fixed points of nonlinear mappings in Hilbert spaces. J Math Anal Appl 1963, 20: 197–228.
Liu M, Chang SS, Zuo P: An algorithm for finding a common solution for a system of mixed equilibrium problem, quasivariational inclusion problems of nonexpansive semigroup. J Inequal Appl 2010, 23. Article ID 895907,
Hao Y: Some results of variatinal inclusion problems and fixed point problems with applications. Appl Math Mech 2009, 30(12):1589–1596. 10.1007/s10483-009-1210-x
Matsushita SY, Takahashi W: Existence theorems for set-valued operators in Banach spaces. Set-Valued Anal 2007, 15: 251–264. 10.1007/s11228-006-0030-8
Tan JF, Chang SS: Iterative algorithms for finding common solutions to variational inclusion equilibrium and fixed point problems. Fixed Point Theory Appl 2011, 17. Article ID 915629,
Zhang SS, Joseph Lee HW, Chan CK: Algorithms of common solutions to quasi variational inclusion and fixed point problems. Appl Math Mech 2008., 29(5):
Rockafellar RT: On the maximality of sums of nonlinear monotone operators. Trans Am Math Soc 2000, 149: 46–55.
Takahashi W: Nonlinear Functional Analysis. Yokohama Publishers, Yokohama; 2000.
Moudafi A: Viscosity approximation methods for fixed points problems. J Math Anal Appl 2000, 241: 46–55. 10.1006/jmaa.1999.6615
Iiduka H, Takahashi W: Strong convergence theorems for nonexpansive mapping and inverse-strong monotone mappings. Nonlinear Anal 2005, 61: 341–350. 10.1016/j.na.2003.07.023
Su Y, Shang M, Qin X: An iterative method of solution for equilibrium and optimization problems. Nonlinear Anal 2008, 69: 2709–2719. 10.1016/j.na.2007.08.045
Brézis H: Opérateur maximaux monotones. In Mathematics Studies. Volume 5. North-Holland, Amsterdam; 1973.
Opial Z: Weak convergence of successive approximations for nonexpansive mappings. Bull Am Math Soc 1967, 73: 591–597. 10.1090/S0002-9904-1967-11761-0
Xu HK: Iterative algorithms for nonlinear operators. J Lond Math Soc 2002, 66: 240–256. 10.1112/S0024610702003332
Browder FE: Nonlinear operators and nonlinear equations of evolution in Banach spaces. Proc Symp Pure Math 1976, 18: 78–81.
Peng J-W, Liou Y-C, Yao J-C: An iterative algorithm combining viscosity method with parallel method for a generalized equilibrium problem and strict pseudocontractions. Fixed Point Theory Appl 2009, 21. Article ID 794178,
Wangkeeree R, Bantaojai T: A general composite algorithms for solving general equilibrium problems and fixed point problems in Hilbert spaces. Thai J Math 2011, 9: 191–212.
4. Acknowledgements
The authors are grateful for the reviewers for the careful reading of the article and for the suggestions which improved the quality of this work.
This research was partially supported by the Hands-On Research and Development, Rajamangala University of Technology Lanna (under Project No. UR2L-003). Furthermore, the third authors also would like to thank the Higher Education Research Promotion and National Research University Project of Thailand, Office of the Higher Education Commission (NRU-CSEC Project No.55000613) for financial support.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Wattanawitoon, K., Jitpeera, T. & Kumam, P. A new hybrid general iterative algorithm for common solutions of generalized mixed equilibrium problems and variational inclusions. J Inequal Appl 2012, 138 (2012). https://doi.org/10.1186/1029-242X-2012-138
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2012-138