Skip to content

Advertisement

Open Access

Strong convergence of composite general iterative methods for one-parameter nonexpansive semigroup and equilibrium problems

Journal of Inequalities and Applications20122012:131

https://doi.org/10.1186/1029-242X-2012-131

Received: 31 January 2012

Accepted: 9 June 2012

Published: 9 June 2012

Abstract

In this paper, we introduce both explicit and implicit schemes for finding a common element in the common fixed point set of a one-parameter nonexpansive semigroup {T(s)| 0 ≤ s < } and in the solution set of an equilibrium problems which is a solution of a certain optimization problem related to a strongly positive bounded linear operator. Strong convergence theorems are established in the framework of Hilbert spaces. As an application, we consider the optimization problem of a k-strict pseudocontraction mapping. The results presented improve and extend the corresponding results of many others.

2000 AMS Subject Classification: 47H09; 47J05; 47J20; 47J25.

Keywords

Nonexpansive semigroupequilibrium problemvariational inequality problemstrongly positive bounded linear operator.

1. Introduction

Let H be a real Hilbert space with inner product 〈·,·〉 and norm || · ||. Recall, a mapping T with domain D(T) and range R(T) in H is called nonexpansive iff for all x, y D(T),
| | T x - T y | | | | x - y | | .
Let C be a closed convex subset of a Hilbert space H, a family = {T(s)| 0 ≤ s < ∞} of mappings of C into itself is called a one-parameter nonexpansive semigroup on C iff it satisfies the following conditions:
  1. (a)

    T(s + t) = T(s)T(t) for all s, t ≥ 0 and T(0) = I;

     
  2. (b)

    ||T(s)x - T(s)y|| ≤ ||x - y|| for all x, y C and s ≥ 0.

     
  3. (c)

    the mapping T(·)x is continuous, for each x C.

     

We denote by F() the set of common fixed points of {T(t): t ≥ 0}. That is, F() = ∩0 ≤ s < ∞F(T(s)). It is clear that T(s)T(t) = T(s + t) = T(t)T(s) for s, t ≥ 0.

Recall that f is called to be weakly contractive [1] iff for all x, y D(T),
| | f ( x ) - f ( y ) | | | | x - y | | - φ ( | | x - y | | ) ,

for some φ: [0, +) → [0, +) is a continuous and strictly increasing function such that φ is positive on (0, +) and φ(0) = 0. If φ(t) = (1 - k)t, then f is called to be contractive with the contractive coefficient k. If φ(t) 0, then f is said to be nonexpansive.

Let C be a nonempty closed convex subset of H and F: C × CR be a bifunction, where R is the set of real numbers. The equilibrium problem (for short, EP) is to find x C such that for all y C,
F ( x , y ) 0 ,
(1.1)

The set of solutions of (1.1) is denoted by EP(F). Given a mapping T: CH, let F(x, y) = 〈Tx, y - x〉 for all x, y C. Then, x EP(F) if and only if x C is a solution of the variational inequality 〈Tx, y - x〉 ≥ 0 for all y C. In addition, there are several other problems, for example, the complementarity problem, fixed point problem and optimization problem, which can also be written in the form of an EP. In other words, the EP is an unifying model for several problems arising in physics, engineering, science, optimization, economics, etc. In the last two decades, many papers have appeared in the literature on the existence of solutions of EP; see, for example [25] and references therein. Some solution methods have been proposed to solve the EP; see, for example, [612] and references therein.

To study the equilibrium problems, we assume that the bifunction F: C × CR satisfies the following conditions:

(A1) F(x, x) = 0 for all x C;

(A2) F is monotone, i.e., F(x, y) + F(y, x) ≤ 0 for all x, y C;

(A3) for each x, y, z C,
lim  sup t 0 F ( t z + ( 1 - t ) x , y ) F ( x , y ) ;

(A4) for each x C, y α F(x, y) is convex and lower semi-continuous.

Recently, Takahashi and Takahashi [10] introduced the following iterative method
F ( y n , u ) + 1 r n u - y n , y n - x n 0 , u C , x n + 1 = α n f ( x n ) + ( 1 - α n ) T y n n 1

for approximating a common element in the fixed point set of a single nonexpansive mapping and in the solution set of the equilibrium problem. To be more precise, they proved the following Theorem.

Theorem TT Let C be a nonempty closed convex subset of H. Let F be a bifunction from C × C to R satisfying (A1)-(A4) and let T be a nonexpansive mapping of C into H such that F (T) ∩ EP (F) ≠ . Let f be a contraction of H into itself and let {x n } and {y n } be sequences generated by x1 H and
F ( y n , u ) + 1 r n u - y n , y n - x n 0 , u C , x n + 1 = α n f ( x n ) + ( 1 - α n ) T y n n 1
where {α n } 0[1] and {r n } (0, ) satisfy
lim n α n = 0 , n = 1 α n = , n = 1 | α n + 1 - α n | < ,

lim infn→∞r n > 0, and n = 1 | r n + 1 - r n | < . Then {x n } and {y n } converge strongly to z F(T) ∩ EP (F), where z = P(T)∩EP(F)f(z).

Subsequently, many authors studied the problem of finding a common element in the fixed point set of nonexpansive mappings, in the solution set of variational inequalities and in the solution set of equilibrium problems, for instance see [1020].

Iterative methods for nonexpansive mappings have recently been applied to solve convex minimization problems; see, e.g., [2126] and the references therein. Let A be a strongly positive linear bounded operator (i.e., there is a constant γ ¯ > 0 such that A x , x γ ¯ | | x | | 2 , x H), and T be a nonexpansive mapping on H. 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:
min x F ( T ) 1 2 A x , x - x , b
(1.2)

where F(T) is the fixed point set of the mapping T on H and b is a given point in H.

Starting with an arbitrary initial x0 H, define a sequence {x n } recursively by
x n + 1 = ( I - α n A ) T x n + α n b n 0
(1.3)

It is proved [23] (see also [24]) that the sequence {x n } generated by (1.3) converges strongly to the unique solution of the minimization problem (1.2) provided the sequence {α n } satisfies certain conditions.

In 2007, related to a certain optimization problem, Marino and Xu [27] introduced the following viscosity approximation method for nonexpansive mappings. Let f be a contraction on H. Starting with an arbitrary initial x0 H, define a sequence {x n } recursively by
x n + 1 = ( I - α n A ) T x n + α n γ f ( x n ) , n 0
(1.4)
and proved that if the sequence {α n } satisfies appropriate conditions, the sequence {x n } generated by (1.4) converges strongly to the unique solution of the variational inequality
( A - γ f ) x * , x - x * 0 , x C ,
which is the optimality condition for the minimization problem
min x C 1 2 A x , x - h ( x ) ,

where h is a potential function for γf (that is, h'(x) = γf(x) for x H).

In 2009, Cho et al. [28] extended the result of Marino and Xu [27] to the class of k-strictly pseudo-contractive mappings and proved the convergent theorem.

Motivated by the ongoing research and the above mentioned results, we introduce both explicit and implicit schemes for finding a common element in the common fixed point set of a one-parameter nonexpansive semigroup {T(s)| 0 ≤ s < }, in the solution set of an equilibrium problems, in the solution set of variational inequalities in the framework of Hilbert spaces. The results presented in this paper improve and extend the corresponding results in [9, 10, 14, 15, 2730].

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

The following lemma can be found in [7].

Lemma 1.1 Let C be a nonempty closed convex subset of H and let F: C × CR be a bifunction satisfying (A1)-(A4). Then, for any r > 0 and x H, there exists z C such that
F ( z , y ) + 1 r y - z , z - x 0 , y C .
Further, define
T r x = { z C : F ( z , y ) + 1 r y - z , z - x 0 , y C } ,
for all z H. Then the following hold:
  1. (1)

    T r is single-valued;

     
  2. (2)
    T r is firmly nonexpansive, i.e., for any x, y H,
    | | T r x - T r y | | 2 T r x - T r y , x - y ;
     
(3)F(T r ) = EP(F);
  1. (4)

    EP(F) is closed and convex.

     

Remark 1.1 The mapping T r is also nonexpansive for all r > 0.

Lemma 1.2[27] Assume A is a strongly positive linear bounded operator on a Hilbert space H with coefficient γ ¯ > 0 and 0 < ρ ≤ ||A||-1. Then | | I - ρ A | | 1 - ρ γ ¯ .

Lemma 1.3[31] Let C be a nonempty bounded closed convex subset of H and let = {T(s): 0 ≤ s <∞} be a nonexpansive semigroup on C, then for any h ≥ 0,
lim t sup x C | | 1 t 0 t T ( s ) x d s - T ( h ) ( 1 t 0 t T ( s ) x d s ) | | = 0 .

Lemma 1.4 Let C be a nonempty bounded closed convex subset of a Hilbert space H and = {T(t): 0 ≤ t <∞}be a nonexpansive semigroup on C. If {x n } is a sequence in C satisfying the properties:

(i)x n z;

(ii) lim suptlim supn||T(t)x n - x n || = 0,

where x n z denote that {x n } converges weakly to z, then z F().

Proof. This Lemma is the continuous version of Lemma 2.3 of Tan and Xu[32]. This proof given in [32] is easily extended to the continuous case.

Lemma 1.5[33] Let C be a nonempty closed convex subset of a real Hilbert space H, T be nonexpansive mapping from C into self. Then the mapping I - T is demiclosed at zero, i.e.,
x n x , | | x n - T x n | | 0 i m p l i e s x = T x .
Lemma 1.6[22] Assume {a n } is a sequence of nonnegative real numbers such that
a n + 1 = ( 1 - γ n ) a n + δ n , n 0 .
where {γ n } is a sequence in (0,1) and {δ n } is a sequence in R such that
  1. (i)

    n = 1 γ n = .

     
  2. (ii)

    lim supnδ n n ≤ 0 or n = 1 | δ n | < .

     

Then limna n = 0.

Lemma 1.7[34] Let {λ n } and {β n } be two nonnegative real number sequences and {α n } a positive real number sequence satisfying the conditions n = 0 α n = and lim n β n α n = 0 or n = 0 β n < . Let the recursive inequality
λ n + 1 λ n - α n ψ ( λ n ) + β n , n = 0 , 1 , 2 ,

be given, where ψ(λ) is a continuous and strict increasing function for all λ ≥ 0 with ψ(0) = 0. Then {λ n } converges to zero, as n.

2. Implicit viscosity iterative algorithm

Theorem 2.1 Let C be a nonempty closed convex subset of a Hilbert space H. Let F be a bifunction from C × C into R satisfying (A1)-(A4). Let f be a weakly contractive mapping with a function φ on H, A a strongly positive linear bounded operator with coefficient γ ¯ > 0 on H, = {T(s): s ≥ 0} be a nonexpansive semigroup on C, respectively. Assume that Ω:= F()∩EP(F) ≠ , {α n }, {β n }(0,1), {t n }(0,∞) be real sequences satisfying the conditions
lim n α n = lim n β n = 0 , lim n t n = .
then for any 0 < γ γ ¯ and any r > 0, there exists a unique sequence {x n } H satisfying the following condition
F ( u n , y ) + 1 r y - u n , u n - x n 0 , y C , z n = ( 1 - β n ) 1 t n 0 t n T ( s ) u n d s + β n u n , x n = ( I - α n A ) z n + α n γ f ( x n ) , n 1 .
(2.1)
Furthermore, the sequence {x n } converges strongly to z* Ω which uniquely solves the following variational inequality
( γ f - A ) z * , z - z * 0 , f o r a n y z Ω .
(2.2)

Proof. We divide the proof into six steps.

Step 1.

Since α n → 0 as n, we may assume, with no loss of generality, that α n < ||A||-1 for all n ≥ 1. Then, α n < 1 γ for all n ≥ 1.

First, we show that the sequence {x n } generated from (2.1) is well defined. For each n ≥ 1, define a mapping S n f in H as follows
S n f : = ( I - α n A ) [ ( 1 - β n ) 1 t n 0 t n T ( s ) T r d s + β n T r ] + α n γ f .
Observe from Lemma 1.1 that T r be a nonexpansive for each r > 0, thus we have that for any x, y C,
| | S n f x - S n f y | | | | I - α n A | | [ ( 1 - β n ) 1 t n 0 t n | | T ( s ) T r x - T ( s ) T r y | | d s + β n | | T r x - T r y | | ] + α n γ | | f ( x ) - f ( y ) | | ( 1 - α n γ ¯ ) [ ( 1 - β n ) | | x - y | | + β n | | x - y | | ] + α n γ | | f ( x ) - f ( y ) | | [ 1 - α n ( γ ¯ - γ ) ] | | x - y | | - α n γ φ ( | | x - y | | ) | | x - y | | - ψ ( | | x - y | | ) ,
where ψ(x - y) = α n γφ(||x - y||). This shows that S n f is a weakly contractive mapping with a function ψ on H for each n ≥ 1. Therefore, by Theorem 5 of [11], S n f has a unique fixed point (say) x n H. This means that Eq.(2.1) has a unique solution for each n ≥ 1, namely,
x n = ( I - α n A ) [ ( 1 - β n ) 1 t n 0 t n T ( s ) T r x n d s + β n T r x n ] + α n γ f ( x n ) = ( I - α n A ) [ ( 1 - β n ) 1 t n 0 t n T ( s ) u n d s + β n u n ] + α n γ f ( x n ) ,

where note from Lemma 1.1 that u n can be re-written as u n = T r x n .

Next, we show that {x n } is bounded. Indeed, for any z Ω, note that z = T r z. It follows from Lemma 1.1 that
| | u n - z | | = | | T r x n - z | | = | | T r x n - T r z | | | | x n - z | | .
(2.3)
Notice that
| | z n - z | | ( 1 - β n ) | | u n - z | | + β n | | u n - z | | = | | u n - z | | | | x n - z | | .
(2.4)
It follows that
| | x n - z | | 2 = x n - z , x n - z = ( I - α n A ) ( z n - z ) , x n - z + α n γ f ( x n ) - f ( z ) , x n - z + α n γ f ( z ) - A z , x n - z ( 1 - α n γ ¯ ) | | x n - z | | 2 + α n γ | | x n - z | | 2 - α n γ φ ( | | x n - z | | ) | | x n - z | | + α n γ f ( z ) - A z , x n - z = [ 1 - α n ( γ ¯ - γ ) ] | | x n - z | | 2 + α n γ f ( z ) - A z , x n - z - α n γ φ ( | | x n - z | | ) | | x n - z | | | | x n - z | | 2 + α n γ f ( z ) - A z , x n - z - α n γ φ ( | | x n - z | | ) | | x n - z | | .
(2.5)
Therefore,
φ ( | | x n - z | | ) 1 γ | | γ f ( z ) - A z | | ,

which implies that {φ(||x n - z||)} is bounded. We obtain that {||x n - z||} is bounded by the property of φ. So {x n } is bounded and so are {u n }, {z n }, {f(u n )}, {Az n } from Eq.(2.3) and Eq.(2.4). We may, without loss of generality, assume that there exists a bounded set K C such that x n , u n , z n K, for each n ≥ 1.

Step 2. We claim that there exists a subsequence {n k } of {n} such that x n k z * and z* F().

Indeed, for any z Ω, denote w n : = 1 t n 0 t n T ( s ) u n d s , then ||w n -z|| ≤ ||u n -z|| ≤ ||x n -z||. From Eq.(2.1), the boundedness of {f(x n )}, {Az n }, {u n }, {w n } and the conditions limnα n = limnβ n = 0, we see that
| | z n - w n | | = β n | | u n - w n | | 0 ( n )
(2.6)
and
| | x n - z n | | = α n | | γ f ( x n ) - A z n | | 0 ( n ) .
(2.7)
In view of Eq.(2.6) and Eq.(2.7), we obtain that
| | x n - w n | | 0 ( n ) .
(2.8)
Let K 1 = { ω K : φ | | ω - z | | 1 γ | | γ f ( z ) - A z | | } , then K1 is a nonempty bounded closed convex subset of H and T(s)-invariant. Since {x n } K1 and K1 is bounded, there exists r > 0 such that K1 B r , it follows from Lemma 1.3 that
lim sup  s lim sup n | | w n - T ( s ) w n | | = 0 .
(2.9)
By virtue of Eq.(2.8) and Eq.(2.9), we arrive at
lim sup  s lim sup n | | x n - T ( s ) x n | | = 0 .
(2.10)

On the other hand, since {x n } is bounded, we know that there exists a subsequence { x n k } of {x n } such that x n k z * . By Lemma 1.4 and Eq.(2.10), we arrive at z* F().

In Eq.(2.5), interchange z* and z to obtain
ψ ( | | x n k - z * | | ) γ f ( z * ) - A z * , x n k - z * ,
where ψ ( | | x n k - z * | | ) = φ ( | | x n k - z * | | ) | | x n k - z * | | . From x n k z * , we get that
lim sup k ψ ( | | x n k - z * | | ) lim n γ f ( z * ) - A z * , x n k - z * = 0 .
namely,
ψ ( | | x n k - z * | | ) 0 a s k ,

which implies that x n k z * as k → ∞ by the property of ψ, and thus z n k z * .

Step 3. We shall show that limn||u n - x n || = 0 and z* EP (F), where z* is obtained in Step 2.

Since T r is firmly nonexpansive, from Lemma 1.1(2), we see for any z Ω that
u n - z 2 = T r x n - T r z 2 T r x n - T r z , x n - z = u n - z , x n - z = 1 2 ( u n - z 2 + x n - z 2 - u n - x n 2 ) ,
from which it follows that
| | u n - z | | 2 | | x n - z | | 2 - | | u n - x n | | 2 .
(2.11)
On the other hand, it follows from Eq.(2.1) and Eq.(2.11) that
x n - z 2 ( 1 - α n γ ¯ ) 2 z n - z 2 + 2 α n γ f ( x n ) - A z , x n - z ( 1 - α n γ ¯ ) 2 u n - z 2 + 2 α n γ x n - z 2 + 2 α n | | γ f ( z ) - A z | | | | x n - z | | ( 1 - α n γ ¯ ) 2 x n - z 2 - ( 1 - α n γ ¯ ) 2 u n - x n 2 + 2 α n γ x n - z 2 + 2 α n | | γ f ( z ) - A z | | | | x n - z | | .
(2.12)
Moreover, we have from Eq.(2.12) that
( 1 - α n γ ¯ ) 2 u n - x n 2 ( 1 - α n γ ¯ ) 2 x n - z 2 - x n - z 2 + 2 α n γ x n - z 2 + 2 α n | | γ f ( z ) - A z | | | | x n - z | | 2 α n γ x n - z 2 + 2 α n | | γ f ( z ) - A z | | | | x n - z | | 4 α n M ,
(2.13)

where M is a constant such that M ≥ max{supn ≥ 1{γ||x n - z||2}, supn ≥ 1{||γf(z) - Az|| ||x n - z||}}. From the condition α n → 0(n), we get from Eq.(2.13) that lim supn||u n - x n || = 0, which implies that as n, ||u n - x n || → 0. Because ||u n - x n || = ||T r x n - x n || → 0(n), we see from Lemma 1.5 and Lemma 1.1 that z* F(T r ) = EP (F). Therefore, z* Ω.

Step 4. We claim that z* is the unique solution of the variational inequality (2.2).

Firstly, we show the uniqueness of the solution to the variational inequality (2.2) in Ω. In fact, suppose p, q Ω satisfy Eq.(2.2), we see that
( A - γ f ) p , p - q 0 ,
(2.14)
( A - γ f ) q , q - p 0 .
(2.15)
Adding these two inequalities (2.14) (2.15) yields
0 A ( p - q ) , p - q - γ f ( p ) - f ( q ) , p - q γ ¯ p - q 2 - γ p - q 2 + γ φ ( | | p - q | | ) | | p - q | | = ( γ ¯ - γ ) p - q 2 + γ φ ( | | p - q | | ) | | p - q | | ,
thus
φ ( | | p - q | | ) γ - γ ¯ γ | | p - q | | .
From γ - γ ¯ γ 0 , we get that
φ ( | | p - q | | ) 0 .

By the property of φ, we must have p = q and the uniqueness is proved.

Next we show that z* is a solution in Ω to the variational inequality (2.2).

In fact, since
x n = ( I - α n A ) ( 1 - β n ) 1 t n 0 t n T ( s ) u n d s + ( I - α n A ) β n u n + α n γ f ( x n ) ,
we derive that
A x n - γ f ( x n ) = - 1 α n ( I - α n A ) ( 1 - β n ) ( I - 1 t n 0 t n T ( s ) d s ) u n + 1 α n [ ( I - α n A ) u n - ( I - α n A ) x n ] .
For any z Ω, it follows that
A ( x n ) - γ f ( x n ) , u n - z = - ( 1 - β n ) α n ( I - α n A ) ( I - 1 t n 0 t n T ( s ) d s ) u n , u n - z + 1 α n ( I - α n A ) ( u n - x n ) , u n - z = - 1 - β n α n ( I - 1 t n 0 t n T ( s ) d s ) u n - ( I - 1 t n 0 t n T ( s ) d s ) z , u n - z + ( 1 - β n ) A ( I - 1 t n 0 t n T ( s ) d s ) u n , u n - z + 1 α n u n - x n , u n - z + A x n - A u n , u n - z .
(2.16)
Now we consider the right side of Eq.(2.16). Observe from Eq.(2.1) that
u n - x n , u n - z r F ( u n , z ) .
Note from z Ω EP(F) that F (z, u n ) ≥ 0, then F(u n , z) ≤ -F(z, u n ) ≤ 0, which implies that
1 α n u n - x n , u n - z 0 .
On the other hand, it is easily seen that I - 1 t n 0 t n T ( s ) d s is monotone, that is
( I - 1 t n 0 t n T ( s ) d s ) u n - ( I - 1 t n 0 t n T ( s ) d s ) z , u n - z 0 .
Thus, we obtain from Eq.(2.16) that
( A ( x n ) - γ f ( x n ) , u n - z ( 1 - β n ) A ( I - 1 t n 0 t n T ( s ) d s ) u n , u n - z + A x n - A u n , u n - z .
(2.17)
Also, we notice from || x n - u n || → 0 (n) and x n k z * Ω that
lim  sup k A ( I - 1 t n k 0 t n k T ( s ) d s ) u n k , u n k - z = 0 ,
(2.18)
and
lim  sup k A ( x n k - u n k ) , u n k - z = 0 .
(2.19)
Now replacing n in Eq.(2.17) with n k and taking limsup, we have from Eq.(2.18) and Eq.(2.19) that
( A - γ f ) z * , z * - z 0 .
(2.20)

for any z Ω. This is, z* Ω is unique solution of Eq.(2.2).

Step 5. We claim that
lim  sup n 1 t n 0 t n T ( s ) u n d s - z * , γ f ( z * ) - A z * 0 .
(2.21)
To show Eq.(2.21), we may choose a subsequence { x n i } of {x n } such that
lim  sup n 1 t n 0 t n T ( s ) u n d s - z * , γ f ( z * ) - A z * = lim i 1 t n i 0 t n i T ( s ) u n i d s - z * , γ f ( z * ) - A z * .
(2.22)

Since { x n i } is bounded, we can choose a subsequence { x n i j } of { x n i } converges weakly to z.

We may, assume without loss of generality, that x n i z , then u n i z , note from Step 2 and Step 3 that z Ω and thus 1 t n i 0 t n i T ( s ) u n i d s z . It follows from Eq.(2.22) that
lim  sup n 1 t n 0 t n T ( s ) u n d s - z * , γ f ( z * ) - A z * = z - z * , γ f ( z * ) - A z * 0 .

So Eq.(2.21) holds, thanks to Eq.(2.20).

Step 6. We claim that x n z* as n.

First, from Eq.(2.8) and Eq.(2.21) we conclude that
lim  sup n γ f ( z * ) - A z * , x n - z * 0 .
(2.23)
Now we compute ||x n - z*||2 and have the following estimates:
| | x n - z * | | 2 = | | ( I - α n A ) ( z n - z * ) + α n ( γ f ( x n ) - A z * ) | | 2 ( 1 - α n γ ¯ ) 2 | | z n - z * | | 2 + 2 α n γ f ( x n ) - A z * , x n - z * ( 1 - α n γ ¯ ) 2 | | z n - z * | | 2 + 2 α n γ | | x n - z * | | 2 - 2 α n γ φ ( | | x n - z * | | ) + 2 α n γ f ( z * ) - A z * , x n - z * ( 1 - α n γ ¯ ) 2 | | x n - z * | | 2 + 2 α n γ | | x n - z * | | 2 + 2 α n γ f ( z * ) - A z * , x n - z * - 2 α n γ φ ( | | x n - z * | | ) ( 1 + α n 2 γ ¯ 2 ) | | x n - z * | | 2 - 2 α n γ φ ( | | x n - z * | | ) + 2 α n γ f ( z * ) - A z * , x n - z * .
It follows that
φ ( | | x n - z * | | ) γ ¯ 2 2 γ α n | | x n - z * | | 2 + 1 γ γ f ( z * ) - A z * , x n - z * .

By virtue of the boundedness of {x n }, Eq.(2.23) and the condition α n → 0(n), we can conclude that limnφ(||x n - z*||) = 0. By the property of φ, we obtain that x n z* Ω as n. This completes the proof of Theorem 2.1.

From Theorem 2.1, we can derive the desired conclusion immediately for a single nonexpansive mapping T.

Corollary 2.1 Let C be a nonempty closed convex subset of a Hilbert space H. Let F a bifunction from C × CR satisfying (A1)-(A4), f be a weakly contractive mapping with a function φ on H, A a strongly positive linear bounded operator with coefficient γ ¯ > 0 on H, and T be a nonexpansive mapping from C into itself, respectively. Assume that Ω = F(T) ∩ EP (F) ≠ , {α n }, {β n } (0, 1) are real sequences such that:limnα n = 0, β n = o(α n ). Then for any 0 < γ γ ¯ and any r > 0, there exists a unique {x n } H such that
F ( u n , y ) + 1 r y - u n , u n - x n 0 , y C , z n = ( 1 - β n ) T u n + β n u n x n = ( I - α n A ) z n + α n γ f ( x n ) , n 1 .

Furthermore, the sequence {x n } converges strongly to z* Ω which solves the variational inequality (2.2).

Remark 2.1 Putting β n = 0, φ(t) = (1 - k)t and u n = x n in Theorem 2.1, we can obtain Theorem 3.1 in [30].

Remark 2.2 The parameter γ can be allowed to take the coefficient γ ¯ in Theorem 2.1 and Corollary 2.1. Our results contain the ones in [23] and [27] as special cases.

3. Explicit viscosity iterative algorithm

Theorem 3.1 Let C be a nonempty closed convex subset of a Hilbert space H. Let F a bifunction from C × CR satisfying (A1)-(A4), f be a weakly contractive mapping with a function φ on H, A a strongly positive linear bounded operator with coefficient γ ¯ > 0 on H, and = {T(s): s ≥ 0} be a nonexpansive semigroup on C, respectively. Assume that Ω = F()∩EP(F) ≠ , {α n }, {β n } (0, 1), {t n } (0, ) are real sequences satisfying the following restrictions:

(C1) limn→∞α n = 0, n = 1 α n = , n = 0 | α n - α n - 1 | < ;

(C2) limn→∞β n = 0, n = 0 | β n - β n - 1 | < ;

(C3) n = 0 1 t n < , n = 0 | 1 t n - 1 t n - 1 | < .

For any 0 < γ γ ¯ and any r > 0, let a sequence {y n } be iteratively generated from y1 C by:
F ( v n , y ) + 1 r y - v n , v n - y n 0 , y C , z n = ( 1 - β n ) 1 t n 0 t n T ( s ) v n d s + β n v n y n + 1 = ( I - α n A ) z n + α n γ f ( y n ) , n 1 .
(3.1)

Then {y n } converges strongly to the unique solution in F to the inequality (2.2).

Proof. Firstly, we show that {y n } is bounded.

Since α n → 0 as n, we may assume, with no loss of generality, that α n < ||A||-1 for all n ≥ 1. Then, α n < 1 γ ¯ for all n ≥ 1.

For any z Ω, note from Lemma 1.1 that v n can be re-written as v n = T r y n for each n ≥ 1 and z = T r z. It follows from Lemma 1.1 that
| | v n - z | | = | | T r y n - z | | = | | T r y n - T r z | | | | y n - z | | .
Notice that
| | z n - z | | 1 - β n | | v n - z | | + β n | | v n - z | | = | | v n - z | | | | y n - z | | .
From which it follows that
| | y n + 1 - z | | | | I - α n A | | | | z n - z | | + α n γ | | f y n - f z | | + α n | | γ f z - A z | | 1 - α n γ ¯ | | z n - z | | + α n γ | | y n - z | | - α n γ φ | | y n - z | | + α n | | γ f z - A z | | 1 - α n γ ¯ | | y n - z | | + α n γ | | y n - z | | + α n | | γ f z - A z | | = 1 - α n γ ¯ - γ | | y n - z | | + α n | | γ f z - A z | | .
By induction,
| | y n + 1 - z | | max { | | y 0 - z | | , | | γ f ( z ) - A z | | γ ¯ - γ } , n 0 .

and {y n } is bounded, which leads to the boundedness of {v n }, {z n }, {f(v n )}, {Az n }. We may, without loss of generality, assume that there exists a bounded set K C such that y n , v n , z n K, for each n ≥ 1.

Using a similar method of proof as in the Step 2 of the proof of Theorem 2.1, we can conclude that
| | y n + 1 - w n | | 0 a s n .
(3.2)
and
| | y n + 1 - z n | | 0 a s n .
(3.3)
Let K 1 = { ω K : | | ω - z | | max { | | y 0 - z | | , | | γ f ( z ) - A z | | γ ¯ - γ } } , then K1 is a nonempty bounded closed convex subset of H and T (s)-invariant. Since {yn+1} K1 and K1 is bounded, there exists r > 0 such that K1 B r , it follows from Lemma 1.3 that
lim  sup  s lim  sup n | | ω n - T ( s ) w n | | = 0 .
(3.4)
By virtue of Eq.(3.2) and Eq.(3.4), we arrive at
lim  sup  s lim  sup n | | y n + 1 - T ( s ) y n + 1 | | = 0 .
(3.5)

Next we shall prove that yn+1- y n → 0 as n.

Note that
| | y n + 1 - y n | | | | α n γ f y n - | | α n γ f y n - 1 | | + α n γ f y n - 1 - α n - 1 γ f y n - 1 | | + | | I - α n A z n - I - α n A z n - 1 | | + | | I - α n A z n - 1 - I - α n - 1 A z n - 1 | | α n γ | | y n - y n - 1 | | - α n γ φ | | y n - y n - 1 | | + | α n - α n - 1 | γ | | f y n - 1 | | + 1 - α n γ | | z n - z n - 1 | | + | α n - 1 - α n | | | A z n - 1 | | .
(3.6)
Also
| | z n - z n - 1 | | | | 1 - β n w n - 1 - β n w n - 1 | | + | | 1 - β n w n - 1 - 1 - β n - 1 w n - 1 | | + | | β n v n - β n v n - 1 | | + | | β n v n - 1 - β n - 1 v n - 1 | | 1 - β n | | w n - w n - 1 | | + | β n - 1 - β n |  || w n - 1 | | + β n | | v n - v n - 1 | | + | β n - β n - 1 | | | v n - 1 | | ,
(3.7)
and
| | v n - v n - 1 | | = | | T r y n - T r y n - 1 | | | | y n - y n - 1 | | .
(3.8)
where w n : = 1 t n 0 t n T ( s ) v n d s . Now we compute ||w n - wn-1||,
| | w n - w n - 1 | | | | 1 t n 0 t n T s v n d s - 1 t n 0 t n T s v n - 1 d s | | + | | 1 t n 0 t n T s v n - 1 d s - 1 t n - 1 0 t n T s v n - 1 d s | | + | | 1 t n - 1 0 t n T s v n - 1 d s - 1 t n - 1 0 t n - 1 T s v n - 1 d s | | | | v n - v n - 1 | | + | 1 t n - 1 t n - 1 | | | 0 t n T s v n - 1 d s | | + 1 t n - 1 | | t n t n - 1 T s v n - 1 d s | | .
(3.9)
Substituting Eq.(3.7)-(3.9) into Eq.(3.6), we arrive at
| | y n + 1 - y n | | | | y n - y n - 1 | | - α n γ φ | | y n - y n - 1 | | + | α n - α n - 1 | M + | 1 t n - 1 t n - 1 | M + 1 t n - 1 M + | β n - 1 - β n | M ,
for some positive constant M. Thanks to the conditions (C1) - (C3) and Lemma 1.7, we conclude that
| | y n + 1 - y n | | 0 , a s n .
(3.10)
Now, we show
lim n | | v n - y n | | = lim n | | T r y n - y n | | = 0 .
(3.11)
Indeed, using a similar method of proof as in the Step 3 of the proof of Theorem 2.1, we can obtain that
y n + 1 - z 2 1 - α n γ ¯ 2 y n - z 2 - 1 - α n γ ¯ 2 v n - y n 2 +  2 α n γ | | y n - z | | | | y n + 1 - z | | +  2 α n | | γ f z - A z | | | | y n + 1 - z | | ,
from which it follows that
1 - α n γ ¯ 2 v n - y n 2 1 - α n γ ¯ 2 y n - z 2 - y n + 1 - z 2 +  2 α n γ | | y n - z | | | | y n + 1 - z | | +  2 α n | | γ f z - A z | | | | y n + 1 - z | | y n - z 2 - y n + 1 - z 2 +  4 α n M 1 = | | y n - z | | + | | y n + 1 - z | | | | y n - z | | - | | y n + 1 - z | | + 4 α n M 1 M 1 | | y n - y n + 1 | | + 4 α n M 1 ,

where M1 is an appropriate constant such that M1 = max{supn ≥ 1{γ||y n - z|| ||yn+1- z||}, supn ≥ 1{||γf(z) - Az|| ||yn+1- z||}, supn ≥ 1{||y n - z|| + ||yn+1- z||}}. From the condition α n → 0(n) and Eq.(3.10), we get that lim supn||v n - y n || = 0, which implies that the Eq.(3.11) holds.

It follows from Theorem 2.1 that there is a unique solution z* Ω to the variational inequality (2.2).

Next, we show that lim supnγf(z*) - Az*, yn+1- z*〉 ≤ 0

Indeed, we can take a subsequence { y n k + 1 } of { y n k } such that
lim  sup n γ f z * - A z * , y n + 1 - z * = lim n γ f z * - A z * , y n k + 1 - z *

We may assume that y n k + 1 z since {yn+1} is bounded. From Eq.(3.5) and Lemma 1.4, we conclude z F (). Similarly, from Eq.(3.11) and Lemma 1.1 and Lemma 1.5, we have z EP(F). Therefore, z Ω.

In view of the variational inequality (2.2), we conclude
lim  sup n γ f z * - A z * , y n + 1 - z * = lim n γ f z * - A z * , y n k + 1 - z * = γ f z * - A z * , z - z * 0
From (3.4), we see that
lim  sup n γ f z * - A z * , z n - z * 0 .
(3.12)
Finally, we show that y n z*. As a matter of fact,
y n + 1 - z * 2 = | | ( I - α n A ) ( z n - z * ) + α n ( γ f ( y n ) - A z * ) | | 2 = | | ( I - α n A ) ( z n - z * ) | | 2 + α n 2 γ f ( y n ) - A z * 2 + 2 α n ( I - α n A ) ( z n - z * ) , γ f ( y n ) - A z * 1 - α n γ ¯ 2 z n - z * 2 + α n 2 γ f ( y n ) - A z * 2 +  2 α n z n - z * , γ f y n - A z * - 2 α n 2 A ( z n - z * ) , γ f ( y n ) - A z * ( 1 - α n γ ¯ ) 2 y n - z * 2 + α n 2 γ f y n - A z * 2 +  2 α n γ z n - z * , f y n - f ( z * ) + 2 α n z n - z * , γ f ( z * ) - A z * - 2 α n 2 A ( z n - z * ) , γ f ( y n ) - A z * [ ( 1 - α n γ ¯ ) 2 + 2 α n γ ] y n - z * 2 + α n [ 2 z n - z * , γ f ( z * ) - A z * + α n γ f ( y n ) - A z * 2 + 2 α n | | A ( z n - z * ) | | | | γ f ( y n ) - A z * | | ] = [ 1 - 2 α n ( γ ¯ - γ ) ] y n - z * 2 + α n A n ,
(3.13)
where
A n = 2 z n - z * , γ f ( z * ) - A z * + α n γ f y n - A z * 2 + 2 | | A ( z n - z * ) | | | | γ f y n - A z * | | + γ ¯ 2 y n - z * 2 .
Since {y n } is bounded, there must exist a constant M2 > 0 such that
γ f y n - A z * 2 + 2 | | A ( z n - z * ) | | | | γ f y n - A z * | | + γ ¯ 2 y n - z * 2 M 2 .
It then follows from Eq.(3.13) that
y n + 1 - z * 2 1 - 2 α n γ ¯ - γ y n - z * 2 + α n B n ,
(3.14)

where B n = 2〈z n - z*, γf(z*) - Az*〉 + α n M2. From the conditions (C1) - (C2), Eq.(3.12) and Lemma 1.6, we obtain from Eq.(3.14) that y n z* in norm. This completes the proof of Theorem 3.1.

From Theorem 3.1, we can derive the desired conclusion immediately for a nonexpansive mapping T.

Corollary 3.1 Let H be a Hilbert space, C be a nonempty closed convex subset of H, F a bifunction from C × CR satisfying (A1)-(A4). Let f be a weakly contractive mapping with a function φ on H, and A a strongly positive linear bounded operator with coefficient γ ¯ > 0 on H, and T be a nonexpansive mapping from C into itself. Assume that Ω = F(T) ∩ EP(F) ≠ , for any 0 < γ γ ¯ and any r > 0, let y1 C, and {y n } be a sequence generated in
F v n , y + 1 r y - v n , v n - y n 0 , y C , z n = 1 - β n T v n + β n v n y n + 1 = I - α n A z n + α n γ f y n , n 1 .

where {α n }, {β n } (0, 1) are real sequences satisfying the conditions (C1) - (C2) in Theorem 3.1. Then the sequence {y n } converges strongly to z* Ω which uniquely solves the variational inequality (2.2).

Remark 3.1 Putting A = I, β n = 0 and φ(t) = (1 - k)t in Corollary 3.1, we can easily conclude Theorem TT [10].

Remark 3.2 Putting β n = 0, φ(t) = (1 - k)t and u n = x n in Theorem 3.1, we can obtain Theorem 3.2 in [30].

4. Application

In this section, we shall consider another class of important nonlinear operator: k-strict pseudocontractions.

Recall that a mapping S: CC is said to be a k-strict pseudocontraction if there exists a constant k (0, 1) such that
S x - S y 2 x - y 2 + k I - S x - I - S y 2

for all x, y C. Note that the class of k-strict pseudocontractions strictly includes the class of nonexpansive mappings.

Corollary 4.1 Let C be a nonempty closed convex subset of a Hilbert space H, F be a bifunction from C × CR satisfying (A1)-(A4). Let f be a weakly contractive mapping with a function φ on H, A a strongly positive linear bounded operator with coefficient γ ¯ > 0 on H, T: CH be a k-strictly pseudo-contractive mapping for some 0 ≤ k < 1, respectively. Assume that Ω = F(T) ∩ EP(F) ≠ , for any 0 < γ γ ¯ and any r > 0, let y1 C, and {y n } be a sequence generated in
F v n , y + 1 r y - v n , v n - y n 0 , y C , z n = 1 - β n P C S y n + β n y n y n + 1 = I - α n A z n + α n γ f y n , n 1 .

where S: CH is a mapping defined by Sx = kx + (1 - k)Tx and P C is the metric projection of H onto C, {α n }, {β n } (0, 1) are real sequences satisfying the conditions (C1) - (C2) in Theorem 3.1. Then the sequence {y n } converges strongly to z* Ω which uniquely solves the variational inequality (2.2).

Proof. From Lemma 2.3 in [35], we see that S: CH is a nonexpansive mapping and F(T) = F(S). It follows from Lemma 2.2 [32] that, P C S: CC is a nonexpansive mapping and F(P C S) = F(S) = F(T). Hence the result follows from Corollary 3.1.

Remark 4.1 Putting v n = y n and φ(t) = (1 - k)t in Corollary 4.1, we can obtain Theorem J in [29], Further, putting β n = 0, we can obtain Theorem CKQ in [28].

5. Numerical examples

Now, we give some real numerical examples in which the conditions satisfy the ones of Theorems 3.1 and 2.1 and some numerical experiment results to explain the main results Theorems 3.1 and 2.1 as follows:

Example 5.1. Let H = R and C = 0[1]. For each x C, we define f ( x ) = 1 4 x 2 , A(x) = 2x, T ( x ) = 1 2 x 2 . Let α n = β n = 1 n [ 0 , 1 ] , n N. For each (x, y) H × H, we define F(x, y) = x2 + y. Then {y n } is the sequence generated by
y n + 1 = 1 2 ( 1 - 2 n ) ( 1 - 1 n ) y n 2 + ( 1 - 2 n ) 1 n y n + 1 8 n y n 2
(5.1)

and y n y* = 0 as n, where y* = 0 F(T) ∩ EP(F).

Proof. It is obvious that the bifunction F(x, y) satisfies the conditions (A1)-(A4) and f ( x ) = 1 4 x 2 is a weakly contractive mapping with a function φ ( t ) = 1 2 t on R, T ( x ) = 1 2 x 2 is a nonexpansive mapping on C and F(T) = {0}, A(x) = 2x is a strongly positive linear bounded operator with coefficient γ ¯ = 1 on R, and the bifunction F(x, y) = x2 + y satisfies conditions (A1)-(A4) and EP(F) = {y: y ≥ 0}. α n = β n = 1 n [ 0 , 1 ] satisfy limnα n = 0, n = 0 α n = , n = 0 | α n - α n - 1 | < , limnβ n = 0, n = 0 | β n - β n - 1 | < and F(T) ∩ EP(F) = {0}.

Hence, the conditions satisfy the ones of Theorem 3.1. Substituting all of the given conditions to the scheme (3.1), we have (5.1). Following the proof of Theorem 3.1, we easily obtain {y n } converges strongly to y* = 0 F(T) ∩ EP(F).

The proof is completed.

Example 5.2. Let C = 0[2], H, f, A, T, α n , β n , F be as in Example 5.1., F(T) ∩ EP(F) = {0, 2}. Then there exists a unique sequence {x n } H satisfying the following equation
x n = 1 2 ( 1 - 2 n ) ( 1 - 1 n ) x n 2 + ( 1 - 2 n ) 1 n x n + 1 8 n x n 2
(5.2)

Furthermore, x n x* = 2 as n, where x* = 2 F(T) ∩ EP(F).

Proof. As in the proof of Example 5.1, the conditions satisfy the ones of Theorem 2.1. Substituting all of the given conditions to the scheme (2.1), we have (5.2), and if x n ≠ 0 for each n, (5.2) is equal to the following equation
x n = 1 - ( 1 - 2 n ) 1 n 1 2 ( 1 - 2 n ) ( 1 - 1 n ) + 1 8 n

Following the proof of Theorem 2.1, we easily obtain {x n } converges strongly to x* = 2 F(T) ∩ EP(F). The proof is completed.

Next, we give the numerical experiment results using software Matlab 7.0 and get Figures 1 and 2, which show that the iteration processes of the sequence {y n } as initial point y(1) = 1, y(1) = 0.5 and the sequence {x n }, respectively. From the figures, we can see that {y n } converges to 0 and {x n } converges to 2, and the more the iteration steps are, the more fast the sequence {y n } and {x n } converges to 0 and 2, respectively.
Figure 1
Figure 1

The case of iteration sequence (5.1).

Figure 2
Figure 2

The case of iteration sequence (5.2).

Declarations

Acknowledgements

The authors are very grateful to the referees for their careful reading, comments and suggestions, which improved the presentation of this article. The first author was supported by the Natural Science Foundational Committee of Hebei Province(Z2011113) and Hebei Normal University of Science and Technology (ZDJS 2009 and CXTD2010-05).

Authors’ Affiliations

(1)
College of Mathematics and Information Technology, Hebei Normal University of Science and Technology, Qinhuangdao, China
(2)
Institute of Mathematics and Systems Science, Hebei Normal University of Science and Technology, Qinhuangdao, China
(3)
Library, Hebei Normal University of Science and Technology, Qinhuangdao, China

References

  1. Alber Ya I, Guerre-Delabriere S: Principles of weakly contractive maps in Hilbert spaces, New Results in Operator Theory. In Advances and Application. Volume 98. Edited by: Gohberg I, Lyubich Yu. Birkhauser, Basel; 1997:7–22.Google Scholar
  2. Blum E, Oettli W: From optimization and variational inequalities to equilibrium problems. Math Stud 1994, 63: 123–145.MathSciNetGoogle Scholar
  3. Flores-Bazan F: Existence theory for finite-dimensional pseudomonotone equilibrium problems. Acta Appl Math 2003, 77: 249–297. 10.1023/A:1024971128483MathSciNetView ArticleGoogle Scholar
  4. Hadjisavvas N, Komlósi S, Schaible S: Handbook of Generalized Convexity and Generalized Monotonicity. Springer, Berlin; 2005.View ArticleGoogle Scholar
  5. Hadjisavvas N, Schaible S: From scalar to vector equilibrium problems in the quasimonotone case. J Optim Theory Appl 1998, 96: 297–309. 10.1023/A:1022666014055MathSciNetView ArticleGoogle Scholar
  6. Ceng LC, Yao JC: A hybrid iterative scheme for mixed equilibrium problems and fixed point problems. J Comput Appl Math 2008, 214: 186–201. 10.1016/j.cam.2007.02.022MathSciNetView ArticleGoogle Scholar
  7. Combettes PL, Hirstoaga SA: Equilibrium programming in Hilbert spaces. J Nonlinear Convex Anal 2005, 6: 117–136.MathSciNetGoogle Scholar
  8. Flam SD, Antipin AS: Equilibrium programming using proximal-like algorithms. Math Program 1997, 78: 29–41.MathSciNetView ArticleGoogle Scholar
  9. Tada A, Takahashi W: Strong convergence theorem for an equilibrium problem and a nonexpansive mapping. In Nonlinear Analysis and Convex Analysis. Edited by: Takahashi W, Tanaka T. Yokohama, Yokohama; 2006:609–617.Google Scholar
  10. Takahashi S, Takahashi W: Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces. J Math Anal Appl 2007, 331: 506–515. 10.1016/j.jmaa.2006.08.036MathSciNetView ArticleGoogle Scholar
  11. Ye J, Huang J: Strong convergence theorems for fixed point problems and generalized equilibrium problems of three relatively quasi-nonexpansive mappings in Banach spaces. J Math Comput Sci 2011, 1: 1–18.MathSciNetView ArticleGoogle Scholar
  12. Ciric L, Olatinwo MO, Gopal D, Akinbo G: Coupled fixed point theorems for mappings satisfying a contractive condition of rational type on a partially ordered metric space. Adv Fixed Point Theory 2012.Google Scholar
  13. Ceng LC, Yao JC: Hybrid viscosity approximation schemes for equilibrium problems and fixed point problems of infinitely many nonexpansive mappings. Appl Math Comput 2008, 198: 729–741. 10.1016/j.amc.2007.09.011MathSciNetView ArticleGoogle Scholar
  14. Ceng LC, Al-Homidan S, Ansari QH, Yao JC: An iterative scheme for equilibrium problems and fixed point problems of strict pseudo-contraction mappings. J Comput Appl Math 2009, 223: 967–974. 10.1016/j.cam.2008.03.032MathSciNetView ArticleGoogle Scholar
  15. Colao V, Marino G, Xu HK: An iterative method for finding common solutions of equilibrium and fixed point problems. J Math Anal Appl 2008, 344: 340–352. 10.1016/j.jmaa.2008.02.041MathSciNetView ArticleGoogle Scholar
  16. Chang SS, Joseph Lee HW, Chan CK: A new method for solving equilibrium problem fixed point problem and variational inequality problem with application to optimization. Nonlinear Anal 2009, 70: 3307–3319. 10.1016/j.na.2008.04.035MathSciNetView ArticleGoogle Scholar
  17. Plubtieng S, Punpaeng R: A new iterative method for equilibrium problems and fixed point problems of nonexpansive mappings and monotone mappings. Appl Math Comput 2008, 197: 548–558. 10.1016/j.amc.2007.07.075MathSciNetView ArticleGoogle Scholar
  18. Qin X, Shang M, Su Y: Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems. Math Comput Model 2008, 48: 1033–1046. 10.1016/j.mcm.2007.12.008MathSciNetView ArticleGoogle Scholar
  19. Qin X, Shang M, Su Y: A general iterative method for equilibrium problems and fixed point problems in Hilbert spaces. Nonlinear Anal 2008, 69: 3897–3909. 10.1016/j.na.2007.10.025MathSciNetView ArticleGoogle Scholar
  20. Qin X, Cho YJ, Kang SM: Convergence theorems of common elements for equilibrium problems and fixed point problems in Banach spaces. J Comput Appl Math 2009, 225: 20–30. 10.1016/j.cam.2008.06.011MathSciNetView ArticleGoogle Scholar
  21. Deutsch F, Yamada I: Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings. Numer Funct Anal Optim 1998, 19: 33–56.MathSciNetView ArticleGoogle Scholar
  22. Xu HK: Iterative algorithms for nonlinear operators. J London Math Soc 2002, 66: 240–256. 10.1112/S0024610702003332MathSciNetView ArticleGoogle Scholar
  23. Xu HK: An iterative approach to quadratic optimization. J Optim Theory Appl 2003, 116: 659–678. 10.1023/A:1023073621589MathSciNetView ArticleGoogle Scholar
  24. Yamada I: The hybrid steepest descent method for the variational inequality problem of the intersection of fixed point sets for nonexpansive mappings. In Inherently Parallel Algorithm for Feasibility and Optimization. Edited by: Butnariu K, Censor Y, Reich S. Elsevier, New York; 2001:473–504.View ArticleGoogle Scholar
  25. Yamada I, Ogura N, Yamashita Y, Sakaniwa K: Quadratic approximation of fixed points of nonexpansive mappings in Hilbert spances. Numer Funct Anal Optim 1998, 19: 165–190. 10.1080/01630569808816822MathSciNetView ArticleGoogle Scholar
  26. Geobel K, Kirk WA: Topics in Metric Fixed Point Theory. In Cambridge Studies in Advanced Mathematics. Volume 28. Cambridge University Press, Cambridge; 1990.Google Scholar
  27. Marino G, Xu HX: A general iterative method for nonexpansive mappings in Hilbert spaces. J Math Anal Appl 2006, 318: 43–52. 10.1016/j.jmaa.2005.05.028MathSciNetView ArticleGoogle Scholar
  28. Cho YJ, Kang SM, Qin X: Some results on k-strictly pseudo-contractive mappings in Hilbert spaces. Nonlinear Anal 2009, 70: 1956–1964. 10.1016/j.na.2008.02.094MathSciNetView ArticleGoogle Scholar
  29. Jung JS: Strong convergence of iterative methods for k-strictly pseudo-contractive mappings in Hilbert spaces. Appl Math Comput 2010, 215: 3746–3753. 10.1016/j.amc.2009.11.015MathSciNetView ArticleGoogle Scholar
  30. Li S, Li L, Su Y: General iterative methods for a one-parameter nonexpansive semigroup in Hilbert space. Nonlinear Anal 2009, 70: 3065–3071. 10.1016/j.na.2008.04.007MathSciNetView ArticleGoogle Scholar
  31. Shimizu T, Takahashi W: Strong convergence to common fixed points of families of nonexpansive mappings. J Math Anal Appl 1997, 211: 71–83. 10.1006/jmaa.1997.5398MathSciNetView ArticleGoogle Scholar
  32. Tan KK, Xu HK: The nonlinear ergodic theorem for asymptotically nonexapansive mappings in Banach spaces. Proc Am Math Soc 1992, 114: 399–404. 10.1090/S0002-9939-1992-1068133-2MathSciNetView Article