Volume 2012, Issue 1 174318
Research Article
Open Access

General Iterative Algorithms for Hierarchical Fixed Points Approach to Variational Inequalities

Nopparat Wairojjana

Nopparat Wairojjana

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

Search for more papers by this author
Poom Kumam

Corresponding Author

Poom Kumam

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

Search for more papers by this author
First published: 12 July 2012
Citations: 1
Academic Editor: Zhenyu Huang

Abstract

This paper deals with new methods for approximating a solution to the fixed point problem; find , where H is a Hilbert space, C is a closed convex subset of H, f is a ρ-contraction from C into H, 0 < ρ < 1, A is a strongly positive linear-bounded operator with coefficient , , T is a nonexpansive mapping on C, and PF(T) denotes the metric projection on the set of fixed point of T. Under a suitable different parameter, we obtain strong convergence theorems by using the projection method which solves the variational inequality for xF(T), where τ ∈ [0, ). Our results generalize and improve the corresponding results of Yao et al. (2010) and some authors. Furthermore, we give an example which supports our main theorem in the last part.

1. Introduction

Throughout this paper, we assume that H is a real Hilbert space where inner product and norm are denoted by 〈·, ·〉 and ∥·∥, respectively, and let C be a nonempty closed convex subset of H. A mapping T : CC is called nonexpansive if
()

We use F(T) to denote the set of fixed points of T, that is, F(T) = {xC : Tx = x}. It is assumed throughout the paper that T is a nonexpansive mapping such that F(T) ≠ .

Recall that a mapping f : CH is a contraction on C if there exists a constant ρ ∈ (0,1) such that
()
A mapping A : HH is called a strongly positive linear bounded operator on H if there exists a constant with property
()
A mapping M : HH is called a strongly monotone operator with α if
()
and M is called a monotone operator if
()
We easily prove that the mapping (IT) is monotone operator, if T is nonexpansive mapping.
The metric (or nearest point) projection from H onto C is mapping PC[·] : HC which assigns to each point xC the unique point PC[x] ∈ C satisfying the property
()
The variational inequality for a monotone operator, M : HH over C, is to find a point in
()
A hierarchical fixed point problem is equivalent to the variational inequality for a monotone operator over the fixed point set. Moreover, to find a hierarchically fixed point of a nonexpansive mapping T with respect to another nonexpansive mapping S, namely, we find such that
()
Iterative methods for nonexpansive mappings have recently been applied to solve a convex minimization problem; see, for example, [15] and the references therein. 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 b is a given point in H. In [5], it is proved that the sequence {xn} defined by the iterative method below, with the initial guess x0H chosen arbitrarily,
()
converges strongly to the unique solution of the minimization problem (1.9) provided the sequence {αn} of parameters satisfies certain appropriate conditions.
On the other hand, Moudafi [6] introduced the viscosity approximation method for nonexpansive mappings (see [7] for further developments in both Hilbert and Banach spaces). Starting with an arbitrary initial x0H, define a sequence {xn} recursively by
()
where {σn} is a sequence in (0,1). It is proved in [6, 7] that under certain appropriate conditions imposed on {σn}, the sequence {xn} generated by (1.11) strongly converges to the unique solution x* in C of the variational inequality
()
In 2006, Marino and Xu [8] introduced a general iterative method for nonexpansive mapping. Starting with an arbitrary initial x0H, define a sequence {xn} recursively by
()
They proved that if the sequence {ϵn} of parameters satisfies appropriate conditions, then the sequence {xn} generated by (1.13) strongly converges 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., h(x) = γf(x) for xH).
In 2010, Yao et al. [9] introduced an iterative algorithm for solving some hierarchical fixed point problem, starting with an arbitrary initial guess x0C, define a sequence {xn} iteratively by
()
They proved that if the sequences {αn} and {βn} of parameters satisfies appropriate conditions, then the sequence {xn} generated by (1.16) strongly converges to the unique solution z in H of the variational inequality
()
In this paper we will combine the general iterative method (1.13) with the iterative algorithm (1.16) and consider the following iterative algorithm:
()
We will prove in Section 3 that if the sequences {αn} and {βn} of parameters satisfy appropriate conditions and lim n(βn/αn) = τ ∈ (0, ) then the sequence {xn} generated by (1.18) converges strongly to the unique solution in H of the following variational inequality
()
In particular, if we take τ = 0, under suitable difference assumptions on parameter, then the sequence {xn} generated by (1.18) converges strongly to the unique solution in H of the following variational inequality
()
Our results improve and extend the recent results of Yao et al. [9] and some authors. Furthermore, we give an example which supports our main theorem in the last part.

2. Preliminaries

This section collects some lemma which can be used in the proofs for the main results in the next section. Some of them are known, others are not hard to derive.

Lemma 2.1 (Browder [10]). Let H be a Hilbert space, C be a closed convex subset of H, and T : CC be 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; in particular, if y = 0 then xF(T).

Lemma 2.2. Let xH and zC be any points. Then one has the following:

  • (1)

    That z = PC[x] if and only if there holds the relation:

    ()

  • (2)

    That z = PC[x] if and only if there holds the relation:

    ()

  • (3)

    There holds the relation:

    ()
    Consequently, PC is nonexpansive and monotone.

Lemma 2.3 (Marino and Xu [8]). Let H be a Hilbert space, C be a closed convex subset of H, f : CH be a contraction with coefficient 0 < ρ < 1, and T : CC be nonexpansive mapping. Let A be a strongly positive linear bounded operator on a Hilbert space H with coefficient . Then, for , for x, yC,

  • (1)

    the mapping (If) is strongly monotone with coefficient (1 − ρ), that is,

    ()

  • (2)

    the mapping (Aγf) is strongly monotone with coefficient that is

    ()

Lemma 2.4 (Xu [4]). Assume that {an} is a sequence of nonnegative numbers such that

()
where {γn} is a sequence in (0,1) and {δn} is a sequence in such that
  • (1)

    ,

  • (2)

    limsup n(δn/γn) ≤ 0 or . Then lim nan = 0.

Lemma 2.5 (Marino and Xu [8]). Assume A is a strongly positive linear bounded operator on a Hilbert space H with coefficient and 0 < α ≤ ∥A−1. Then .

Lemma 2.6 (Acedo and Xu [11]). Let C be a closed convex subset of H. Let {xn} be a bounded sequence in H. Assume that

  • (1)

    The weak ω-limit set ωw(xn) ⊂ C,

  • (2)

    For each zC, lim nxnz∥ exists. Then {xn} is weakly convergent to a point in C.

Notation We use → for strong convergence and ⇀ for weak convergence.

3. Main Results

Theorem 3.1. Let C be a nonempty closed convex subset of a real Hilbert space H. Let f : CH be a ρ-contraction with ρ ∈ (0,1). Let S, T : CC be two nonexpansive mappings with F(T) ≠ . Let A be a strongly positive linear bounded operator on H with coefficient . {αn} and {βn} are two sequences in (0,1) and . Starting with an arbitrary initial guess x0C and {xn} is a sequence generated by

()

Suppose that the following conditions are satisfied:

  • (C1)

      lim nαn = 0 and ,

  • (C2)

      lim n(βn/αn) = τ = 0,

  • (C3)

      lim n(|αnαn−1|/αn) = 0 and lim n(|βnβn−1|/βn) = 0, or

  • (C4)

       and .

Then the sequence {xn} converges strongly to a point , which is the unique solution of the variational inequality:
()
Equivalently, one has .

Proof. We first show the uniqueness of a solution of the variational inequality (3.2), which is indeed a consequence of the strong monotonicity of Aγf. Suppose and both are solutions to (3.2), then and . It follows that

()
The strong monotonicity of Aγf (Lemma 2.3) implies that and the uniqueness is proved.

Next, we prove that the sequence {xn} is bounded. Since αn → 0 and lim n(βn/αn) = 0 by condition (C1) and (C2), respectively, we can assume, without loss of generality, that αn < ∥A−1 and βn < αn for all n ≥ 1. Take uF(T) and from (3.1), we have

()
Since and by Lemma 2.5, we note that
()
By induction, we can obtain
()
which implies that the sequence {xn} is bounded and so are the sequences {f(xn)}, {Sxn}, and {ATyn}.

Set wn : = αnγf(xn)+(IαnA)Tyn,   n ≥ 1. We get

()
It follows that
()
By (3.7) and (3.8), we get
()
From (3.1), we obtain
()
where M is a constant such that
()
Substituting (3.10) into (3.8) to obtain
()
At the same time, we can write (3.12) as
()
From (3.12), (C4), and Lemma 2.5 or from (3.13), (C3), and Lemma 2.5, we can deduce that ∥xn+1xn∥→0, respectively.

From (3.1), we have

()
Notice that αn → 0, βn → 0, and ∥xn+1xn∥→0, so we obtain
()
Next, we prove
()
where z = PF(T)(IA + γf)z. Since the sequence {xn} is bounded we can take a subsequence of {xn} such that
()
and . From (3.15) and by Lemma 2.1, it follows that . Hence, by Lemma 2.2(1) that
()
Now, by Lemma 2.2(1), we observe that
()
and so
()
Hence, it follows that
()
We observe that
()
Thus, by Lemma 2.4, xnz as n. This is completes.

From Theorem 3.1, we can deduce the following interesting corollary.

Corollary 3.2 (Yao et al. [9]). Let C be a nonempty closed convex subset of a real Hilbert space H. Let f : CH be a ρ-contraction (possibly nonself) with ρ ∈ (0,1). Let S, T : CC be two nonexpansive mappings with F(T) ≠ .  {αn} and {βn} are two sequences in (0,1). Starting with an arbitrary initial guess x0C and {xn} is a sequence generated by

()
Suppose that the following conditions are satisfied:
  • (C1)

      lim nαn = 0 and ,

  • (C2)

      lim n(βn/αn) = 0,

  • (C3)

      lim n(|αnαn−1|/αn) = 0 and lim n(|βnβn−1|/βn) = 0, or

  • (C4)

       and .

Then the sequence {xn} converges strongly to a point , which is the unique solution of the variational inequality:
()
Equivalently, one has . In particular, if one takes f = 0, then the sequence {xn} converges in norm to the Minimum norm fixed point of T, namely, the point is the unique solution to the quadratic minimization problem:
()

Proof. As a matter of fact, if we take A = I and γ = 1 in Theorem 3.1. This completes the proof.

Under different conditions on data we obtain the following result.

Theorem 3.3. Let C be a nonempty closed convex subset of a real Hilbert space H. Let f : CH be a ρ-contraction (possibly nonself) with ρ ∈ (0,1). Let S, T : CC be two nonexpansive mappings with F(T) ≠ . Let A be a strongly positive linear bounded operator on a Hilbert space H with coefficient and . {αn} and {βn} are two sequences in (0,1). Starting with an arbitrary initial guess x0C and {xn} is a sequence generated by

()
Suppose that the following conditions are satisfied:
  • (C1)

      lim nαn = 0 and ,

  • (C2)

      lim n(βn/αn) = τ ∈ (0, ),

  • (C5)

      lim n((|αnαn−1| + |βnβn−1|)/αnβn) = 0,

  • (C6)

      there exists a constant K > 0 such that (1/αn)|1/βn − 1/βn−1| ≤ K.

Then the sequence {xn} converges strongly to a point , which is the unique solution of the variational inequality:
()

Proof. First of all, we show that (3.27) has the unique solution. Indeed, let and be two solutions. Then

()
Analogously, we have
()
Adding (3.28) and (3.29), by Lemma 2.3, we obtain
()
and so . From (C2), we can assume, without loss of generality, that βn ≤ (τ + 1)αn for all n ≥ 1. By a similar argument in Theorem 3.1, we have
()
By induction, we obtain
()
which implies that the sequence {xn} is bounded. Since (C5) implies (C4) then, from Theorem 3.1, we can deduce ∥xn+1xn∥→0.

From (3.1), we note that

()
Hence, it follows that
()
and so
()
Set vn : = (xnxn+1)/(1 − αn)βn. Then, we have
()
From (3.12) in Theorem 3.1 and (C6), we obtain
()
This together with Lemma 2.4 and (C2) imply that
()
From (3.36), for zF(T), we have
()
By Lemmas 2.2 and 2.3, we obtain
()
Now, we observe that
()
From (C1) and (C2), we have βn → 0. Hence, from (3.1), we deduce ∥ynxn∥→0 and ∥xn+1Tyn∥→0. Therefore,
()

Since vn → 0, (IT)yn → 0, A(Tynxn) → 0, and , every weak cluster point of {xn} is also a strong cluster point. Note that the sequence {xn} is bounded, thus there exists a subsequence converging to a point . For all zF(T), it follows from (3.39) that

()
Letting k, we obtain
()
By Lemma 2.6 and (3.27) having the unique solution, it follows that . Therefore, as n. This completes the proof.

From Theorem 3.3, we can deduce the following interesting corollary.

Corollary 3.4 (Yao et al. [9]). Let C be a nonempty closed convex subset of a real Hilbert space H. Let f : CH be a ρ-contraction (possibly nonself) with ρ ∈ (0,1). Let S, T : CC be two nonexpansive mappings with F(T) ≠ . {αn} and {βn} are two sequences in (0,1) Starting with an arbitrary initial guess x0C and {xn} is a sequence generated by

()
Suppose that the following conditions are satisfied:
  • (C1)

      lim nαn = 0 and ,

  • (C2) 

     lim n(βn/αn) = τ ∈ (0, ),

  • (C5)

      lim n((|αnαn−1| + |βnβn−1|)/αnβn) = 0,

  • (C6)

      there exists a constant K > 0 such that (1/αn)|1/βn − 1/βn−1| ≤ K.

Then the sequence {xn} converges strongly to a point , which is the unique solution of the variational inequality:
()

Proof. As a matter of fact, if we take A = I and γ = 1 in Theorem 3.3 then this completes the proof.

Corollary 3.5 (Yao et al. [9]). Let C be a nonempty closed convex subset of a real Hilbert space H. Let S, T : CC be two nonexpansive mappings with F(T) ≠ . {αn} and {βn} are two sequences in (0,1). Starting with an arbitrary initial guess x0C and suppose {xn} is a sequence generated by

()
Suppose that the following conditions are satisfied:
  • (C1)

      lim nαn = 0 and ,

  • (C2)

      lim n(βn/αn) = 1,

  • (C5)

      lim n((|αnαn−1| + |βnβn−1|)/αnβn) = 0,

  • (C6)

      there exists a constant K > 0 such that (1/αn)|1/βn − 1/βn−1| ≤ K.

Then the sequence {xn} converges strongly to a point , which is the unique solution of the variational inequality:
()

Proof. As a matter of fact, if we take A = I, f = 0, and γ = 1 in Theorem 3.3 then this is completes the proof.

Remark 3.6. Prototypes for the iterative parameters are, for example, αn = nθ and βn = nω (with θ, ω > 0). Since |αnαn−1 | ≈ nθ and |βnβn−1 | ≈ nω, it is not difficult to prove that (C5) is satisfied for 0 < θ, ω < 1 and (C6) is satisfied if θ + ω ≤ 1.

Remark 3.7. Our results improve and extend the results of Yao et al. [9] by taking A = I and γ = 1 in Theorems 3.1 and 3.3.

The following is an example to support Theorem 3.3.

Example 3.8. Let H = ,  C = [−1/4, 1/4],  T = I, S = −I,   A = I, f(x) = x2, PC = I,, for every n, we have τ = 1 and choose , ρ = 1/3 and γ = 1. Then {xn} is the sequence

()
and as n, where is the unique solution of the variational inequality
()

Acknowledgments

The authors would like to thank the National Research University Project of Thailand’s Office of the Higher Education Commission under the Project NRU-CSEC no. 55000613 for financial support.

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