Volume 2012, Issue 1 187421
Research Article
Open Access

Shrinking Projection Method of Fixed Point Problems for Asymptotically Pseudocontractive Mapping in the Intermediate Sense and Mixed Equilibrium Problems in Hilbert Spaces

Pattanapong Tianchai

Corresponding Author

Pattanapong Tianchai

Faculty of Science, Maejo University, Chiangmai 50290, Thailand mju.ac.th

Search for more papers by this author
First published: 31 October 2011
Citations: 1
Academic Editor: Yansheng Liu

Abstract

This paper is concerned with a common element of the set of fixed point for an asymptotically pseudocontractive mapping in the intermediate sense and the set of solutions of the mixed equilibrium problems in Hilbert spaces. The strong convergence theorem for the above two sets is obtained by a general iterative scheme based on the shrinking projection method, which extends and improves that of Qin et al. (2010) and many others.

1. Introduction

Throughout this paper, we always assume that C be a nonempty closed convex subset of a real Hilbert space H with inner product and norm denoted by 〈·, ·〉 and ∥·∥, respectively. For a sequence {xn} in H, we denote the strong convergence and the weak convergence of {xn} to xH by xnx and xnx, respectively. The domain of the function φ : C ∪ {+} is the set
()
Let φ : C ∪ {+} be a proper extended real-valued function, and let Φ be a bifunction from C × C into such that C∩dom φ, where is the set of real numbers. The so-called the mixed equilibrium problem is to find xC such that
()
The set of solution of problem (1.2) is denoted by MEP (Φ, φ), that is,
()
It is obvious that if x is a solution of problem (1.2) then x ∈ dom φ. As special cases of problem (1.2), we have the following.
  • (i)

    If φ = 0, then problem (1.2) is reduced to find xC such that

    ()
    We denote by EP (Φ) the set of solutions of equilibrium problem, which problem (1.4) was studied by Blum and Oettli [1].

  • (ii)

    If Φ(x, y) = 〈Bx, yx〉 for all x, yC where a mapping B : CH, then problem (1.4) is reduced to find xC such that

    ()
    We denote by VI (C, B) the set of solutions of variational inequality problem, which problem (1.5) was studied by Hartman and Stampacchia [2].

  • (iii)

    If Φ = 0, then problem (1.2) is reduced to find xC such that

    ()
    We denote by Argmin(φ) the set of solutions of minimize problem.

Recall that PC is the metric projection of H onto C; that is, for each xH there exists the unique point in PCxC such that ∥xPCx∥ = min yCxy∥. A mapping T : CC is called nonexpansive if ∥TxTy∥≤∥xy∥ for all x, yC, and uniformly L-Lipschitzian if there exists a constant L > 0 such that for each n, ∥TnxTny∥≤Lxy∥ for all x, yC, and a mapping f : CC is called a contraction if there exists a constant α ∈ (0,1) such that ∥f(x) − f(y)∥≤αxy∥ for all x, yC. A point xC is a fixed point of T provided Tx = x. We denote by F(T) the set of fixed points of T; that is, F(T) = {xC : Tx = x}. If C is a nonempty bounded closed convex subset of H and T is a nonexpansive mapping of C into itself, then F(T) is nonempty (see [3]).

Iterative methods are often used to solve the fixed point equation Tx = x. The most well-known method is perhaps the Picard successive iteration method when T is a contraction. Picard′s method generates a sequence {xn} successively as xn+1 = Txn for all n with x1 = x chosen arbitrarily, and this sequence converges in norm to the unique fixed point of T. However, if T is not a contraction (for instance, if T is a nonexpansive), then Picard′s successive iteration fails, in general, to converge. Instead, Mann′s iteration method for a nonexpansive mapping T (see [4]) prevails, generates a sequence {xn} recursively by
()
where x1 = xC chosen arbitrarily and the sequence {αn} lies in the interval [0,1]. Recall that a mapping T : CC is said to be
  • (i)

    asymptotically pseudocontractive [5, 6] if there exists a sequence kn ⊂ [1, ) with lim nkn = 1 such that

    ()
    it is easy to see that (1.8) is equivalent to
    ()
    for all n,

  • (ii)

    asymptotically pseudocontractive in the intermediate sense [7] if there exists a sequence kn ⊂ [1, ) with lim nkn = 1 such that

    ()
    if we define
    ()
    then lim nτn = 0 and it follows that (1.10) is reduced to
    ()
    it is easy to see that (1.12) is equivalent to
    ()
    for all n; it is obvious that if τn = 0 for all n, then the class of asymptotically pseudocontractive mappings in the intermediate sense is reduced to the class of asymptotically pseudocontractive mappings.

The Mann’s algorithm for nonexpansive mappings has been extensively investigated (see [810] and the references therein). One of the well-known results is proven by Reich [10] for a nonexpansive mapping T on C, which asserts the weak convergence of the sequence {xn} generated by (1.7) in a uniformly convex Banach space with a Frechet differentiable norm under the control condition . It is known that the Mann′s iteration (1.7) is in general not strongly convergent (see [11]). The strong convergence guaranteed has been proposed by Nakajo and Takahashi [12], they modified the Mann′s iteration method (1.7) which is to find a fixed point of a nonexpansive mapping by a hybrid method, which called that the shrinking projection method (or the CQ method) as the following theorem.

Theorem NT. Let C be a nonempty closed convex subset of a real Hilbert space H. Let T be a nonexpansive mapping of C into itself such that F(T) ≠ . Suppose that x1 = xC chosen arbitrarily and {xn} the sequence defined by

()
where 0 ≤ αnα < 1. Then {xn} converges strongly to PF(T)(x1).

Subsequently, Schu [5] modified Ishikawa′s iteration method (see [13]) for the class of asymptotically pseudocontractive mappings as the following theorem.

Theorem S. Let C be a nonempty bounded closed convex subset of a real Hilbert space H. Let T : CC be a completely continuous uniformly L-Lipschitzian such that L > 0 and asymptotically pseudocontractive mapping defined as in (1.9) with the sequence {kn}⊂[1, ) such that lim n  kn = 1. Let qn = 2kn − 1 for all n. Suppose that x1 = xC chosen arbitrarily and {xn} the sequence defined by

()
where {αn}, {βn}⊂(0,1) such that ϵαnβnb for some ϵ > 0 and and . Then {xn} converges strongly to some fixed point of T.

Quite recently, Zhou [14] showed that every uniformly L-Lipschitzian and asymptotically pseudocontractions which are also uniformly asymptotically regular has a fixed point and the fixed point set is closed and convex, and he also introduced iterative scheme to find a fixed point of a uniformly L-Lipschitzian and asymptotically pseudocontractive mapping as the following theorem.

Theorem Z. Let C be a nonempty bounded closed convex subset of a real Hilbert space H. Let T : CC be a uniformly L-Lipschitzian such that L > 0 and asymptotically pseudocontractive mapping with a fixed point defined as in (1.8) with the sequence {kn}⊂[1, ) such that lim n  kn = 1. Suppose that x1 = xC chosen arbitrarily and {xn} the sequence defined by

()
where {αn}⊂[a, b] such that 0 < a < b < 1/(1 + L). Then {xn} converges strongly to PF(T)(x1).

To be more precisely, Qin et al. [7] showed in the framework of a real Hilbert spaces H for the uniformly L-Lipschitzian and asymptotically pseudocontractive mapping in the intermediate sense that the fixed point set is closed and convex (see Lemma 1.4 in [7]) and the demiclosedness principle holds (see Lemma 1.5 in [7]), and they also introduced an iterative scheme to find a fixed point of a uniformly L-Lipschitzian such that L > 0 and asymptotically pseudocontractive mapping in the intermediate sense on a nonempty bounded closed convex CH defined as in (1.13) with the sequences {kn}⊂[1, ) and {τn}⊂[0, ) such that lim n  kn = 1 and lim nτn = 0, and let qn = 2kn − 1 for all n as follows:
()
where θn = (qn[1 + βn(qn − 1)] − 1)·(diam C) 2 + 2(βnqn + 1)τn < . They proved that under the sequences {αn}, {βn}⊂(0,1) such that aαnβnb for some a > 0 and , if F(T) is nonempty, then the sequence {xn} generated by (1.17) converges strongly to a fixed point of T.

Inspired and motivated by the works mentioned above, in this paper, we introduce a general iterative scheme (3.1) below to find a common element of the set of fixed point for an asymptotically pseudocontractive mapping in the intermediate sense and the set of solutions of mixed equilibrium problems in Hilbert spaces. The strong convergence theorem for the above two sets is obtained by a general iterative scheme based on the shrinking projection method which extends and improves Qin et al. [7] and many others.

2. Preliminaries

Let C be a nonempty closed convex subset of a real Hilbert space H. For solving the mixed equilibrium problem, let us assume that the bifunction Φ : C × C, the function φ : C ∪ {+} and the set C satisfy the following conditions:
  • (A1)  Φ(x, x) = 0 for all xC;

  • (A2) Φ is monotone; that is, Φ(x, y) + Φ(y, x) ≤ 0 for all x, yC;

  • (A3) for each x, y, zC,

    ()

  • (A4) for each xC, y ↦ Φ(x, y) is convex and lower semicontinuous;

  • (A5) for each yC, x ↦ Φ(x, y) is weakly upper semicontinuous;

  • (B1) for each xC and r > 0, there exists a bounded subset DxC and yxC such that for any zCDx,

    ()

  • (B2) C is a bounded set.

Lemma 2.1 (see [15].)Let H be a Hilbert space. For any x, yH and λ, we have

()

Lemma 2.2 (see [3].)Let C be a nonempty closed convex subset of a Hilbert space H. Then the following inequality holds:

()

Lemma 2.3 (see [16].)Let C be a nonempty closed convex subset of a Hilbert space H, Φ : C × C satisfying the conditions (A1)–(A5), and let φ : C ∪ {+} be a proper lower semicontinuous and convex function. Assume that either (B1) or (B2) holds. For r > 0, define a mapping Sr : CC as follows:

()
for all x ∈ C. Then, the following statement hold:
  • (1)

    for each xC, Sr(x) ≠ ;

  • (2)

    Sr is single-valued;

  • (3)

    Sr is firmly nonexpansive; that is, for any x, yC,

    ()

  • (4)

    F(Sr) = MEP (Φ, φ);

  • (5)

    MEP (Φ, φ) is closed and convex.

Lemma 2.4 (see [3].)Every Hilbert space H has Radon-Riesz property or Kadec-Klee property, that is, for a sequence {xn} ⊂ H with xnx and ∥xn∥→∥x∥ then xnx.

Lemma 2.5 (see [7].)Let C be a nonempty closed convex of a real Hilbert space H, and let T : CC be a uniformly L-Lipschitz and asymptotically pseudocontractive mapping in the intermediate sense such that F(T) is nonempty. Then IT is demiclosed at zero. That is, whenever {xn} is a sequence in C weakly converging to some xC and the sequence {(IT)xn} strongly converges to some y, it follows that (IT)x = y.

3. Main Results

Theorem 3.1. Let C be a nonempty closed convex subset of a real Hilbert space H, Φ a bifunction from C × C into satisfying the conditions (A1)–(A5), and φ : C ∪ {+} a proper lower semicontinuous and convex function with either (B1) or (B2) holds. Let T : CC be a uniformly L -Lipschitzian such that L > 0 and asymptotically pseudocontractive mapping in the intermediate sense defined as in (1.13) with the sequences {kn}⊂[1, ) and {τn}⊂[0, ) such that lim n  kn = 1 and lim n  τn = 0. Let qn = 2kn − 1 for all n. Assume that Ω∶ = F(T)∩MEP (Φ, φ) be a nonempty bounded subset of C. For x1 = xC chosen arbitrarily, suppose that {xn}, {yn}, {zn}, and {un} are generated iteratively by

()
where and Δn = sup {∥xnz∥:z ∈ Ω} < satisfying the following conditions:
  • (C1)

    {αn}, {βn}⊂(0,1) such that aαnβnb for some a > 0 and ;

  • (C2)

    {rn}⊂[r, ) for some r > 0;

  • (C3)

    .

Then the sequences {xn}, {yn}, {zn}, and {un} converge strongly to w = PΩ(x1).

Proof. Pick p ∈ Ω. Therefore, by (3.1) and the definition of in Lemma 2.3, we have

()
and by Tp = p, and Lemma 2.3 (4), we have
()
By (3.2), (3.3), and the nonexpansiveness of , we have
()
By (3.3), Lemma 2.1, the uniformly L-Lipschitzian of T, and the asymptotically pseudocontractive mapping in the intermediate sense of T, we have
()
()
()
Substituting (3.6) and (3.7) into (3.5), and by the condition (C1) and (3.4), we have
()
where and Δn∶ = sup {∥xnz∥:z ∈ Ω}.

Firstly, we prove that CnQn is closed and convex for all n. It is obvious that C1Q1 is closed, and by mathematical induction that CnQn is closed for all n ≥ 2, that is CnQn is closed for all n. Let . Since for any zC, is equivalent to

()
for all n. Therefore, for any z1, z2Cn+1Qn+1CnQn and ϵ ∈ (0,1), we have
()
for all n, and we have
()
for all n. Since C1Q1 is convex, and by putting n = 1 in (3.9), (3.10), and (3.11), we have C2Q2 is convex. Suppose that xk is given and CkQk is convex for some k ≥ 2. It follows by putting n = k in (3.9), (3.10), and (3.11) that Ck+1Qk+1 is convex. Therefore, by mathematical induction, we have CnQn is convex for all n ≥ 2, that is, CnQn is convex for all n. Hence, we obtain that CnQn is closed and convex for all n.

Next, we prove that Ω ⊂ CnQn for all n. It is obvious that p ∈ Ω ⊂ C = C1Q1. Therefore, by (3.1) and (3.8), we have pC2, and note that pC = Q2, and so pC2Q2. Hence, we have Ω ⊂ C2Q2. Since C2Q2 is a nonempty closed convex subset of C, there exists a unique element x2C2Q2 such that . Suppose that xkCkQk is given such that , and p ∈ Ω ⊂ CkQk for some k ≥ 2. Therefore, by (3.1) and (3.8), we have pCk+1. Since , therefore, by Lemma 2.2, we have

()
for all zCkQk. Thus, by (3.1), we have pQk+1, and so pCk+1Qk+1. Hence, we have Ω ⊂ Ck+1Qk+1. Since Ck+1Qk+1 is a nonempty closed convex subset of C, there exists a unique element xk+1Ck+1Qk+1 such that . Therefore, by mathematical induction, we obtain Ω ⊂ CnQn for all n ≥ 2, and so Ω ⊂ CnQn for all n, and we can define for all n. Hence, we obtain that the iteration (3.1) is well defined.

Next, we prove that {xn} is bounded. Since for all n, we have

()
for all zCnQn. It follows by p ∈ Ω ⊂ CnQn that ∥xnx1∥≤∥px1∥ for all n. This implies that {xn} is bounded, and so are {yn}, {zn}, and {un}.

Next, we prove that ∥xnxn+1∥→0 and ∥unun+1∥→0 as n. Since , therefore, by (3.13), we have ∥xnx1∥≤∥xn+1x1∥ for all n. This implies that {∥xnx1∥} is a bounded nondecreasing sequence; there exists the limit of ∥xnx1∥, that is

()
for some m ≥ 0. Since xn+1Qn+1, therefore, by (3.1), we have
()
It follows by (3.15) that
()
Therefore, by (3.14), we obtain
()
Indeed, from (3.1) we have
()
()
substituting y = un+1 into (3.18) and y = un into (3.19), we have
()
Therefore, by the condition (A2), we get
()
It follows that
()
Thus, we have
()
It follows by the condition (C2) that
()
where M = sup n≥1unxn∥<. Therefore, by the condition (C3) and (3.17), we obtain
()

Next, we prove that ∥Tnunun∥→0 and ∥Tunun∥→0 as n. Since xn+1Cn+1, by (3.1), we have

()
it follows by the condition (C1) that
()
Since lim n  qn = 1 and the condition (C1), we have lim n(1 − bqnb2L2b) = 1 − 2bb2L2 > 0. Therefore, from (3.27) by (3.17) and lim n  θn = 0, we obtain
()
By the uniformly L-Lipschitzian of T, we have
()
Therefore, by (3.25) and (3.28), we obtain
()

Next, we prove that ∥ynxn∥→0, ∥unzn∥→0 and ∥unxn∥→0 as n. From (3.26), by the condition (C1), we have

()
it follows that
()
Therefore, by (3.17), lim n  θn = 0, and lim n(1 − bqnb2L2b) = 1 − 2bb2L2 > 0, we obtain
()
From (3.1), we have ∥unzn∥ = βnunTnun∥; therefore, by (3.28), we obtain
()
By (3.2), (3.3), and the firmly nonexpansiveness of , we have
()
it follows that
()
Therefore, from (3.8), we have
()
it follows by the condition (C1) that
()
Therefore, by (3.33), lim n  θn = 0, and lim n(1 − bqnb2L2b) = 1 − 2bb2L2 > 0, we obtain
()
Since {un} is bounded, there exists a subsequence of {un} which converges weakly to . Next, we prove that . From and as i by (3.30), therefore, by Lemma 2.5, we obtain . From (3.1), we have
()
it follows by the condition (A2) that
()
Hence,
()
Therefore, from (3.39) and by as i, we obtain
()
For a constant t with 0 < t < 1 and yC, let . Since , thus, ytC. So, from (3.43), we have
()
By (3.44), the conditions (A1) and (A4), and the convexity of φ, we have
()
it follows that
()
Therefore, by the condition (A3) and the weakly lower semicontinuity of φ, we have as t → 0 for all yC, and hence, we obtain , and so .

Since Ω is a nonempty closed convex subset of C, there exists a unique w ∈ Ω such that w = PΩ(x1). Next, we prove that xnw as n. Since w = PΩ(x1), we have ∥x1w∥≤∥x1z∥ for all z ∈ Ω; it follows that

()
Since w ∈ Ω ⊂ CnQn, therefore, by (3.13), we have
()
Since by (3.39) and , we have as i. Therefore, by (3.47), (3.48) and the weak lower semicontinuity of norm, we have
()
It follows that
()
Since as i, therefore, we have
()
Hence, from (3.50), (3.51), Kadec-Klee property, and the uniqueness of w = PΩ(x1), we obtain
()
It follows that {xn} converges strongly to w and so are {yn}, {zn}, and {un}. This completes the proof.

Remark 3.2. The iteration (3.1) is the difference with the iterative scheme of Qin et al. [7] as follows.

  • (1)

    The sequence {xn} is a projection sequence of x1 onto CnQn for all n such that

    ()

  • (2)

    A solving of a common element of the set of fixed point for an asymptotically pseudocontractive mapping in the intermediate sense and the set of solutions of the mixed equilibrium problems by iteration is obtained.

We define the condition (B3) as the condition (B1) such that φ = 0. If φ = 0, then Theorem 3.1 is reduced immediately to the following result.

Corollary 3.3. Let C be a nonempty closed convex subset of a real Hilbert space H, and let Φ a bifunction from C × C into satisfying the conditions (A1)–(A5) with either (B2) or (B3) holds. Let T : CC be a uniformly L-Lipschitzian such that L > 0 and asymptotically pseudocontractive mapping in the intermediate sense defined as in (1.13) with the sequences {kn}⊂[1, ) and {τn}⊂[0, ) such that lim n  kn = 1 and lim n  τn = 0. Let qn = 2kn − 1 for all n. Assume that Ω : = F(T)∩EP (Φ) be a nonempty bounded subset of C. For x1 = xC chosen arbitrarily, suppose that {xn}, {yn}, {zn}, and {un} are generated iteratively by

()
where and Δn = sup {∥xnz∥:z ∈ Ω} < satisfying the following conditions:
  • (C1) {αn}, {βn}⊂(0,1) such that aαnβnb for some a > 0 and ;

  • (C2) {rn}⊂[r, ) for some r > 0;

  • (C3) .

Then the sequences {xn}, {yn}, {zn}, and {un} converge strongly to w = PΩ(x1).

If Φ = 0, then Corollary 3.3 is reduced immediately to the following result.

Corollary 3.4. Let C be a nonempty closed convex subset of a real Hilbert space H. Let T : CC be a uniformly L-Lipschitzian such that L > 0 and asymptotically pseudocontractive mapping in the intermediate sense defined as in (1.13) with the sequences {kn}⊂[1, ) and {τn}⊂[0, ) such that lim n  kn = 1 and lim n  τn = 0. Let qn = 2kn − 1 for all n. Assume that F(T) be a nonempty bounded subset of C. For x1 = xC chosen arbitrarily, suppose that {xn}, {yn}, and {zn} are generated iteratively by

()
where , Δn = sup {∥xnz∥:z ∈ F(T)} < and {αn}, {βn}⊂(0,1) such that aαnβnb for some a > 0 and . Then the sequences {xn}, {yn} and {zn} converge strongly to w = PF(T)(x1).

We introduce the equilibrium problem to the optimization problem:
()
where C is a nonempty closed convex subset of a real Hilbert space H and let ζ : C ∪ {+} is a proper convex and lower semicontinuous. We denote by Argmin(ζ) the set of solution of problem (3.56). We define the condition (B4) as the condition (B3) such that Φ : C × C is a bifunction defined by Φ(x, y) = ζ(y) − ζ(x) for all x, yC. Observe that EP (Φ) = Argmin(ζ). We obtain that Corollary 3.3 is reduced immediately to the following result.

Corollary 3.5. Let C is a nonempty closed convex subset of a real Hilbert space H, and ζ : C ∪ {+} be a proper lower semicontinuous and convex function with either (B2) or (B4) holds. Let T : CC be a uniformly L-Lipschitzian such that L > 0 and asymptotically pseudocontractive mapping in the intermediate sense defined as in (1.13) with the sequences {kn}⊂[1, ) and {τn}⊂[0, ) such that lim n  kn = 1 and lim n  τn = 0. Let qn = 2kn − 1 for all n. Assume that Ω : = F(T)∩Argmin(ζ) be a nonempty bounded subset of C. For x1 = xC chosen arbitrarily, suppose that {xn}, {yn}, {zn} and {un} are generated iteratively by

()
where and Δn = sup {∥xnz∥:z ∈ Ω} < satisfying the following conditions:
  • (C1) {αn}, {βn}⊂(0,1) such that aαnβnb for some a > 0 and ;

  • (C2) {rn}⊂[r, ) for some r > 0;

  • (C3) .

Then the sequences {xn}, {yn}, {zn}, and {un} converge strongly to w = PΩ(x1).

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