1 Introduction

Let Ω be a nonempty closed subset of a real Hilbert space H. Let g be a bifunction from Ω × Ω to R, where R is the set of real numbers. The equilibrium problem for g is as follows: Find x ̄ Ω such that

g ( x ̄ , y ) 0 , y Ω .

Many problems in structural analysis, optimization, management sciences, economics, variational inequalities and complementary problems coincide to find a solution of the equilibrium problem. Various methods have been proposed to solve some kinds of equilibrium problems in Hilbert and Banach spaces (see [18]).

In [9], Takahashi and Zembayashi proved strong and weak convergence theorems for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of a relatively nonexpansive mapping in Banach spaces. Ibaraki and Takahashi [10] introduced a new resolvent of a maximal monotone operator in Banach spaces and the concept of the generalized nonexpansive mapping in Banach spaces. Honda et al. [11], Kohsaka and Takahashi [12] also studied some properties for the generalized nonexpansive retractions in Banach spaces. Takahashi et al. [13] proved a strong convergence theorem for nonexpansive mapping by hybrid method. In 2009, Ceng et al. [2] proved strong and weak convergence theorems for equilibrium problems and dealt maximal monotone operators by hybrid proximal-point methods. Motivated by Ibaraki and Takahashi [10] and Takahashi et al. [13], Takahashi and Zembayashi [14] considered the following equilibrium problem:

Let E be a smooth Banach space with dual space E* and C be a nonempty closed subset of E such that J(C) is a closed and convex subset of E*, where J is the normalized duality mapping from E onto E*. Let f: J(C) × J(C) → R be a mapping. Consider the equilibrium problem as follows: Find x ̄ C such that

f ( J ( x ̄ ) , J ( y ) ) 0 , y C .
(1.1)

Then they proved a strong convergence theorem for finding a solution of the equilibrium problem (1.1) in Banach spaces. Forward, we denote the set of solutions of the problem (1.1) by EP(f):

Inspired and motivated by Ceng et al. [2], Takahashi and Zembayashi [14], Takahashi and Zembayashi [9], the main aim of this paper is to introduce and investigate a new iterative method for finding a solution of the equilibrium problem (1.1). Under some appropriate assumptions, strong and weak convergence results of the iterative algorithms are established, respectively. Furthermore, we also give an example to illustrate the algorithms proposed in this paper.

2 Preliminaries

Throughout this paper, we denote the sets of nonnegative integers and real numbers by Z+ and R, respectively.

Let E be a real Banach space with the dual space E*. The norm and the dual pair between E and E* are denoted by ║·║ and 〈·,·〉, respectively. The weak convergence and strong convergence are denoted by ⇀ and →, respectively. Let C be a nonempty closed subset of E. We denote the normalized duality mapping from E to E* by J defined by

J ( x ) = j ( x ) E * : j ( x ) , x = j ( x ) x = j ( x ) 2 = x 2 , x E .

J is said to be weakly sequentially continuous if the strong convergence of a sequence {x n } to x in E implies the weak* convergence of {J(x n )} to J(x) in E*.

Many properties of the normalized duality mapping J can be found in [1517] and, now, we list the following properties:

(p1) J(x) is nonempty for any xE;

(p2) J is a monotone and bounded operator in Banach spaces;

(p3) J is a strictly monotone operator in strictly convex Banach spaces;

(p4) J is the identity operator in Hilbert spaces;

(p5) If E is a reflexive, smooth and strictly convex Banach space and J*: E* → 2E is the normalized duality mapping on E*, then J-1 = J*; JJ* = I E * and J*J = I E ; where I E * and IE*are the identity mappings on E and E*, respectively.

(p6) If E is a strictly convex Banach space, then J is one to one, that is,

x y J ( x ) J ( y ) = ;

(p7) If E is smooth, then J is single-valued;

(p8) E is a uniformly convex Banach space if and only if E* is uniformly smooth;

(p9) If E is uniformly convex and uniformly smooth Banach space, then J is uniformly norm-to-norm continuous on bounded subsets of E and J-1 = J* is also uniformly norm-to-norm continuous on bounded subsets of E*:

Let E be a smooth Banach space. Let a function ϕ: E × ER be defined as follows:

ϕ ( x , y ) = x 2 - 2 x , J ( y ) + y 2 , x , y E .

Then we have

ϕ ( x , y ) = ϕ ( x , z ) + ϕ ( z , y ) + 2 x - z , J ( z ) - J ( y ) , x , y , z E .

Remark 2.1. (see [17, 18]) The following statements hold:

  1. (1)

    If E is a reflexive, strictly convex and smooth Banach space, then, for all x, yE, ϕ(x; y) = 0 if and only if x = y;

  2. (2)

    If E is a Hilbert space, then ϕ(x, y) = ║x - y║2 for all x; yE;

  3. (3)

    For all x, yE, (║x║ - ║y║)2ϕ(x, y) ≤ (║x║ + ║y║)2.

For solving the equilibrium problem (1.1), we assume that f: J(C) × J(C) → R satisfies the following conditions (A 1) - (A 4) [9]:

(A1) f(x*, x*) = 0 for all x* ∈ J(C);

(A2) f is monotone, that is, f(x*; y*) + f(y*, x*) ≤ 0 for all x*, y* ∈ J(C);

(A3) f is upper hemicontinuous, that is, for all x*, y*, z* ∈ J(C),

limsup t 0 + f ( x * + t ( z * - x * ) , y * ) f ( x * , y * ) ;

(A4) For all x* ∈ J(C), f(x*, ·) is convex and lower semicontinuous.

In the sequel, we recall some concepts and results.

Definition 2.1. (see [11]) Let C be a nonempty closed subset of a smooth Banach space E. A mapping T: CC is said to be generalized nonexpansive if F(T) is nonempty and

ϕ ( T x , p ) ϕ ( x , p ) , x C , p F ( T ) ,

where F(T) denotes the set of fixed points of T, that is, F(T) = {x ∈ C: Tx = x}.

Definition 2.2. (see [11]) Let C be a nonempty closed subset of E. A mapping R: EC is called:

  1. (1)

    a retraction if R2 = R;

  2. (2)

    sunny if R(Rx + t(x - Rx)) = Rx for all xE and t > 0.

Definition 2.3. (see [11]) A nonempty closed subset C of a smooth Banach space E is called a sunny generalized nonexpansive retract of E if there exists a sunny generalized nonexpansive retraction R from E onto C.

Lemma 2.1. (see [19]) Let E be a uniformly convex and smooth Banach space, and let {x n } and {y n } be two sequences of E. If ϕ(x n , y n ) → 0 and either {x n } or {y n } is bounded, then xn - y n → 0.

Lemma 2.2. (see [18]) Let E be a uniformly convex Banach space. Then, for any r > 0; there exists a strictly increasing, continuous and convex function h: [0, 2r] → R such that h(0) = 0 and

t x + ( 1 - t ) y 2 t x 2 + ( 1 - t ) y 2 - t ( 1 - t ) h ( x - y ) , x , y B r , t [ 0 , 1 ] ,

where B r = {z ∈ E: ║z║ ≤ r}.

Lemma 2.3. (see [1]) Let C be a nonempty closed subset of a smooth, strictly convex and reflexive Banach space E such that J(C) is closed and convex. Assume that a mapping f: J(C) × J(C) → R satisfies the conditions (A 1)-(A 4). Then, for any r > 0 and xE, there exists zC such that

f ( J ( z ) , J ( y ) ) + 1 r z - x , J ( y ) - J ( z ) 0 , y C .

Lemma 2.4. (see [14]) Let C be a nonempty closed subset of a uniformly smooth, strictly convex and reflexive Banach space E such that J(C) is closed and convex. Assume that a mapping f: J(C) × J(C) → R satisfies the conditions (A 1)-(A 4). For any r > 0 and xE, define a mapping T r : EC by

T r ( x ) = z C : f ( J ( z ) , J ( y ) ) + 1 r z - x , J ( y ) - J ( z ) 0 , y C , x E .

Then the following statements hold:

  1. (1)

    T r is single-valued;

  2. (2)

    For all x, yE,

    T r ( x ) - T r ( y ) , J ( T r ( x ) ) - J ( T r ( y ) ) x - y , J ( T r ( x ) ) - J ( T r ( y ) ) ;
  3. (3)

    F(T r ) = EP(f) and J(EP(f)) is closed and convex;

  4. (4)

    ϕ(x, T r (x)) + ϕ(T r (x), p) ≤ ϕ(x, p) for all xE and pF(T r ).

Lemma 2.5. (see [9]) Let C be a nonempty closed subset of a smooth, strictly convex and reflexive Banach space E, and let R be a retraction of E onto C. Then the following statements are equivalent:

  1. (1)

    R is sunny generalized nonexpansive;

  2. (2)

    x - R x, J(y) - J(Rx)〉 ≤ 0 for all (x, y) ∈ E × C.

Lemma 2.6. (see [20]) Let C be a nonempty closed sunny generalized nonexpansive retract of a smooth and strictly convex Banach space E. Then the sunny generalized nonexpansive retraction from E onto C is uniquely determined.

Lemma 2.7. (see [10]) Let C be a nonempty closed subset of a smooth and strictly convex Banach space E such that there exists a sunny generalized nonexpansive retraction R from E onto C. Then, for any xE and zC, the following statements hold:

  1. (1)

    z = Rx if and only if 〈x - z, J(y) ≤ J(z)〉 ≤ 0 for all yC;

  2. (2)

    ϕ(x, Rx) + ϕ(Rx, z) ≤ ϕ(x, z).

Lemma 2.8. (see [12]) Let C be a nonempty closed subset of a smooth, strictly convex and reflexive Banach space E. Then the following statements are equivalent:

  1. (1)

    C is a sunny generalized nonexpansive retract of E;

  2. (2)

    J(C) is closed and convex.

Remark 2.2. If E is a Hilbert space, then, from Lemmas 2.6 and 2.8, a sunny generalized nonexpansive retraction from E onto C reduces to a metric projection operator P from E onto C.

Lemma 2.9. (see [12]) Let C be a nonempty closed sunny generalized nonexpansive retract subset of a smooth, strictly convex and reflexive Banach space E. Let R be the sunny generalized nonexpansive retraction from E onto C. Then, for any xE and zC,

z = R x ϕ ( x , z ) = mi n y C ϕ ( x , y ) .

Lemma 2.10. (see [21]) Let {a n } and {b n } be two sequences of nonnegative real numbers satisfying the inequality

a n + 1 a n + b n , n Z + .

If n = 0 b n < , then limn →∞a n exists.

3 Main results

In this section, we propose iterative algorithms for finding a solution of the equilibrium problem (1.1) and prove the strong and weak convergence for the algorithms in a Banach space under some suitable conditions.

Theorem 3.1. Let C be a nonempty closed subset of a uniformly convex and uniformly smooth Banach space E such that J(C) is closed and convex. Assume that a mapping f: J(C) × J(C) → R satisfies the conditions (A 1)-(A 4). Define a sequence {x n } in C by the following algorithm:

x 0 C , u n C such that  f ( J ( u n ) , J ( y ) ) + 1 r n u n - x n , J ( y ) - J ( u n ) 0 , y C , x n + 1 = α n x 0 + ( 1 - α n ) ( β n x n + ( 1 - β n ) u n ) , n Z + ,

where {α n }, {β n } ⊂ [0, 1] such that

n = 0 α n < , lim inf n β n ( 1 - β n ) > 0 , lim inf n r n > 0 .

Then the sequence {REP(f)x n } converges strongly to a point ωEP(f), where REP(f)is the sunny generalized nonexpansive retraction from E onto EP(f).

Proof. For the sake of simplicity, let u n = T r n x n and y n = β n x n + (1 - β n )u n . Then xn+1= α n x0 + (1 - α n )y n . From Lemma 2.4, it follows that EP(f) is a nonempty closed and convex subset of E.

First, we claim that {x n } is bounded. Indeed, let ωEP(f). Since

ϕ ( y n , ω ) = | | β n x n + ( 1 - β n ) u n | | 2 - 2 β n x n + ( 1 - β n ) u n , J ( ω ) + | | ω | | 2 β n | | x n | | 2 + ( 1 - β n ) | | u n | | 2 - 2 β n x n , J ( ω ) - 2 ( 1 - β n ) u n , J ( ω ) + | | ω | | 2 = β n ϕ ( x n , ω ) + ( 1 - β n ) ϕ ( u n , ω ) = β n ϕ ( x n , ω ) + ( 1 - β n ) ϕ ( T r n x n , ω ) ϕ ( x n , ω ) ,

we have

ϕ ( x n + 1 , ω ) α n ϕ ( x 0 , ω ) + ( 1 - α n ) ϕ ( y n , ω ) α n ϕ ( x 0 , ω ) + ( 1 - α n ) ϕ ( x n , ω ) α n ϕ ( x 0 , ω ) + ϕ ( x n , ω ) .

By virtue of n = 0 α n < and Lemma 2.10, it follows that the limit of {ϕ(x n , ω)} exists. Therefore, {ϕ(x n , ω)} is bounded and so {x n }, {u n } and {y n } are also bounded. Let z n = REP(f)x n . Then z n EP(f) and so, from Lemma 2.7, we have

ϕ ( x n , z n ) = ϕ ( x n , R E P ( f ) x n ) ϕ ( x n , ω ) - ϕ ( R E P ( f ) x n , ω ) ϕ ( x n , ω ) .

Therefore, {z n } is bounded and so ϕ(x0, z n ) is bounded. Since ϕ(xn+1, z n ) ≤ α n ϕ(x0, z n ) + ϕ(x n , z n ), by Lemma 2.7, one has

ϕ ( x n + 1 , z n + 1 ) = ϕ ( x n + 1 , R E P ( f ) x n + 1 ) ϕ ( x n + 1 , z n ) - ϕ ( R E P ( f ) x n + 1 , z n ) ϕ ( x n + 1 , z n ) α n ϕ ( x 0 , z n ) + ϕ ( x n , z n ) .

Since {ϕ (x0, z n )} is bounded, there exists M > 0 such that |ϕ(x0, z n )| ≤ M. By n = 0 α n <, we have

n = 0 α n ϕ ( x 0 , z n ) M n = 0 α n < ,

that is, n = 0 α n ϕ ( x 0 , z n ) < From Lemma 2.10, it follows that {ϕ(x n , z n )} is a convergent sequence. For any mZ+\{0}, one can get

ϕ ( x n + m , ω ) ϕ ( x n , ω ) + j = 0 m - 1 α n + j ϕ ( x 0 , ω ) .

Then we have

ϕ ( x n + m , z n ) ϕ ( x n , z n ) + j = 0 m - 1 α n + j ϕ ( x 0 , z n ) .

From zn+m= REP(f)xn+mand Lemma 2.7, it follows that

ϕ ( x n + m , z n + m ) + ϕ ( z n + m , z n ) ϕ ( x n + m , z n ) ϕ ( x n , z n ) + j = 0 m - 1 α n + j ϕ ( x 0 , z n )

and so

ϕ ( z n + m , z n ) ϕ ( x n , z n ) - ϕ ( x n + m , z n + m ) + j = 0 m - 1 α n + j ϕ ( x 0 , z n ) .

Set r = sup{║z n : nZ+}. Then, from Lemma 2.2 and [19], it follows that there is a strictly increasing, continuous and convex function h: [0, 2r] → R such that h(0) = 0 and

h ( | | z n - z n + m | | ) ϕ ( z n + m , z n ) ϕ ( x n , z n ) - ϕ ( x n + m , z n + m ) + j = 0 m - 1 α n + j ϕ ( x 0 , z n ) .

Since {ϕ(x n , z n )} is convergent, {ϕ(x0, z n )} is bounded and n = 0 α n is convergent, it follows that, for any mZ+,

lim n | | z n - z n + m | | = 0 ,

which shows that {z n } is a Cauchy sequence. Since EP(f) is closed, there exists ωEP(f) such that z n ω. Therefore, the sequence {REP(f)x n } converges strongly to the ωEP(f). This completes the proof. □

Theorem 3.2. Let C be a nonempty closed subset of a uniformly convex and uniformly smooth Banach space E such that J(C) is closed and convex. Assume that a mapping f: J(C) × J(C) → R satisfies the conditions (A 1)-(A 4). Define a sequence {x n } in C by the following algorithm:

x 0 C , u n C such that  f ( J ( u n ) , J ( y ) ) + 1 r n u n - x n , J ( y ) - J ( u n ) 0 , y C , x n + 1 = α n x 0 + ( 1 - α n ) ( β n x n + ( 1 - β n ) u n ) , n Z + ,

where {α n }, {β n } ⊂ [0, 1] such that

n = 0 α n < , lim inf n β n ( 1 - β n ) > 0 , lim inf n r n > 0 .

If J is weakly sequentially continuous, then the sequence {x n } converges weakly to a point ωEP(f), where ω = limn→∞REP(f)x n and REP(f)is the sunny generalized nonexpansive retraction from E onto EP(f).

Proof. For the sake of simplicity, let u n = T r n x n , y n = β n x n + (1 - β n )u n and z n = REP(f)x n . As in the proof of Theorem 3.1, we have {x n }, {u n }, {z n }, {J(x n )} and {y n } are bounded. Set r = sup{║x n ║, ║z n ║: nZ+}. It follows from Lemma 2.2 that there exists a strictly increasing, continuous and convex function h: [0, 2r] → R such that h(0) = 0 and

| | β n x n + ( 1 - β n ) u n | | 2 β n | | x n | | 2 + ( 1 - β n ) | | u n | | 2 - β n ( 1 - β n ) h ( | | x n - u n | | ) .

Since

ϕ ( y n , ω ) = ϕ ( β n x n + ( 1 - β n ) u n , ω ) β n | | x n | | 2 + ( 1 - β n ) | | u n | | 2 - β n ( 1 - β n ) h ( | | x n - u n | | ) - 2 β n x n , J ( ω ) - 2 ( 1 - β n ) u n , J ( ω ) + | | ω | | 2 = β n ϕ ( x n , ω ) + ( 1 - β n ) ϕ ( u n , ω ) - β n ( 1 - β n ) h ( | | x n - u n | | ) = β n ϕ ( x n , ω ) + ( 1 - β n ) ϕ ( T r n x n , ω ) - β n ( 1 - β n ) h ( | | x n - u n | | ) ϕ ( x n , ω ) - β n ( 1 - β n ) h ( | | x n - u n | | ) ,

we have

ϕ ( x n + 1 , ω ) = ϕ ( α n x 0 + ( 1 - α n ) y n , ω ) α n ϕ ( x 0 , ω ) + ( 1 - α n ) ϕ ( y n , ω ) α n ϕ ( x 0 , ω ) + ϕ ( y n , ω ) α n ϕ ( x 0 , ω ) + ϕ ( x n , ω ) - β n ( 1 - β n ) h ( | | x n - u n | | ) .

Moreover, one has

β n ( 1 - β n ) h ( | | x n - u n | | ) ϕ ( x n , ω ) - ϕ ( x n + 1 , ω ) + α n ϕ ( x 0 , ω ) .

From lim infn→∞β n (1 - β n ) > 0, n = 0 α n < and the limit existence of {ϕ(x n , ω)}, we have

lim n h ( | | x n - u n | | ) = 0 .

By the property of h, we get

lim n | | x n - u n | | = 0 .

Since J is uniformly norm-to-norm continuous on the bounded subset of E, we obtain

lim n | | J ( x n ) - J ( u n ) | | = 0 .

Since {J(x n )} is bounded, we have that J(x n ) ⇀ p* (here we may take a subnet { x n k } of {x n } if necessary). Then J(u n ) ⇀ p*. From lim infn→∞ r n > 0, it follows that lim n | | x n - u n | | r n =0. Note that

f ( J ( u n ) , J ( y ) ) + 1 r n u n - x n , J ( y ) - J ( u n ) 0 .

By (A 2), we obtain

f ( J ( y ) , J ( u n ) ) - f ( J ( u n ) , J ( y ) ) 1 r n u n - x n , J ( y ) - J ( u n ) .

Therefore, it follows that f(J(y), p*) ≤ 0. Let y t * =tJ ( y ) + ( 1 - t ) p * for any t ∈ (0,1). Then y t * J ( C ) . Since

0 = f y t * , y t * t f y t * , J ( y ) + ( 1 - t ) f y t * , p * t f y t * , J ( y ) ,

we get f ( y t * , J ( y ) ) 0. By (A 3), one has f (p*, J(y)) ≥ 0.Therefore, p* ∈ J(EP(f)).

Let z n = REP(f)x n . From Theorem 3.1, one can get that z n ω and so

x n - z n , p * - J ( z n ) 0 .

Since J is weakly sequentially continuous, we have

J - 1 ( p * ) - J - 1 ( J ( ω ) ) , J ( ω ) - p * 0 .
(3.1)

By the monotonicity of J-1,

J - 1 ( p * ) - J - 1 ( J ( ω ) ) , J ( ω ) - p * 0 .
(3.2)

Thus, from both (3.1) and (3.2), it follows that

J - 1 ( p * ) - J - 1 ( J ( ω ) ) , J ( ω ) - J ( J - 1 ( p * ) ) = 0 ,

this together with the strictly monotonicity of J yields that J-1(p*) = ω. Therefore, the sequence {x n } converges weakly to the point ωEP(f), where ω = limn→∞REP(f)x n . This completes the proof. □

4 Numerical test

In this section, we give an example of numerical test to illustrate the algorithms given in Theorems 3.1 and 3.2.

Example 4.1. Let E = R, C = [-1000, 1000] and define f(x, y): = -5x2 + xy + 4y2. Find x ̄ C such that

f ( x ̄ , y ) 0 , y C .
(4.1)

First, we verify that f satisfies the conditions (A 1)-(A 4) as follows:

(A1) f(x, x) = - 5x2 + x2 + 4x2 = 0 for all x ∈ [-1000, 1000];

(A2) f(x, y) + f(y, x) = -(x - y)2 ≤ 0 for all x, y ∈ [-1000, 1000];

(A3) For all x, y, z ∈ [-1000, 1000],

limsup t 0 + f ( x + t ( z - x ) , y ) = limsup t 0 + - 5 ( ( 1 - t ) x + t z ) 2 + ( 1 - t ) x y + t z y + 4 y 2 = - 5 x 2 + x y + 4 y 2 f ( x , y ) .

(A4) For all x ∈ [-1000, 1000], F(y) = f(x, y) = -5x2 + xy + 4y2 is convex and lower semicontinuous.

From Lemma 2.4, T r is single-valued. Now, we deduce a formula for T r (x). For any yC, r > 0,

f ( z , y ) + 1 r z - x , y - z 0 4 r y 2 + ( ( r + 1 ) z - x ) y + x z - ( 5 r + 1 ) z 2 0 .

Set G(y) = 4ry2 + ((r + 1)z - x)y + xz - (5r + 1)z2. Then G(y) is a quadratic function of y with coefficients a = 4r, b = (r + 1)z - x and c = xz - (5r + 1)z2. So its discriminant Δ = b2 - 4ac is

Δ = [ ( r + 1 ) z - x ] 2 - 16 r ( x z - ( 5 r + 1 ) z 2 ) = ( r + 1 ) 2 z 2 - 2 ( r + 1 ) x z + x 2 - 16 r x z + ( 80 r 2 + 16 r ) z 2 = [ ( 9 r + 1 ) z - x ] 2 .

Since G(y) ≥ 0 for all yC, this is true if and only if Δ ≤ 0. That is, [(9r + 1)z -x]2 ≤ 0. Therefore, z = x 9 r + 1 , which yields that T r ( x ) = x 9 r + 1 . Let r n = n n + 1 , β n = n 3 n + 1 and α n = 1 ( 3 n + 1 ) 2 . It is easy to check that

n = 0 α n < + , lim inf n β n ( 1 - β n ) = 2 9 > 0 , lim inf n r n = 1 .

Thus, from Lemma 2.4, it follows that EP(f) = {0}. Therefore, all the assumptions in Theorems 3.1 and 3.2 are satisfied. Setting x0 = 1 and using the algorithm in Theorem 3.1, we obtain the following sequences:

x 0 = 1 , u n = T r n ( x n ) = n + 1 10 n + 1 x n , x n + 1 = 1 ( 3 n + 1 ) 2 x 0 + 108 n 4 + 108 n 3 + 33 n 2 + 6 n 270 n 4 + 297 n 3 + 117 n 2 + 19 n + 1 x n .

Therefore, by Theorem 3.1, the sequence {PEP(f)x n } must converge strongly to a solution of the problem (4.1). In fact, PEP(f)x n = 0 for all nZ+. Also, according to Theorem 3.2, the sequence {x n } converges weakly to a solution of the problem (4.1). For a number ε = 10-3, if we use MATLAB, then we generate a sequence {x n } as follows:

Selected values of {u n } and {x n } computed by computer programs are listed below Tables 1 and 2, respectively. The convergent process of the sequence {x n } is described in Figure 1.

Table 1 Selected values of {u n }
Table 2 Selected values of {x n }
Figure 1
figure 1

The convergent process of the sequence { x n }.

From Table 1, we can see that the sequence {u n } converges to 0. Moreover, F(T r ) = EP(f) = {0}. Table 2 shows that the iterative sequence {x n } converges to 0, which is indeed a solution of the problem (4.1). Moreover, lim n P E P ( f ) x n = 0 .