Volume 2012, Issue 1 414831
Research Article
Open Access

A System of Mixed Equilibrium Problems, a General System of Variational Inequality Problems for Relaxed Cocoercive, and Fixed Point Problems for Nonexpansive Semigroup and Strictly Pseudocontractive Mappings

Poom Kumam

Poom Kumam

Department of Mathematics, Faculty of Science, King Mongkut′s University of Technology Thonburi (KMUTT), Bangkok 10140, Thailand kmutt.ac.th

Centre of Excellence in Mathematics, CHE, Si Ayutthaya Road, Bangkok 10400, Thailand cem.sc.mahidol.ac.th

Search for more papers by this author
Phayap Katchang

Corresponding Author

Phayap Katchang

Centre of Excellence in Mathematics, CHE, Si Ayutthaya Road, Bangkok 10400, Thailand cem.sc.mahidol.ac.th

Department of Mathematics and Statistics, Faculty of Science and Agricultural Technology, Rajamangala University of Technology Lanna Tak, Tak 63000, Thailand rmutl.ac.th

Search for more papers by this author
First published: 06 May 2012
Citations: 4
Academic Editor: Giuseppe Marino

Abstract

We introduce an iterative algorithm for finding a common element of the set of solutions of a system of mixed equilibrium problems, the set of solutions of a general system of variational inequalities for Lipschitz continuous and relaxed cocoercive mappings, the set of common fixed points for nonexpansive semigroups, and the set of common fixed points for an infinite family of strictly pseudocontractive mappings in Hilbert spaces. Furthermore, we prove a strong convergence theorem of the iterative sequence generated by the proposed iterative algorithm under some suitable conditions which solves some optimization problems. Our results extend and improve the recent results of Chang et al. (2010) and many others.

1. Introduction

Let H be a real Hilbert space with inner product 〈·, ·〉 and norm ∥·∥. Let C be a nonempty closed convex subset of H. Recall that a mapping T : CC is nonexpansive if
()
We denote the set of fixed points of T by F(T), that is F(T) = {xC : x = Tx}. A mapping f : CC is said to be an α-contraction if there exists a coefficient α ∈ (0,1) such that
()
Let B : CH be a mapping. Then B is called:
  • (1)

    monotone if

    ()

  • (2)

    d-strongly monotone if there exists a positive real number d such that

    ()
    for constant d > 0, this implies that
    ()
    that is, B is d-expansive and when d = 1, it is expansive;

  • (3)

    L-Lipschitz continuous if there exists a positive real number L such that

()
  • (4)

    c-cocoercive [1, 2] if there exists a positive real number c such that

    ()
    Clearly, every c-cocoercive map B is (1/c)-Lipschitz continuous;

  • (5)

    relaxed c-cocoercive, if there exists a positive real number c such that

    ()

  • (6)

    relaxed (c, d)-cocoercive, if there exists a positive real number c, d such that

    ()
    for c = 0, B is d-strongly monotone. This class of mapping is more general than the class of strongly monotone mapping. It is easy to see that we have the following implication: d-strongly monotonicity implying relaxed (c, d)-cocoercivity,

  • (7)

    k-strictly pseudocontractive, if there exists a constant k ∈ [0,1) such that

    ()

Remark 1.1 (see [3], Remark  1.1 pages 135-136.)If B : CH is a LB-Lipschitz continuous and relaxed (c, d)-cocoercive mapping with and , then IτB satisfies the following:

()
where .

Similarly, if D : CH  is  LD-Lipschitz continuous and relaxed (c, d)-cocoercive mapping with and , then the mapping IδD satisfies the following:

()
where .

Let A be a strongly positive linear bounded operator on H if there is a constant with the property
()
We recall optimization problem (for short, OP) as the following
()
where are infinitely closed convex subsets of H such that , uH, μ ≥ 0 is a real number, A is a strongly positive linear bounded operator on H, and h is a potential function for γf (i.e., h(x) = γf(x) for xH). This kind of optimization problem has been studied extensively by many authors, see, for example, [47] when and h(x) = 〈x, b〉, where b is a given point in H.
On the other hand, a family 𝒮 = {S(s) : 0 ≤ s < } of mappings of C into itself is called a nonexpansive semigroup on C if it satisfies the following conditions:
  • (i)

    S(0)x = x for all xC;

  • (ii)

    S(s + t) = S(s)S(t) for all s, t ≥ 0;

  • (iii)

    S(s)xS(s)y∥≤∥xy∥ for all x, yC and s ≥ 0;

  • (iv)

    for all xC,   sS(s)x is continuous.

We denote by F(𝒮) the set of all common fixed points of 𝒮 = {S(s) : s ≥ 0}, that is, F(𝒮) = ∩s≥0F(S(s)). It is known that F(𝒮) is closed and convex.

Let ϕ : C be a real-valued function and let {Θk : C × C,   k = 1,2, …, N} be a finite family of equilibrium functions, that is, Θk(u, u) = 0 for each uC. The system of mixed equilibrium problems (for short, SMEP) for function (Θ1, Θ2, …, ΘN, ϕ) is to find zC such that
()
The set of solutions of (1.15) is denoted by , where MEP⁡(Θk, ϕ) is the set of solutions of the mixed equilibrium problem (for short, MEP), which is to find zC such that
()
In particular, if ϕ ≡ 0, and N = 1, then the problem (1.15) reduces to the equilibrium problem (for short, EP), which is to find zC such that
()
It is well known that the SMEP includes fixed point problem, optimization problem, variational inequality problem, and Nash equilibrium problem as its special cases (see [813] for more details).
For solving the solutions of a nonexpansive semigroup and the solutions of the system of mixed equilibrium problems were studied by many authors see [1423] and reference therein. In 2010, Chang et al. [24] studied the following approximation method:
()
where
()
is the mapping defined by (2.22) below, Wn is the mapping defined by (2.12), and 𝒮 = {S(s) : 0 ≤ s < } is a nonexpansive semigroup. They proved that {xn} converges strongly to a fixed point of under control conditions on the parameters.
Let B, D : CH be two mappings. The general system of variational inequalities problem (see [25]) is to find (x*, y*) ∈ C × C such that
()
where τ and δ are two positive real numbers. The set of solutions of the general system of variational inequalities problem is denoted by SVI(C, B, D). In particular, if B = D, then the problem (1.20) reduces to the following equation:
()
which is defined by Verma [26] (see also Verma [27]), and is called the new system of variational inequalities. Further, if we set D = 0, then problem (1.20) reduces to the classical variational inequality is to find x*C such that
()
We denoted by VI⁡(C, B) the set of solutions of the variational inequality problem. The variational inequality problem has been extensively studied in literature, see, for example, [2831] and references therein. In order to find the solutions of the general system of variational inequality problem (1.20), Wangkeeree and Kamraksa [32] considered the following iterative algorithm:
()
where B, D : CH is a LB-Lipschitz continuous and relaxed (c, d)-cocoercive mapping and LD-Lipschitz continuous and relaxed (c, d)-cocoercive mapping, respectively. They proved that {xn} converges strongly to a fixed point of F(Wn)∩MEP⁡(Θ, ϕ)∩SVI(C, B, D) which is a solution of general system of variational inequality (1.20). Very recently, Jaiboon and Kumam [33] studied a new general iterative method for finding a common element of the set of solution of a mixed equilibrium problem, the set of fixed points of an infinite family of nonexpansive mappings, and the set of solutions of variational inequalities for an inverse-strongly monotone mapping in Hilbert spaces, which solves some optimization problems.

Inspired and motivated by Chang et al. [24], Jaiboon and Kumam [33], Kumam and Jaiboon [34] and Wangkeeree and Kamraksa [32], the purpose of this paper is to introduce an iterative algorithm for finding a common element of the set of solutions of (1.15), the set of solutions of (1.20) for Lipschitz continuous and relaxed cocoercive mappings, the set of common fixed points for nonexpansive semigroup, and the set of common fixed points for an infinite family of strictly pseudocontractive mappings. Consequently, we prove the strong convergence theorem in Hilbert spaces under control conditions on the parameters. Furthermore, we can apply our results for solving some optimization problems. Our results extend and improve the corresponding results in Chang et al. [24], Kumam and Jaiboon [34], Wangkeeree and Kamraksa [32], and many others.

2. Preliminaries

Let H a real Hilbert space and C a nonempty closed convex subset of H. We denote strong convergence (weak convergence) by notation →(⇀). In a real Hilbert space H, it is well known that
()
()
()
()
for all x, yH and λ.
Recall that for every point xH, there exists a unique nearest point in C, denoted by PCx, such that
()
PC is called the metric projection of H onto C. It is well known that PC is a nonexpansive mapping of H onto C and satisfies
()
for every x, yH. Obviously, this immediately implies that
()
Moreover, PCx is characterized by the following properties: PCxC and
()
for all xH,   yC.

In order to prove our main results, we need the following lemmas.

Lemma 2.1 (see [35].)Let V : CH be a k-strict pseudo-contraction, then

  • (1)

    the fixed point set F(V) of V is closed convex so that the projection PF(V) is well defined;

  • (2)

    define a mapping T : CH by

    ()
    If t ∈ [k, 1), then T is a nonexpansive mapping such that F(V) = F(T).

A family of mappings is called a family of uniformly k-strict pseudo-contractions, if there exists a constant k ∈ [0,1) such that
()
Let be a countable family of uniformly k-strict pseudo-contractions. Let be the sequence of nonexpansive mappings defined by (2.9), that is,
()
Let {Ti} be a sequence of nonexpansive mappings of C into itself defined by (2.11) and let {μi} be a sequence of nonnegative numbers in [0,1]. For each n ≥ 1, define a mapping Wn of C into itself as follows:
()
Such a mapping Wn is nonexpansive from C to C and it is called the W-mapping generated by T1, T2, …, Tn and μ1, μ2, …, μn.

For each n, k, let the mapping Un,k be defined by (2.12). Then we can have the following crucial conclusions concerning Wn. You can find them in [36]. Now we only need the following similar version in Hilbert spaces.

Lemma 2.2 (see [36].)Let C be a nonempty closed convex subset of a real Hilbert space H. Let T1, T2, … be nonexpansive mappings of C into itself such that is nonempty, let μ1, μ2, … be real numbers such that 0 ≤ μnb < 1 for every n ≥ 1. Then,

  • (1)

    Wn is nonexpansive and , for all n ≥ 1;

  • (2)

    for every xC and k, the limit lim⁡nUn,kx exists;

  • (3)

    a mapping W : CC defined by

    ()
    is a nonexpansive mapping satisfying and it is called the W-mapping generated by T1, T2, … and μ1, μ2, ….

Lemma 2.3 (see [37].)Let C be a nonempty closed convex subset of a Hilbert space H, {Ti : CC} a countable family of nonexpansive mappings with , {μi} a real sequence such that 0 < μib < 1,   for  all  i ≥ 1. If D is any bounded subset of C, then

()

Lemma 2.4 (see [38].)Each Hilbert space H satisfies Opial’s condition, that is, for any sequence {xn} ⊂ H with xnx, the inequality

()
holds for each yH with yx.

Lemma 2.5 (see [39].)Assume A is a strongly positive linear bounded operator on H with coefficient and 0 < ρ ≤ ∥A−1. Then, .

For solving the system of mixed equilibrium problems (1.15), let us assume that function Θk : H × H,   k = 1,2, …, N satisfies the following conditions:
  • (H1)

    Θk is monotone, that is, Θk(x, y) + Θk(y, x) ≤ 0, for all x,   yH;

  • (H2)

    for each fixed yH, x ↦ Θk(x, y) is convex and upper semicontinuous;

  • (H3)

    for each xH,   y ↦ Θk(x, y) is convex.

Let η : H × HH and B : HH be two mappings. B is said to be
  • (1)

    monotone if

    ()

  • (2)

    d-strongly monotone if there exists a positive real number d such that

    ()

  • (3)

    L-Lipschitz continuous if there exists a constant L > 0 such that

    ()

Let K : H be a differentiable functional on H, which is called:
  • (1)

    η-convex [40] if

    ()
    where K(x) is the Fréchet derivative of K at x;

  • (2)

    η-strongly convex [41] if there exists a constant σ > 0 such that

    ()

In particular, if η(x, y) = xy for all x, yH, then K is said to be strongly convex.

Lemma 2.6 (see [42].)Let H be a real Hilbert space and let ϕ be a lower semicontinuous and convex functional from H to . Let Θ be a bifunction from H × H to satisfying (H1)–(H3). Assume that

  • (i)

    η : H × HH is λ-Lipschitz continuous with constant λ > 0 such that

    • (a)

      η(x, y) + η(y, x) = 0,   for  all  x, yH,

    • (b)

      η(·, ·) is affine in the first variable,

    • (c)

      for each fixed xH, yη(x, y) is sequentially continuous from the weak topology to the weak topology;

  • (ii)

    K : H is η-strongly convex with constant σ > 0 and its derivative K is sequentially continuous from the weak topology to the strong topology;

  • (iii)

    for each xH, there exist bounded subsets ExH and zxH such that for any yHEx,

    ()
    For given r > 0, let be the mapping defined by
    ()

for all xH. Then
  • (1)

    is single-valued.

  • (2)

    , where MEP⁡(Θ, ϕ) is the set of solution of the mixed equilibrium problem,

    ()

  • (3)

    MEP⁡(Θ, ϕ) is closed and convex.

Lemma 2.7 (see [43].)Let {xn} and {vn} be bounded sequences in a Banach space X and let {βn} be a sequence in [0,1] with 0 < liminf⁡nβn ≤ limsup⁡nβn < 1. Suppose xn+1 = (1 − βn)vn + βnxn for all integers n ≥ 0 and limsup⁡n(∥vn+1vn∥−∥xn+1xn∥) ≤ 0. Then, lim⁡nvnxn∥ = 0.

Lemma 2.8 (see [44].)Assume {xn} is a sequence of nonnegative real numbers such that

()
where {an} is a sequence in (0,1) and {bn} is a sequence in such that
  • (1)

    ,

  • (2)

    limsup⁡n(bn/an) ≤ 0 or .

Then, lim⁡nxn = 0.

Lemma 2.9 (see [45].)Let C be a nonempty closed convex subset of a real Hilbert space H and g : C ∪ {} a proper lower-semicontinuous differentiable convex function. If z is a solution to the minimization problem

()
then
()
In particular, if z solves problem OP, then
()

Lemma 2.10 (see [46].)Let C be a nonempty bounded closed convex subset of a Hilbert space H and let 𝒮 = {S(s) : 0 ≤ s < } be a nonexpansive semigroup on C, then for any h ≥ 0,

()

Lemma 2.11 (see [47].)Let C be a nonempty bounded closed convex subset of H, {xn} a sequence in C, and 𝒮 = {S(s) : 0 ≤ s < } a nonexpansive semigroup on C. If the following conditions are satisfied:

  • (i)

    xnz;

  • (ii)

    limsup⁡slimsup⁡nS(s)xnxn∥ = 0, then z𝒮.

Lemma 2.12 (see [25].)For given x*, y*C and (x*, y*) is a solution of the problem (1.20) if and only if x* is a fixed point of the mapping G : CC is defined by

()
where y* = PC(xδDx), δ and τ are positive constants and B, D : HH are two mappings.

Throughout this paper, the set of fixed points of the mapping G is denoted by SVI(C, B, D).

Lemma 2.13 (see [32].)Let G : CC be defined in Lemma 2.12. If B : HH is a LB-Lipschitzian and relaxed (c, d)-cocoercive mapping and D : HH is a LD-Lipschitz and relaxed (c, d)-cocoercive mapping where and , then G is nonexpansive.

Lemma 2.14 (demiclosedness principle [48]). Assume that S is a nonexpansive self-mapping of a nonempty closed convex subset C of a real Hilbert space H. If S has a fixed point, then IS is demiclosed; that is, whenever {xn} is a sequence in C converging weakly to some xC (for short, xnxC), and the sequence {(IS)xn} converges strongly to some y (for short, (IS)xny), it follows that (IS)x = y. Here I is the identity operator of H.

3. Main Results

In this section, we prove a strong convergence theorem of an iterative algorithm (3.1) for finding the solutions of a common element of the set of solutions of (1.15), the set of solutions of (1.20) for Lipschitz continuous and relaxed cocoercive mappings, the set of common fixed points for nonexpansive semigroups, and the set of common fixed points for an infinite family of strictly pseudocontractive mappings in a real Hilbert space.

Theorem 3.1. Let C be a nonempty closed convex subset of a real Hilbert space H which C + CC and let f be a contraction of C into itself with α ∈ (0,1). Let ϕ be a lower semicontinuous and convex functional from H to and let {Θk : H × H,   k = 1,2, …, N} be a finite family of equilibrium functions satisfying conditions (H1)–(H3). Let 𝒮 = {S(s) : 0 ≤ s < } be a nonexpansive semigroup on C and let {tn} be a positive real divergent sequence. Let be a countable family of uniformly k-strict pseudo-contractions, let be the countable family of nonexpansive mappings defined by Tix = tx + (1 − t)Vix,   for  all  xC,   for  all  i ≥ 1,   t ∈ [k, 1), let Wn be the W-mapping defined by (2.12), and let W be a mapping defined by (2.13) with F(W) ≠ . Let A be a strongly positive linear bounded operator on H with coefficient and let , B : HH be a LB-Lipschitz continuous and relaxed (c, d)-cocoercive mapping with , and let D : HH be a LD-Lipschitz continuous and relaxed (c, d)-cocoercive mapping with . Suppose that Ω : = F(𝒮)∩F(W)∩𝔉∩SVI(C, B, D) ≠ , where . Let μ > 0, γ > 0 and rk > 0,   k = 1,2, …, N, which are constants. For given x1H arbitrarily and fixed uH, suppose {xn}, {yn}, {zn} and are the sequences generated iteratively by

()
where
()
is the mapping defined by (2.22) and {αn} and {βn} are two sequences in (0,1) for all n. Assume the following conditions are satisfied:
  • (C1)

    η : H × HH is λ-Lipschitz continuous with constant λ > 0 such that

    • (a)

      η(x, y) + η(y, x) = 0,   for  all  x, yH,

    • (b)

      xη(x, y) is affine,

    • (c)

      for each fixed yH, yη(x, y) is sequentially continuous from the weak topology to the weak topology;

  • (C2)

    K : H is η-strongly convex with constant σ > 0 and its derivative K is not only sequentially continuous from the weak topology to the strong topology but also Lipschitz continuous with a Lipschitz constant ν > 0 such that σ > λν;

  • (C3)

    for each k ∈ {1,2, …, N} and for all xH, there exist bounded subsets ExH and zxH such that for any yHEx,

    ()

  • (C4)

    lim⁡nαn = 0 and ;

  • (C5)

    0 < liminf⁡nβn ≤ limsup⁡nβn < 1;

  • (C6)

    and .

Then, {xn} converges strongly to x* ∈ Ω, which solves the following optimization problem (OP):
()
and (x*, y*) is a solution of the general system of variational inequality problem (1.20) such that y* = PC(x*δDx*).

Proof. By the condition (C4) and (C5), we may assume, without loss of generality, that αn ≤ (1 − βn)(1 + μA∥) −1 for all n. Indeed, A is a strongly positive bounded linear operator on H, we have

()
Observe that
()
so this shows that (1 − βn)Iαn(I + μA) is positive. It follows that
()
We shall divide the proofs into several steps.

Step 1. We show that {xn} is bounded.

Let . In fact, by the assumption that for each k ∈ {1,2, …, N}, is nonexpansive. Let and 𝒜0 = I. Then, we have x* = 𝒜Nx* and . Since x* ∈ SVI(C, B, D), then

()
Putting y* = PC(x*δDx*) = PC(IδD)𝒜Nx*, we have x* = PC(y*τBy*). Since x* = S(s)x*,   for  all  s ≥ 0 and x* = Wnx*,   for  all  n ≥ 1, therefore, we have
()
Because PC and 𝒜N are nonexpansive mappings and from Remark 1.1, we have
()
which yields that
()
It follows from (3.11) and induction that
()
Hence, {xn} is bounded, so are {yn}, {zn}, {Wnxn}, {f(Wnxn)}, for all k = 1,2, …, N and {KnWnyn}, where .

Step 2. We prove that lim⁡nxn+1xn∥ = 0 and .

Again, from Remark 1.1, we have the following estimates:

()
On the other hand, since Ti and Un,i are nonexpansive, we have
()
where M1 ≥ 0 is a constant such that ∥Un+1,n+1ynUn,n+1yn∥≤M1 for all n ≥ 0. It follows from (3.13) and (3.14) that we have
()
It follows that
()
where M2 = max⁡{∥S(s)Wnyn∥}.

Setting xn+1 = (1 − βn)vn + βnxn, for all n ≥ 1, we have

()
Then, we obtain
()
It follows from (3.16) and (3.18) that
()
By the conditions (C4), (C5) and from tn ∈ (0, ), tn and 0 < μib < 1, for  all  i ≥ 1, we have
()
Hence, by Lemma 2.7, we obtain
()
It follows that
()
Applying (3.22) into (3.13), we obtain that
()

Step 3. We show that lim⁡nKnWnynyn∥ = 0, lim⁡nynS(s)yn∥ = 0, and , where .

Since xn+1 = αn(u + γf(Wnxn)) + βnxn + ((1 − βn)Iαn(I + μA))KnWnyn, we have

()
that is
()
By (C4), (C5), and (3.22) it follows that
()

Since is firmly nonexpansive, , where and x* ∈ Ω, we have

()
and hence
()
Observe that
()
where
()
It follows from condition (C4) that
()
Putting (3.28) into (3.29) and using also (3.10), we have
()
It follows that
()
Therefore, by (3.22) and (3.31), we get
()
Since
()
and by (3.26) and (3.70), we have
()
Since B is a LB-Lipschitz continuous and relaxed (c, d)-cocoercive mapping on B and for any x* ∈ Ω, we have
()
Similarly, since D is a LD-Lipschitz continuous and relaxed (c, d)-cocoercive mapping on D and , we also have
()
Substituting (3.37) into (3.29), we have
()
Again, substituting (3.38) into (3.29) and using also (3.10), we get
()
Therefore, by (3.39) and (3.40), we have
()
It follows from (3.22) and (3.31) that we obtain
()
()
From (2.6), we have
()
So, we obtain
()
By (3.29), we get
()
which implies that
()
From (3.22), (3.31), and (3.43), we have
()
Now, from (2.2) and (2.7), we observe that
()
It follows from (3.36), (3.42), and (3.48) that we have
()
since
()
It follows from (3.36), (3.48) and (3.50), we get
()
and from (3.26), and (3.52) that we have
()
Since {Wnyn} is a bounded sequence in C, from Lemma 2.10 for all s ≥ 0, we have
()
and since
()
it follows from (3.52) and (3.54) that we get
()

On the other hand, since is firmly nonexpansive, and x* ∈ Ω, we have

()
and hence
()
From (3.10), (3.29), and (3.58), for each k = 1,2, …, N − 1, we have
()
It follows that
()
Therefore, by (3.22) and (3.31), we get
()

Step 4. We prove that

()
where x* is a solution of the optimization problem:
()
To show this inequality, we can choose a subsequence of {yn} such that
()

Since is bounded, there exists a subsequence of which converges weakly to zC. Without loss of generality, we can assume that . From (3.53), we get .

Next, we show that z ∈ Ω : = F(𝒮)∩F(W)∩𝔉∩SVI(C, B, D), where .

(1) First, we prove that zF(𝒮). Indeed, from Lemma 2.11 and (3.56), we get zF(𝒮), that is, z = S(s)z,   for  all  s ≥ 0.

(2) Next, we show that , where and F(Wn+1) ⊂ F(Wn). Assume that zF(W), then there exists a positive integer m such that zF(Tm) and so . Hence for any , that is, zWnz. This together with z = S(s)z,   for  all  s ≥ 0, shows z = S(s)zS(s)Wnz,   for  all  s ≥ 0; therefore, we have zKnWnz, for  all  nm. It follows from the Opial’s condition and (3.52) that

()
which is a contradiction. Thus, we get zF(W).

(3) Now, we prove that z𝔉. Since , and , we have

()
It follows that
()
for all xH. From (3.61) and by conditions (C1)(c) and (C2), we get
()
By the assumption that ϕ is lower semicontinuous, then it is weakly lower semicontinuous and by the condition (H2) that x ↦ (−Θi(x, y)) is lower semicontinuous, then it is weakly lower semicontinuous. Since , it follows from (3.36), (3.52), and (3.61) that for each k = 1,2, …, N − 1. Taking the lower limit ni in (3.67), we have
()
Therefore, .

(4) Next, we show that z ∈ SVI(C, B, D). By (3.36) and (3.52), we have

()
By Lemma 2.13 that G is a nonexpansive, we obtain
()
Thus,
()
By Lemma 2.14, we obtain that z ∈ SVI(C, B, D). Hence z ∈ Ω is proved.

Now, from Lemma 2.9, (3.64), and (3.53), we have

()
By (3.52), (3.53), and (3.73), we obtain
()

Step 5. Finally, we show that xnx*. From (3.1), we obtain

()
Since {xn}, {f(Wnxn)}, and {KnWnyn} are bounded, there exist M > 0 such that
()
for all n ≥ 0. It follows that
()
where
()
Applying Lemma 2.8 to (3.77), we conclude that xnx*. This completes the proof.

Remark 3.2. For example, of the control conditions (C4)–(C6), we set αn = 1/10n,   βn = n/(n + 1). We set B, D is a 1-Lipschitz continuous and relaxed (0,1)-cocoercive mapping, (i.e., LB = 1 = LD and c = 0 = c,   d = 1 = d).

Then, we can choose τ ∈ (0,2) and δ ∈ (0,2) which satisfies the condition (C6) in Theorem 3.1.

Corollary 3.3. Let C be a nonempty closed convex subset of a real Hilbert space H which C + CC and let f be a contraction of C into itself with α ∈ (0,1). Let ϕ be a lower semicontinuous and convex functional from H to and let Θ : H × H be a finite family of equilibrium functions satisfying conditions (H1)–(H3). Let 𝒮 = {S(s) : 0 ≤ s < } be a nonexpansive semigroup on C and let {tn} be a positive real divergent sequence. Let be a countable family of uniformly k- strict pseudo-contractions, let be the countable family of nonexpansive mappings defined by Tix = tx + (1 − t)Vix,   for  all  xC,   for  all  i ≥ 1, t ∈ [k, 1), let Wn be the W-mapping defined by (2.12), and let W be a mapping defined by (2.13) with F(W) ≠ . Let A be a strongly positive linear bounded operator on H with coefficient and let , B : HH be a LB-Lipschitz continuous and relaxed (c, d)-cocoercive mapping with , and let D : HH be a LD-Lipschitz continuous and relaxed (c, d)-cocoercive mapping with . Suppose that Ω : = F(𝒮)∩F(W)∩MEP⁡(Θ, ϕ)∩SVI(C, B, D) ≠ . Let μ > 0, γ > 0 and r > 0, which are constants. For given x1H arbitrarily and fixed uH, suppose {xn}, {yn},{zn}, and{un} are the sequences generated iteratively by

()
where such that is the mapping defined by (2.22) and {αn} and {βn} are two sequences in (0,1) for all n. If the functions η : H × HH and K : H satisfy the conditions (C1)–(C6) as given in Theorem 3.1, then {xn} converges strongly to x* ∈ Ω, which solves the following optimization problem (OP):
()
and (x*, y*) is a solution of the general system of variational inequality problem (1.20) such that y* = PC(x*δDx*).

Proof. Taking N = 1 in Theorem 3.1. Hence, the conclusion follows. This completes the proof.

Corollary 3.4. Let C be a nonempty closed convex subset of a real Hilbert space H which C + CC and let f be a contraction of C into itself with α ∈ (0,1). Let 𝒮 = {S(s) : 0 ≤ s < } be a nonexpansive semigroup on C and let {tn} be a positive real divergent sequence. Let be a countable family of uniformly k-strict pseudo-contractions, let be the countable family of nonexpansive mappings defined by Tix = tx + (1 − t)Vix,   for  all  xC,   for  all  i ≥ 1, t ∈ [k, 1), let Wn be the W-mapping defined by (2.12), and let W be a mapping defined by (2.13) with F(W) ≠ . Let A be a strongly positive linear bounded operator on H with coefficient and let , B : HH be a LB-Lipschitz continuous and relaxed (c, d)-cocoercive mapping with , and let D : HH be a LD-Lipschitz continuous and relaxed (c, d)-cocoercive mapping with . Suppose that Ω : = F(𝒮)∩F(W)∩SVI(C, B, D) ≠ . Let μ > 0 and γ > 0, which are constants. For given x1H arbitrarily and fixed uH, suppose {xn}, {yn}, and{zn} are the sequences generated iteratively by

()
where {αn} and {βn} are two sequences in (0,1) for all n. If the sequence {xn} satisfy the conditions (C1)–(C6) as given in Theorem 3.1, then {xn} converges strongly to x* ∈ Ω, which solves the following optimization problem (OP):
()
and (x*, y*) is a solution of the general system of variational inequality problem (1.20) such that y* = PC(x*δDx*).

Proof. Put Θ(x, y) ≡ ϕ(x) ≡ 0 for all x, yH and r = 1. Take K(x) = ∥x2/2 and η(y, x) = yx, for all x, yH. Then, we get un = PCxn = xn in Corollary 3.3. Hence, the conclusion follows. This completes the proof.

Corollary 3.5. Let C be a nonempty closed convex subset of a real Hilbert space H and let f be a contraction of H into itself with α ∈ (0,1). Let 𝒮 = {S(s) : 0 ≤ s < } be a nonexpansive semigroup on C and let {tn} be a positive real divergent sequence. Let A be a strongly positive linear bounded operator on H with coefficient and let , B : HH be a LB-Lipschitz continuous and relaxed (c, d)-cocoercive mapping with . Suppose that Ω : = F(𝒮)∩B−10 ≠ . Let μ > 0 and γ > 0, which are constants. For given x1H arbitrarily and fixed uH, suppose the {xn}, {yn}, and {zn} are the sequences generated iteratively by

()
where {αn} and {βn} are two sequences in (0,1) for all n. If the sequence {xn} satisfy the conditions (C1)–(C6) as given in Theorem 3.1, then {xn} converges strongly to x* ∈ Ω.

Proof. Setting τ = δ, CH, DB and WnPHI in Corollary 3.4, it follows from the proof of Theorem  4.1 in [25] that B−10 = VI⁡(H, B). Hence, the conclusion follows. This completes the proof.

Acknowledgments

The authors would like to thank the “Centre of Excellence in Mathematics” under the Commission on Higher Education, Ministry of Education, Thailand. Moreover, the authors are grateful to the reviewers for the careful reading of the paper and for the suggestions which improved the quality of this work.

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