- Research
- Open Access
- Published:
General iterative algorithms for mixed equilibrium problems, a general system of generalized equilibria and fixed point problems
Journal of Inequalities and Applications volume 2014, Article number: 470 (2014)
Abstract
In this paper, we introduce and analyze a general iterative algorithm for finding a common solution of a finite family of mixed equilibrium problems, a general system of generalized equilibria and a fixed point problem of nonexpansive mappings in a real Hilbert space. Under some appropriate conditions, we derive the strong convergence of the sequence generated by the proposed algorithm to a common solution, which also solves some optimization problem. The result presented in this paper improves and extends some corresponding ones in the earlier and recent literature.
MSC:49J30, 47H10, 47H15.
1 Introduction
Let H be a real Hilbert space with the inner product and the norm . Let C be a nonempty, closed and convex subset of H, and let be a nonlinear mapping. Throughout this paper, we use to denote the fixed point set of T. A mapping is said to be nonexpansive if
Let be a real-valued bifunction and be a real-valued function, where R is a set of real numbers. The so-called mixed equilibrium problem (MEP) is to find such that
which was considered and studied in [1, 2]. The set of solutions of MEP (1.2) is denoted by . In particular, whenever , MEP (1.2) reduces to the equilibrium problem (EP) of finding such that
which was considered and studied in [3–7]. The set of solutions of the EP is denoted by . Given a mapping , let for all . Then if and only if for all . Numerous problems in physics, optimization and economics reduce to finding a solution of the EP.
Throughout this paper, assume that is a bifunction satisfying conditions (A1)-(A4) and that is a lower semicontinuous and convex function with restriction (B1) or (B2), where
-
(A1) for all ;
-
(A2) F is monotone, i.e., , for any ;
-
(A3) F is upper hemicontinuous, i.e., for each ,
-
(A4) is convex and lower semicontinuous for each ;
-
(B1) for each and , there exist a bounded subset and such that for any ,
-
(B2) C is a bounded set.
The mappings are said to be an infinite family of nonexpansive self-mappings on C if
and denoted by is a fixed point set of , i.e., . Finding an optimal point in the intersection of fixed point sets of mappings , , is a matter of interest in various branches of sciences.
Recently, many authors considered some iterative methods for finding a common element of the set of solutions of MEP (1.2) and the set of fixed points of nonexpansive mappings; see, e.g., [2, 8, 9] and the references therein.
A mapping is said to be:
-
(i)
Monotone if
-
(ii)
Strongly monotone if there exists a constant such that
In such a case, A is said to be η-strongly monotone.
-
(iii)
Inverse-strongly monotone if there exists a constant such that
In such a case, A is said to be ζ-inverse-strongly monotone.
Let be a nonlinear mapping. The classical variational inequality problem (VIP) is to find such that
We use to denote the set of solutions to VIP (1.4). One can easily see that VIP (1.4) is equivalent to a fixed point problem, the origin of which can be traced back to Lions and Stampacchia [10]. That is, is a solution to VIP (1.4) if and only if u is a fixed point of the mapping , where is a constant. Variational inequality theory has been studied quite extensively and has emerged as an important tool in the study of a wide class of obstacle, unilateral, free, moving, equilibrium problems. Not only are the existence and uniqueness of solutions important topics in the study of VIP (1.4), but also how to actually find a solution of VIP (1.4) is important. Up to now, there have been many iterative algorithms in the literature for finding approximate solutions of VIP (1.4) and its extended versions; see, e.g., [3, 11–14].
Recently, Ceng and Yao [8] introduced and studied the general system of generalized equilibria (GSEP) as follows: Let C be a nonempty closed convex subset of a real Hilbert space H. Let be two bifunctions, be two nonlinear mappings. Consider the following problem of finding such that
where , are two constants. In particular, whenever , GSEP (1.5) reduces to the following general system of variational inequalities (GSVI): find such that
where and are two positive constants. GSVI (1.6) is considered and studied in [8, 15, 16]. In particular, whenever and , GSVI (1.6) reduces to VIP (1.4).
In order to prove our main results in the following sections, we need the following lemmas and propositions.
Proposition 1.1 For given and :
-
(i)
, ;
-
(ii)
, ;
-
(iii)
, .
Consequently, is a firmly nonexpansive mapping of H onto C and hence nonexpansive and monotone.
Given a positive number . Let be the solution set of the auxiliary mixed equilibrium problem, that is, for each ,
Let C be a nonempty closed subset of a real Hilbert space H. Let be a bifunction satisfying conditions (A1)-(A4), and let be a lower semicontinuous and convex function with restriction (B1) or (B2). Then the following hold:
-
(a)
for each , ;
-
(b)
is single-valued;
-
(c)
is firmly nonexpansive, i.e., for any ,
-
(d)
for all and ,
-
(e)
;
-
(f)
is closed and convex.
Remark 1.1 It is easy to see from conclusions (c) and (d) in Proposition 1.2 that
and
Remark 1.2 If , then is rewritten as .
Ceng and Yao [8] transformed GSEP (1.5) into a fixed point problem in the following way.
Lemma 1.1 (see [8])
Let C be a nonempty closed convex subset of H. Let be two bifunctions satisfying conditions (A1)-(A4), and let the mappings be -inverse strongly monotone and -inverse strongly monotone, respectively. Let and , respectively. Then, for given , is a solution of GSEP (1.5) if and only if is a fixed point of the mapping defined by
where .
Lemma 1.2 (see [8])
For given , is a solution of GSVI (1.6) if and only if is a fixed point of the mapping defined by
where and is the projection of H onto C.
Remark 1.3 If are two bifunctions satisfying (A1)-(A4), the mappings are -inverse strongly monotone and -inverse strongly monotone, respectively, then is a nonexpansive mapping provided and .
Throughout this paper, the set of fixed points of the mapping G is denoted by Γ.
On the other hand, Moudafi [1] introduced the viscosity approximation method for nonexpansive mappings (see also [17] for further developments in both Hilbert spaces and Banach spaces).
A mapping is called α-contractive if there exists a constant such that
Let f be a contraction on C. Starting with an arbitrary initial , define a sequence recursively by
where T is a nonexpansive mapping of C into itself and is a sequence in . It is proved [1, 17] that under certain appropriate conditions imposed on , the sequence generated by (1.6) converges strongly to the unique solution to the VIP
A linear bounded operator A is said to be -strongly positive on H if there exists a constant such that
The typical problem is to minimize a quadratic function on a real Hilbert space H,
where C is a nonempty closed convex subset of H, u is a given point in H and A is a strongly positive bounded linear operator on H.
In 2006, Marino and Xu [18] introduced and considered the following general iterative method:
where A is a strongly positive bounded linear operator on a real Hilbert space H, f is a contraction on H. They proved that the above sequence converges strongly to the unique solution of the variational inequality
which is the optimality condition for the minimization problem
where h is a potential function for γf (i.e., for all ).
In 2007, Takahashi and Takahashi [5] introduced an iterative scheme by the viscosity approximation method for finding a common element of the set of solutions of the EP and the set of fixed points of a nonexpansive mapping in a real Hilbert space. Let be a nonexpansive mapping. Starting with arbitrary initial , define sequences and recursively by
They proved that under appropriate conditions imposed on and , the sequences and converge strongly to , where .
Subsequently, Plubtieng and Punpaeng [19] introduced a general iterative process for finding a common element of the set of solutions of the EP and the set of fixed points of a nonexpansive mapping in a Hilbert space.
Let be a nonexpansive mapping. Starting with an arbitrary , define sequences and by
They proved that under appropriate conditions imposed on and , the sequence generated by (1.12) converges strongly to the unique solution to the VIP
which is the optimality condition for the minimization problem
where h is a potential function for γf (i.e., for all ).
In 2001, Yamada [20] introduced a hybrid steepest descent method for a nonexpansive mapping T as follows:
where F is a κ-Lipschitzian and η-strongly monotone operator with constants and . He proved that if satisfies appropriate conditions, then the sequence generated by (1.13) converges strongly to the unique solution of the variational inequality
In 2010, Tian [21] combined the iterative method (1.10) with Yamada’s method (1.13) and considered the following general viscosity-type iterative method:
Then he proved that the sequence generated by (1.14) converges strongly to the unique solution of the variational inequality
Recently, Ceng et al. [22] introduced implicit and explicit iterative schemes for finding the fixed points of a nonexpansive mapping T on a nonempty, closed and convex subset C in a real Hilbert space H as follows:
and
where V is an L-Lipschitzian mapping with constant and F is a κ-Lipschitzian and η-strongly monotone operator with constants and . Then they proved that the sequences generated by (1.15) and (1.16) converge strongly to the unique solution of the variational inequality
Let be an infinite family of nonexpansive self-mappings on C and be a sequence of nonnegative numbers in . For any , define a mapping of C into itself as follows:
Such a mapping is called the W-mapping generated by and .
Very recently, Chen [23] introduced and considered the following iterative scheme:
where A is a strongly positive bounded linear operator, f is a contraction on H, and is defined as (1.17). He proved that the above sequence converges strongly to the unique solution of the variational inequality
which is the optimality condition for the minimization problem
where h is a potential function for γf (i.e., for all ).
More recently, Rattanaseeha [7] introduced an iterative algorithm:
where A is a strongly positive bounded linear operator, f is a contraction on H, and is defined as (1.17). He proved that the above sequence converges strongly to the unique solution of the variational inequality
Nowadays, Wang et al. [24] introduced an iterative algorithm:
where A is a strongly positive bounded linear operator, f is an l-Lipschitz continuous mapping, is defined by (1.17), and . They proved that the above sequence converges strongly to , where Γ is a fixed point set of the mapping , which is the unique solution of the VIP
or, equivalently, the unique solution of the minimization problem
Our concern now is the following:
Question 1 Can Theorem 3.1 of Rattanaseeha [7], Theorem 3.1 of Wang et al. [24] and so on be extended from one mixed equilibrium problem to the convex combination of a finite family of the mixed equilibrium problems?
Question 2 We know that GSEP (1.5) is more general than GSVI (1.6). What happens if GSVI (1.6) is replaced by GSEP (1.5)?
Question 3 We know that the η-strongly monotone and L-Lipschitz operator is more general than the strongly positive bounded linear operator. What happens if the strongly positive bounded linear operator is replaced by the η-strongly monotone and L-Lipschitz operator?
The purpose of this article is to give the affirmative answers to these questions mentioned above. Let be -inverse strongly monotone for , be a κ-Lipschitz and η-strongly monotone operator and be an l-Lipschitz mapping on H. Motivated by the above facts, in this paper we propose and analyze the general iterative algorithm
where is such that
for each , is defined by (1.17) and , and is an arbitrary initial point, for finding a common solution of a finite family of MEP (1.2), GSEP (1.5) and the fixed point problem of an infinite family of nonexpansive self-mappings on C. It is proven that under some mild conditions imposed on parameters, the sequence generated by (1.20) converges strongly to , where Γ is a fixed point set of the mapping , where is the unique solution of the variational inequality
Remark 1.4 Other results on the problem of finding solutions to equilibrium problems and fixed point problems of families of mappings with different approaches can be found in [25, 26].
2 Preliminaries
We indicate weak convergence and strong convergence by using the notation ⇀ and →, respectively. A mapping is called l-Lipschitz continuous if there exists a constant such that
In particular, if , then f is called a nonexpansive mapping; if , then f is a contraction. Recall that a mapping is said to be a firmly nonexpansive mapping if
The metric (or nearest point) projection from H onto C is the mapping which assigns to each point the unique point satisfying the property
We need some facts and tools in a real Hilbert space H which are listed as lemmas below.
Lemma 2.1 Let X be a real inner product space. Then there holds the following inequality:
Lemma 2.2 Let H be a Hilbert space. Then the following equalities hold:
-
(a)
for all ;
-
(b)
for all and with ;
-
(c)
If is a sequence in H such that , it follows that
We have the following crucial lemmas concerning the W-mappings defined by (1.17).
Lemma 2.3 (see [[27], Lemma 3.2])
Let be a sequence of nonexpansive self-mappings on C such that , and let be a sequence in for some . Then, for every and , the limit exists, where is defined by (1.17).
Remark 2.1 (see [[6], Remark 3.1])
It can be known from Lemma 2.3 that if D is a nonempty bounded subset of C, then for there exists such that for all ,
Remark 2.2 (see [[6], Remark 3.2])
Utilizing Lemma 2.3, we define a mapping as follows:
Such W is called the W-mapping generated by and . Since is nonexpansive, is also nonexpansive. Indeed, observe that for each ,
If is a bounded sequence in C, then we put . Hence, it is clear from Remark 2.1 that for arbitrary there exists such that for all ,
This implies that
Lemma 2.4 (see [[27], Lemma 3.3])
Let be a sequence of nonexpansive self-mappings on C such that , and let be a sequence in for some . Then .
Lemma 2.5 (see [[28], Demiclosedness principle])
Let C be a nonempty closed convex subset of a real Hilbert space H. Let T be a nonexpansive self-mapping on C with . Then is demiclosed. That is, whenever is a sequence in C weakly converging to some and the sequence strongly converges to some y, it follows that . Here I is the identity operator of H.
Lemma 2.6 Let be a monotone mapping. In the context of the variational inequality problem, the characterization of the projection (see Proposition 1.1(i)) implies
Lemma 2.7 (see [29])
Assume that is a sequence of nonnegative real numbers such that
where is a sequence in and is a real sequence such that
-
(i)
;
-
(ii)
or .
Then .
Lemma 2.8 Each Hilbert space H satisfies Opial’s condition, i.e., for the sequence with . Then the inequality
holds for any such that .
3 Main result
We will introduce and analyze a general iterative algorithm for finding a common solution of a finite family of MEP (1.2), GSEP (1.5) and the fixed point problems of an infinite family of nonexpansive self-mappings on C. Under some appropriate conditions imposed on the parameter sequences, we will prove strong convergence of the proposed algorithm.
Theorem 3.1 Let C be a nonempty closed convex subset of a Hilbert space H. Let be a sequence of bifunctions from to R satisfying (A1)-(A4), and let be a lower semicontinuous and convex function with restriction (B1) or (B2) for every , where N denotes some positive integer. Let be two bifunctions satisfying (A1)-(A4), the mapping be -inverse strongly monotone for , be a κ-Lipschitz and η-strongly monotone operator with constants , and let be an l-Lipschitz mapping with constant . Let be a sequence of nonexpansive mappings on C and be a sequence in for some . Suppose that and , where . Assume that , where Γ is a fixed point set of the mapping with for . Let and be sequences in and be a sequence in for every such that:
-
(a)
, and ;
-
(b)
and for each ;
-
(c)
and ;
-
(d)
and for each .
Given arbitrarily, the sequence is generated iteratively by
where is such that
for each , is defined by (1.17). Then the sequence defined by (3.1) converges strongly to as , where is the unique solution of the variational inequality
Proof Let in (3.1), then (3.1) reduces to
We divide the proof into several steps.
Step 1. We show that is bounded. Indeed, take arbitrarily. Since , is -inverse-strongly monotone for , by Remark 1.1 we deduce from , that for any ,
(This shows that G is nonexpansive.) It follows that
By induction, we get
Therefore, is bounded and so are the sequences , , , and . Without loss of generality, suppose that there exists a bounded subset such that
Step 2. Show that as .
First, we estimate . Taking into account that , we may assume, without loss of generality, that for some , for every . Utilizing Remark 1.1, we get
where for some . Next, we estimate .
where .
On the other hand, from (1.17), since , and are all nonexpansive, we have
where for some . Hence, we have
Putting (3.9) and (3.7) into (3.3), we have
Similarly to (3.8), we have
where for some . Then we have
Hence, it follows from (3.3)-(3.12) that
where for some . Noticing conditions (a), (b), (c), (d) and Lemma 2.7, we get as .
Step 3. We show that
First, we show . Indeed, for simplicity, we write , , . Then and . Similar to the proof of (3.4), we get
From (3.3), (3.4), (3.17), we obtain that for ,
which immediately implies that
Since , and , , we deduce from the boundedness of , and that
Also, in terms of the firm nonexpansivity of , , we obtain from , , that
and
Thus, we have
and
Consequently, it follows from (3.4), (3.18) and (3.20) that
which yields
Since , and , we deduce that
Furthermore, it follows from (3.4), (3.18) and (3.21) that
which leads to
Since , and , we deduce that
Note that
Hence from (3.20) and (3.21), we get
Next, we show that for every and . Indeed, by Proposition 1.2(c), we obtain that for any and for each ,
That is,
Then we have
It follows that
It follows from (3.18) and (3.24) that
which immediately implies that
Since and , we deduce that
Since
from , we get
Notice that
Since and , we get
Note that
On the other hand,
From and , we get
Note that
From (3.30) and Remark 2.2, we see
Step 4. Now we shall prove
where is the unique solution of variational inequality (3.2). To show this, we take a subsequence of such that
Since is bounded, there exists a subsequence of . Without loss of generality, we can still denote it by such that . Let us show .
We first show . From and and Lemma 2.5 (demiclosedness principle), we have .
Next we show . Since , we have
It follows from (A2) that
Replacing n by , we arrive at
Put for all and . Then from (3.33) we have
So, from (A4), the weak lower semicontinuity of φ, and , we have
From (A1), (A4) and (3.34), we also have