Volume 2012, Issue 1 150145
Research Article
Open Access

Viscosity Approximation Methods for Equilibrium Problems, Variational Inequality Problems of Infinitely Strict Pseudocontractions in Hilbert Spaces

Aihong Wang

Corresponding Author

Aihong Wang

College of Science, Civil Aviation University of China, Tianjin 300300, China cauc.edu.cn

Search for more papers by this author
First published: 26 September 2012
Academic Editor: Hong-Kun Xu

Abstract

We introduce an iterative scheme by the viscosity approximation method for finding a common element of the set of the solutions of the equilibrium problem and the set of fixed points of infinitely strict pseudocontractive mappings. Strong convergence theorems are established in Hilbert spaces. Our results improve and extend the corresponding results announced by many others recently.

1. Introduction

Let H be a real Hilbert space and let C be a nonempty convex subset of H.

A mapping S of C is said to be a κ-strict pseudocontraction if there exists a constant κ ∈ [0,1) such that
()
for all x, yC; see [1]. We denote the set of fixed points S by F(S) (i.e., F(S) = {xC : Sx = x}).
Note that the class of strict pseudocontraction strictly includes the class of nonexpansive mappings which are mappings S on C such that
()
for all x, yC. That is, S is nonexpansive if and only if S is a 0-strict pseudocontraction. Let Φ be a bifunction from C × C to , where is the set of real numbers. The equilibrium problem for Φ : C × C is to find xC such that
()
The set of solutions of (1.3) is denoted by EP(Φ). Given a mapping B : CH, let Φ(x, y) = 〈Bx, yx〉 for all x, yC. Then the classical variational inequality problem is to find xC such that 〈Bx, yx〉≥0. We denote the solution of the variational inequality by VI (C, B); that is
()
Let A be a strongly positive linear-bounded operator on H if there is a constant with property
()
A typical problem is to minimize a quadratic function over the set of the fixed points a nonexpansive mapping on a real Hilbert space H:
()
where A is a linear-bounded operator, E is the fixed point set of a nonexpansive mapping S on H, and b is a given point in H. The problem (1.3) is very general in the sense that it includes, as special cases, optimization problems, variational inequalities, minimax problems, the Nash equilibrium problem in noncooperative games, and others; see [111]. In particular, Combettes and Hirstoaga [4] proposed several methods for solving the equilibrium problem. On the other hand, Mann [6], Shimoji and Takahashi [8] considered iterative schemes for finding a fixed point of a nonexpansive mapping. Further, Acedo and Xu [12] projected new iterative methods for finding a fixed point of strict pseudocontractions.
In 2006, Marino and Xu [7] introduced the general iterative method: for x1 = xC,
()
They proved that the sequence {xn} of parameters satisfies appropriate condition and that the sequence {xn} generated by (1.7) converges strongly to the unique solution of the variational inequality 〈(γfA)q, pq〉≤0,   pF(T). Recently, Liu [5] considered a general iterative method for equilibrium problems and strict pseudocontractions:
()
where S is a k-strict pseudocondition mapping and {εn}, {βn} are sequences in (0,1). They proved that under certain appropriate conditions over {εn}, {βn}, and {rn}, the sequences {xn} and {un} both converge strongly to some qF(S)⋂EP(Φ), which solves some variational inequality problems. Tian [10] proposed a new general iterative algorithm: for nonexpansive mapping T : HH with F(T) ≠ ϕ,
()
where F is a k-Lipschitzian and η-strong monotone operator. He obtained that the sequence xn generated by (1.9) converges to a point q in F(T), which is the unique solution of the variational inequality 〈(γfA)q, pq〉≤0,   pF(T). Very recently, Wang [13] considered a general composite iterative method for infinite family strict pseudocontractions: for x1 = xC,
()
where Wn is a mapping defined by (2.5), F is a k-Lipschitzian, and η-strongly monotone operator. With some appropriate condition, the sequence {xn} generated by (1.10) converges strongly to a common element of the fixed point of an infinite family of λi-strictly pseudocontractive mapping, which is a unique solution of the variational inequality 〈(γfA)q, pq〉≤0,   pF(T). Kumam proposed many algorithms for the equilibrium and the fixed point problems with k-strict pseudoconditions; see [1416]. In particular, in 2011, Kumam and Jaiboon [14] considered a system of mixed equilibrium problems, variational inequality problems, and strict pseudocontractive mappings:
()
where S is a k-strict pseudocondition mapping. They proved that under certain appropriate conditions over {εn}, {βn}, {rn}, {an}, {bn}, {cn}, {λn}, and {μn}, the sequence {xn} converges strongly to a point q ∈ Θ which is the unique solution of the variational inequality 〈(Aγf)q, xq〉≥0. Inprasit [17] proposed a viscosity approximation methods to solving the generalized equilibrium and fixed point problems of finite family of nonexpansive mapping in Hilbert spaces.

In this paper, motivated by the above facts, we use the viscosity approximation method to find a common element of the set of solutions of the equilibrium problem VI (C, B) and the set of fixed points of a infinite family of strict pseudocontractions.

2. Preliminaries

Throughout this paper, we always write ⇀ for weak convergence and → for strong convergence. We need some facts and tools in a real Hilbert space H which are listed as below.

Lemma 2.1. Let H be a real Hilbert space. There hold the following identities:

  • (i)

    xy2 = ∥x2 − ∥y2 − 2〈xy, y〉,   x, yH,

  • (ii)

    tx + (1 − t)y2 = tx2 + (1 − t)∥y2t(1 − t)∥xy2,   ∀ t ∈ [0,1],   ∀ x, yH.

Lemma 2.2 (see [18].)Assume that {αn} is a sequence of nonnegative real numbers such that

()
where {ρn} is a sequence in (0,1) and {σn} is a sequence such that
  • (i)

    ,

  • (ii)

    limsup n(σn/ρn) ≤ 0 or .

Then lim nan = 0.

Recall that given a nonempty closed convex subset C of a real Hilbert space H, for any xH, there exists a unique nearest point in C, denoted by PCx, such that
()
for all yC. Such a PC is called the metric (or the nearest point) projection of H onto C. As we all know, y = PCx if and only if there holds the relation:
()

Lemma 2.3 (see [13].)Let A : HH be an L-Lipschitzian and η-strongly monotone operator on a Hilbert space H with L > 0,   η > 0,   0 < μ < 2η/L2, and 0 < t < 1. Then S = (ItμA) : HH is a contraction with contractive coefficient 1 − tτ and τ = (1/2)μ(2ημL2).

Lemma 2.4 (see [1].)Let S : CC be a κ-strict pseudocontraction. Define T : CC by Tx = λx + (1 − λ)Sx for each xC. Then, as λ ∈ [κ, 1), T is a nonexpansive mapping such that F(T) = F(S).

Lemma 2.5 (see [10].)Let H be a Hilbert space and f : HH a contraction with coefficient 0 < α < 1, and A : HH an L-Lipschitzian continuous operator and η-strongly monotone with L > 0,   η > 0. Then for 0 < γ < μη/α,

()
That is, μAγf is strongly monotone with coefficient μηγα.

Let {Sn} be a sequence of κn-strict pseudo-concontractions. Define . Then, by Lemma 2.4, is nonexpansive. In this paper, we consider the mapping Wn defined by
()

Lemma 2.6 (see [8].)Let C be a nonempty closed convex subset of a strictly convex Banach space E, let be nonexpansive mappings of C into itself such that , and let t1, t2, … be real numbers such that 0 < tib < 1, for every i = 1,2, …. Then, for any xC and kN, the limit lim nUn,kx exists.

Using Lemma 2.6, one can define the mapping W of C into itself as follows:
()

Lemma 2.7 (see [8].)Let C be a nonempty closed convex subset of a strictly convex Banach space E. Let be nonexpansive mappings of C into itself such that , and let t1, t2, … be real numbers such that 0 < tib < 1, for all i ≥ 1. If K is any bounded subset of C, then

()

Lemma 2.8 (see [3].)Let C be a nonempty closed convex subset of a Hilbert space be a family of infinite nonexpansive mappings with , and let t1, t2, … be real numbers such that 0 < tib < 1, for every i = 1,2, …. Then .

For solving the equilibrium problem, let us assume that the bifunction Φ satisfies the following conditions:
  • (A1)

    Φ(x, x) = 0 for all xC;

  • (A2)

    Φ is monotone; that is Φ(x, y) + Φ(y, x) ≤ 0 for any x, yC;

  • (A3)

    for each x, y, zC,   limsup t→0Φ(tz + (1 − t)x, y) ≤ Φ(x, y);

  • (A4)

    Φ(x, ·) is convex and lower semicontinuous for each xC.

We recall some lemmas which will be needed in the rest of this paper.

Lemma 2.9 (see [2].)Let C be a nonempty closed convex subset of H, let Φ be bifunction from C × C to satisfying (A1)–(A4), and let r > 0 and xH. Then there exists zC such that

()

Lemma 2.10 (see [4].)Let ϕ be a bifunction from C × C into satisfying (A1)–(A4). Then, for any r > 0 and xH, there exists zC such that

()
Further, if Trx = {zC; Φ(z, y)+(1/r)〈yz, zx〉≥0, ∀yC}, then the following hold:
  • (1)

    Tr is single-valued;

  • (2)

    Tr is firmly nonexpansive;

  • (3)

    F(Tr) = EP(ϕ);

  • (4)

    EP(ϕ) is closed and convex.

Lemma 2.11 (see [9].)Let {xn} and {zn} be bounded sequences in a Banach space, and let {βn} be a sequence of real numbers such that 0 < liminf nβn ≤ limsup nβn < 1 for all n = 0,1, 2, …. Suppose that xn+1 = (1 − βn)zn   +   βnxn for all n = 0,1, 2, …. and lim  sup nzn+1zn∥−∥xn+1xn∥≤0. Then lim nznxn∥ = 0.

Lemma 2.12 (see [11].)Let C, H, F, and Trx be as in Lemma 2.9. Then the following holds:

()
for all s, t > 0, and xH.

Lemma 2.13 (see [13].)Let H be a Hilbert space, and let C be a nonempty closed convex subset of H, and T : CC a nonexpansive mapping with F(T) ≠ . If {xn} is a sequence in C weakly converging to x and if {(IT)xn} converges strongly to y, then (IT)x = y.

3. Main Results

Now we start and prove our main result of this paper.

Theorem 3.1. Let C be a nonempty closed convex subset of a real Hilbert space H. Let ϕ be a bifunction from C × C satisfying (A1)–(A4). Let Si : CC be a family κi-strict pseudocontractions for some 0 ≤ κi < 1. Assume the set . Let f be a contraction of H into itself with α ∈ (0,1), and let A be a strongly positive linear bounded operator on H with coefficient γ > 0 and . Let B : CH be an ξ-inverse strongly monotone mapping. Let Wn be the mapping generated by and ti as in (2.5). Let {xn} be a sequence generated by the following algorithm:

()
where {εn}, {βn}, {αn}, and {λn} are sequences in (0,1). Assume that the control sequences satisfy the following restrictions:
  • (i)

    lim nεn = 0 and ;

  • (ii)

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

  • (iii)

    0 < lim n(λn/λn+1) = 1;

  • (iv)

    lim n | αn+1αn | = 0;

  • (v)

    0 < μn ≤ 2ξ;

  • (vi)

    lim nαn = a.

Then {xn} converges strongly to q ∈ Ω which is the unique solution of the variational inequality

()
or equivalent q = PΩ(IA + γf)(q), where P is a metric projection mapping form H onto Ω.

Proof. Since εn → 0, as n, we may assume, without loss of generality, that εn ≤ (1 − βn)∥A−1 for all n. By Lemma 2.3, we know that if 0 ≤ ρ ≤ ∥A−1, then . We will assume that . Since A is a strongly positive bounded linear operator on H, we have

()
Observe that
()
So this shows that (1 − βn)IεnA is positive. It follows that
()

Step 1. We claim that the mapping PΩ(IA + γf) where has a unique fixed point. Let f be a contraction of H into itself with α ∈ (0,1). Then, we have

()
for all x, yH. Since , it follows that PΩ(IA + γf) is a contraction of H into itself. Therefore the Banach contraction mapping principle implies that there exists a unique element qH such that q = PΩ(IA + γf)(q).

Step 2. We shall show that (IμnB) is nonexpansive. Let x, yC. Since B is ξ-inverse strongly monotone and λn < 2α for all n, we obtain

()
where μn ≤ 2ξ, for all nN. So we have that the mapping (IλnA) is nonexpansive.

Step 3. We claim that {xn} is bounded.

Let p ∈ Ω; from Lemma 2.10, we have

()
Note that
()
It follows that
()
By simple induction, we have
()
Hence {xn} is bounded. This implies that {Kn}, {f(xn)} are also bounded.

Step 4. Show that lim sup nxn+1xn∥ = 0.

Observing that and , we get

()
By Lemma 2.10, we obtain
()
In particular, we have
()
Summing up (3.14) and using (A2), we obtain
()
for all yC. It follows that
()
This implies
()
It follows that
()
Hence, we obtain
()
where . By (3.12) and (3.19), we obtain
()
From (2.5), we have
()
where M1 = sup n{∥Un+1,n+1ynUn,n+1yn∥}.

Note that

()
where .

Suppose xn+1 = βnxn + (1 − βn)ln, then ln = (xn+1βnxn)/(1 − βn)  = (εnγf(xn) + ((1 − βn)IεnF)Kn)/(1 − βn).

Hence, we have

()
Then
()
Combining with (i), (iii), and (iv), we have
()
Hence, by Lemma 2.11, we obtain ∥lnxn∥→0 as n. It follows that
()
We also know that
()
So
()

Step 5. We claim that ∥xnWxn∥→0.

Observe that

()
From (A1), (A3), and (3.28), using step 2, we have
()
This implies that
()
Next we want to show lim nxnyn∥ = 0.

Let ; we have

()
Therefore
()
Note that
()
From (3.34), we have
()
It follows that
()
From conditions (i), (vi) and (3.26), we have
()
We also compute
()
()
So, from (3.39), we get
()
It follows that
()
So
()
On the other hand, we also know that
()
and hence
()
So
()
()
Hence
()
From (i), (3.42), and (3.26), we know that
()
From (3.37) and (3.42), we can get
()
On the other hand, we have
()
By (3.30), (3.49), and using Lemma 2.7, we have
()

Step 6. We claim that limsup n〈(Aγf)q, qxn〉≤0, where q = PΩ(IA + γf)(q) is the unique solution of 〈(Aγf)q, xq〉 ≥ 0, for all x ∈ Ω.

Indeed, take a subsequence of {xn} such that

()
Since is bounded, there exists a subsequence of , which converges weakly to p; without loss of generality, we can assume and , we arrive at
()

Step 7. We show that xnq.

Since

()
so
()
Note that
()
which implies that
()
Let
()
then we have
()
Applying Lemma 2.2, we can conclude that {xn} converges strongly to q in norm. This completes the proof.

As direct consequences of Theorem 3.1, we obtain the following corollary.

Corollary 3.2. Let C be a nonempty closed convex subset of a real Hilbert space H. Let F be a bifunction from C × C satisfying (A1)–(A4). Let Si : CC be a family κi-strict pseudocontractions for some 0 ≤ κi < 1. Assume the set . Let f be a contraction of H into itself with α ∈ (0,1) and let A be an α-inverse strongly monotone mapping. Let F be a strongly positive linear-bounded operator on H with coefficient γ > 0 and and τ < 1. Let Wn be the mapping generated by and ti, where Si : CC is a nonexpansive mapping with a fixed point. Let {xn} and {un} be sequences generated by the following algorithm:

()
where{εn}, {βn}, {αn}, and {λn} are sequences in (0,1). Assume that the control sequences satisfy the following restrictions:
  • (i)

    lim nεn = 0 and ;

  • (ii)

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

  • (iii)

    0 < liminf nλn ≤ limsup nλn < 1;

  • (iv)

    lim n | λn+1λn | = lim n | αn+1αn | = 0;

  • (v)

    0 < tnb < 1;

  • (vi)

    λn < 2α.

Then {xn} converges strongly to w ∈ Ω where w = PΩ(IA + γf)w.

Acknowledgments

This research is supported by the Science Research Foundation Program in the Civil Aviation University of China (07kys08) and the Fundamental Research Funds for the Science of the Central Universities (program no. ZXH2012K001).

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