Open Access

On asymptotically strict pseudocontractions and equilibrium problems

Journal of Inequalities and Applications20132013:251

https://doi.org/10.1186/1029-242X-2013-251

Received: 17 March 2013

Accepted: 30 April 2013

Published: 17 May 2013

Abstract

In this paper, an equilibrium problem and a fixed point problem of an asymptotically strict pseudocontraction are investigated based on hybrid iterative algorithms. Strong convergence theorems of common solutions to the equilibrium problem and the fixed point problem are obtained in the framework of real Hilbert spaces.

MSC:47H09, 47H10.

Keywords

asymptotically strict pseudocontractionasymptotically nonexpansive mappingnonexpansive mappingfixed pointequilibrium problem

1 Introduction

Equilibrium problems have emerged as an effective and powerful tool for studying a wide class of problems which arise in economics, finance, image reconstruction, ecology, transportation, and network; see [112] and the references therein. Equilibrium problems include fixed point problems, variational inequality problems, variational inclusion problems, saddle point problems, the Nash equilibrium problem, complementarity problems and so on. For the solutions of equilibrium problems, there are several algorithms to solve the problem. The classical algorithm is the Krasnoselskii-Mann iterative algorithm. However, the Krasnoselskii-Mann iterative algorithm is weak convergence for the solutions of equilibrium problems. Haugazeau’s projection method [13] recently has been considered for the approximation of solutions of equilibrium problems and fixed point problems. The advantage of the projection methods is that strong convergence of iterative sequences can be guaranteed without any compact assumptions. The aim of this paper is to study an equilibrium problem and a fixed point problem of an asymptotically strict pseudocontraction based on hybrid iterative algorithms and establish a strong convergence theorem of common solutions in the framework of Hilbert spaces.

2 Preliminaries

Throughout this paper, we always assume that H is a real Hilbert space with the inner product , and the norm . Let C be a nonempty closed convex subset of H, let A : C H be a monotone mapping and F be a bifunction of C × C into , where denotes the set of real numbers.

In this paper, we consider the following equilibrium problem.
Find  x C  such that  F ( x , y ) + A x , y x 0 , y C .
(2.1)
The set of such an x C is denoted by EP ( F , A ) , i.e.,
EP ( F , A ) = { x C : F ( x , y ) + A x , y x 0 , y C } .
If A 0 , then the problem (2.1) is reduced to the following:
Find  x C  such that  F ( x , y ) 0 , y C .
(2.2)
The set of such an x C is denoted by EP ( F ) , i.e.,
EP ( F , A ) = { x C : F ( x , y ) 0 , y C } .
If F 0 , the problem (2.1) is reduced to the classical variational inequality problem.
Find  x C  such that  A x , y x 0 , y C .
(2.3)

To study the problems (2.1) and (2.2), we may assume that F 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.

Recall that a mapping A is said to be monotone iff
A x A y , x y 0 , x , y C .
A is said to be strongly monotone iff there exists a constant α > 0 such that
A x A y , x y α x y 2 , x , y C .
For such a case, A is said to be α-strongly-monotone. A is said to be inverse-strongly monotone iff there exists a constant α > 0 such that
A x A y , x y α A x A y 2 , x , y C .

For such a case, A is said to be α-inverse-strongly monotone.

Recall that a set-valued mapping T : H 2 H is said to be monotone iff, for all x , y H , f T x and g T y imply x y , f g 0 . T : H 2 H is maximal if the graph G ( T ) of T is not properly contained in the graph of any other monotone mapping.

It is known that a monotone mapping T is maximal if and only if, for any ( x , f ) H × H , x y , f g 0 for all ( y , g ) G ( T ) implies f T x .

Let S : C C be a nonlinear mapping. In this paper, we use F ( S ) to denote the fixed point set of S.

Recall that S is said to be nonexpansive iff
S x S y x y , x , y C .
Recall that S is said to be asymptotically nonexpansive iff there exists a sequence { k n } [ 1 , ) with k n 1 as n such that
S n x S n y k n x y , x , y C , n 1 .

The class of asymptotically nonexpansive mappings was introduced by Goebel and Kirk [14] in 1972. Since 1972, a number of authors have studied the convergence problems of the iterative processes for such a class of mappings.

Recall that S is said to be strictly pseudocontractive iff there exists a constant κ [ 0 , 1 ) such that
S x S y 2 x y 2 + κ ( I S ) x ( I S ) y 2 , x , y C .

For such a case, S is also said to be a κ-strict pseudocontraction. The class of strict pseudocontractions is introduced by Browder and Petryshyn [15] in 1967. It is clear that every nonexpansive mapping is a 0-strict pseudocontraction. We also remark that if κ = 1 , then S is said to be pseudocontractive.

Recall that S is said to be an asymptotically strict pseudocontraction iff there exist a sequence { k n } [ 1 , ) with k n 1 as n and a constant κ [ 0 , 1 ) such that
S n x S n y 2 k n x y 2 + κ ( I S n ) x ( I S n ) y 2 , x , y C , n 1 .

For such a case, S is also said to be an asymptotically κ-strict pseudocontraction. The class of asymptotically strict pseudocontractions is introduced by Qihou [16] in 1996. It is clear that every asymptotically nonexpansive mapping is an asymptotical 0-strict pseudocontraction. Every nonexpansive mapping is an asymptotically nonexpansive mapping with the sequence { 1 } . We also remark that if κ = 1 , then S is said to be an asymptotically pseudocontractive mapping which was introduced by Schu [17] in 1991.

Recently, many authors considered the equilibrium problems (2.1), (2.2) and fixed point problems based on hybrid iterative methods; see, for instance, [1830]. In this paper, motivated by these recent results, we consider the shrinking projection algorithm to solve the solutions of the equilibrium problem (2.1) and the fixed point problem of an asymptotically strict pseudocontraction. It is proved that the sequence generated in the purposed iterative process converges strongly to some common element in the solution set of the equilibrium problem (2.1) and in the fixed point set of an asymptotically strict pseudocontraction.

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

Lemma 2.1 [31]

Let C be a nonempty closed convex subset of H and let F : C × C R 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 r > 0 and x H . Then the following hold:
  1. (a)

    T r is single-valued;

     
  2. (b)
    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. (c)

    F ( T r ) = EP ( F ) ;

     
  4. (d)

    EP ( F ) is closed and convex.

     

Lemma 2.2 [32]

In a real Hilbert space, the following inequality holds:
a x + ( 1 a ) y 2 = a x 2 + ( 1 a ) y 2 a ( 1 a ) x y 2 , a [ 0 , 1 ] , x , y H .

Lemma 2.3 [33]

Let H be a real Hilbert space, let C be a nonempty closed convex subset of H and let S : C C be an asymptotically κ-strict pseudocontraction with the sequence { k n } . Then
  1. (a)

    F ( S ) is closed and convex;

     
  2. (b)

    S is L-Lipschitz continuous.

     

Lemma 2.4 [33]

Let H be a real Hilbert space, let C be a nonempty closed convex subset of H and let S : C C be an asymptotically strict pseudocontraction. Then the mapping I S is demiclosed at zero, that is, if { x n } is a sequence in C such that x n x ¯ and x n S x n 0 , then x ¯ F ( S ) .

3 Main results

Theorem 3.1 Let C be a nonempty closed convex subset of a real Hilbert space H. Let F m be a bifunction from C × C to which satisfies (A1)-(A4) and let A m : C H be a ξ m -inverse-strongly monotone mapping for each 1 m N , where N 1 is some positive integer. Let S : C C be an asymptotically κ-strict pseudocontraction. Assume that F : = F ( S ) m = 1 N EP ( F m , A m ) is nonempty and bounded. Let { α n } and { β n } be sequences in [ 0 , 1 ] and let { r n , m } be a positive sequence. Let { γ n , m } be a sequence in [ 0 , 1 ] for each 1 m N such that m = 1 N γ n , m = 1 . Let { x n } be a sequence generated in the following manner:
{ x 1 H , C 1 = H , F m ( u n , m , u ) + A m x n , u u n , m + 1 r n , m u u n , m , u n , m x n 0 , u C , y n = α n x n + ( 1 α n ) ( β n m = 1 N γ n , m u n , m + ( 1 β n ) S n m = 1 N γ n , m u n , m ) , C n + 1 = { w C n : y n w 2 x n w 2 + θ n } , x n + 1 = P C n + 1 x 1 , n 0 ,
where θ n = ( 1 α n ) ( k n 1 ) Θ n and Θ n = sup { x n w 2 : w F } . Assume that the control sequences { α n } , { β n } , { γ n , 1 } , , { γ n , N } , { r n , 1 } ,  , and { r n , N } satisfy the following restrictions:
  1. (a)

    0 α n a < 1 , κ β n b < 1 ;

     
  2. (b)

    0 < c γ n , m 1 and 0 < d r n , m e < 2 ξ m for each 1 m N .

     

Then the sequence { x n } converges strongly to some point x ¯ , where x ¯ = P F x 1 .

Proof First, we show that C n is closed and convex for each n 1 . It is easy to see that C n is closed for each n 1 . We only show that C n is convex for each n 1 . Note that C 1 = H is convex. Suppose that C i is convex for some positive integer i. Next, we show that C i + 1 is convex for the same i. Note that
y i w 2 x i w 2 + θ i
is equivalent to
2 x i y i , w x i 2 y i 2 + θ i .
(3.1)
Take w 1 and w 2 in C i + 1 and put w ¯ = t w 1 + ( 1 t ) w 2 . It follows that w 1 C i , w 2 C i ,
2 x i y i , w 1 x i 2 y i 2 + θ i
(3.2)
and
2 x i y i , w 2 x i 2 y i 2 + θ i .
(3.3)
Combining (3.2) with (3.3), we can obtain that 2 x i y i , w ¯ x i 2 y i 2 + θ i , that is, y i w 2 x i x ¯ 2 + θ i . In view of the convexity of C i , we see that w ¯ C i . This shows that w ¯ C i + 1 . This concludes that C n is closed and convex for each n 1 . Notice that ( I r n , m A m ) is nonexpansive. Indeed, for any x , y C , we find from the restriction (b) that
( I r n , m A m ) x ( I r n , m A m ) y 2 = ( x y ) r n , m ( A m x A m y ) 2 = x y 2 2 r n , m x y , A m x A m y + r n , m 2 A m x A m y 2 x y 2 2 r n , m ξ m A m x A m y 2 + r n , m 2 A m x A m y 2 = x y 2 + r n , m ( r n , m 2 ξ m ) A m x A m y 2 x y 2 .
It follows that
u n , m p 2 = T r n , m ( x n r n , m A m x n ) T r n , m ( p r n , m A m p ) 2 ( x n r n , m A m x n ) ( p r n , m A m p ) 2 x n p 2 .
(3.4)
Put z n = m = 1 N γ n , m u n , m for each n 1 . Next, we show that F C n for all n 1 . It is easy to see that F C 1 = H . Suppose that F C h for some integer h 1 . We intend to claim that F C h + 1 for the same h. For any p F C h , we have from Lemma 2.2 and the restriction (a) that
y h p 2 = α h x h + ( 1 α h ) ( β h z h + ( 1 β h ) S h z h ) p 2 α h x h p 2 + ( 1 α h ) β h ( z h p ) + ( 1 β h ) ( S h z h S h p ) 2 = α h x h p 2 + ( 1 α h ) ( β h z h p 2 + ( 1 β h ) S h z h S h p 2 β h ( 1 β h ) z h p ( S h z h S h p ) 2 ) α h x h p 2 + ( 1 α h ) β h z h p 2 + ( 1 α h ) ( 1 β h ) ( k h z h p 2 + κ z h p ( S h z h S h p ) 2 ) ( 1 α h ) β h ( 1 β h ) z h p ( S h z h S h p ) 2 α h x h p 2 + ( 1 α h ) k h z h p 2 ( 1 α h ) ( 1 β h ) ( β h κ ) z h p ( S h z h S h p ) 2 α h x h p 2 + ( 1 α h ) k h z h p 2 α h x h p 2 + ( 1 α h ) k h m = 1 N γ h , m T r h , m ( x n r h , m A m x h ) p 2 α h x h p 2 + ( 1 α h ) k h x h p 2 x h p 2 + θ h .
This shows that p C h + 1 . This proves that F C n for all n 1 . Since x n = P C n x 1 and x n + 1 = P C n + 1 x 1 C n + 1 C n , we have that
0 x 1 x n , x n x n + 1 = x 1 x n , x n x 1 + x 1 x n + 1 x 1 x n 2 + x 1 x n x 1 x n + 1 .
(3.5)
It follows that
x 1 x n x 1 x n + 1 .
(3.6)
On the other hand, for any p F C n , we see that x 1 x n x 1 p . In particular, we have
x 1 x n x 1 P F x 1 .
This shows that the sequence { x n } is bounded. In view of (3.6), we see that lim n x n x 1 exists. It follows from (3.5) that
x n x n + 1 2 = x n x 1 + x 1 x n + 1 2 = x n x 1 2 + 2 x n x 1 , x 1 x n + 1 + x 1 x n + 1 2 = x n x 1 2 + 2 x n x 1 , x 1 x n + x n x n + 1 + x 1 x n + 1 2 = x n x 1 2 2 x n x 1 2 + 2 x n x 1 , x n x n + 1 + x 1 x n + 1 2 x 1 x n + 1 2 x n x 1 2 ,
which implies that
lim n x n x n + 1 = 0 .
(3.7)
In view of x n + 1 = P C n + 1 x 1 C n + 1 , we find that
y n x n + 1 2 x n x n + 1 2 + θ n .
This combines with (3.7) yielding that
lim n y n x n + 1 = 0 .
(3.8)
Notice that y n x n y n x n + 1 + x n + 1 x n . Combining (3.7) with (3.8), we find that
lim n x n y n = 0 .
(3.9)
Note that
x n y n = x n α n x n ( 1 α n ) ( β n z n + ( 1 β n ) S n z n ) = ( 1 α n ) x n ( β n z n + ( 1 β n ) S n z n ) .
In view of the restriction (a), we obtain from (3.9) that
lim n x n ( β n z n + ( 1 β n ) S n z n ) = 0 .
(3.10)
Notice that
u n , m p 2 = T r n , m ( I r n , m A m ) x n T r n , m ( I r n , m A m ) p 2 ( I r n , m A m ) x n ( I r n , m A m ) p , u n , m p = 1 2 ( ( I r n , m A m ) x n ( I r n , m A m ) p 2 + u n , m p 2 ( I r n , m A m ) x n ( I r n , m A m ) p ( u n , m p ) 2 ) 1 2 ( x n p 2 + u n , m p 2 ( x n u n , m ) r n , m ( A m x n A m p ) 2 ) = 1 2 ( x n p 2 + u n , m p 2 x n u n , m 2 + 2 r n , m x n u n , m , A m x n A m p r n , m 2 A m x n A m p 2 )
and hence
u n , m p 2 x n p 2 x n u n , m 2 + 2 r n , m x n u n , m , A m x n A m p r n , m 2 A m x n A m p 2 x n p 2 x n u n , m 2 + 2 r n , m x n u n , m A m x n A m .
(3.11)
It follows from Lemma 2.2 and the restriction (a) that
y n p 2 = α n x n + ( 1 α n ) ( β n z n + ( 1 β n ) S n z n ) p 2 α n x n p 2 + ( 1 α n ) β n ( z n p ) + ( 1 β n ) ( S n z n S n p ) 2 = α h x n p 2 + ( 1 α n ) ( β n z n p 2 + ( 1 β n ) S n z n S n p 2 β n ( 1 β n ) z n p ( S n z n S n p ) 2 ) α n x n p 2 + ( 1 α n ) β n z n p 2 + ( 1 α n ) ( 1 β n ) ( k n z n p 2 + κ z n p ( S n z n S n p ) 2 ) ( 1 α n ) β n ( 1 β n ) z n p ( S n z n S n p ) 2 α n x n p 2 + ( 1 α n ) k n z n p 2 ( 1 α n ) ( 1 β n ) ( β n κ ) z n p ( S n z n S n p ) 2 α n x n p 2 + ( 1 α n ) k n z n p 2 .
(3.12)
It follows that
y n p 2 ( 1 α n ) k n m = 1 N γ n , m T r n , m ( x n r n , m A m x n ) T r n , m ( p r n , m A m p ) 2 + α n x n p 2 α n x n p 2 + ( 1 α n ) k n m = 1 N γ n , m ( x n r n , m A m x n ) ( p r n , m A m p ) 2 x n p 2 + ( 1 α n ) ( k n 1 ) x n p 2 r n , m ( 2 ξ m r n , m ) ( 1 α n ) k n m = 1 N γ n , m A m x n A m p 2 .
This implies that
r n , m ( 2 ξ m r n , m ) ( 1 α n ) k n γ n , m A m x n A m p 2 x n p 2 y n p 2 + ( 1 α n ) ( k n 1 ) x n p 2 ( x n p + y n p ) x n y n + ( 1 α n ) ( k n 1 ) x n p 2 .
In view of the restrictions (a) and (b), we find from (3.9) that
lim n A m x n A m p = 0 .
(3.13)
On the other hand, we find from (3.11) and (3.12) that
y n p 2 α n x n p 2 + ( 1 α n ) k n m = 1 N γ n , m u n , m p 2 x n p 2 + ( 1 α n ) ( k n 1 ) x n p 2 ( 1 α n ) k n m = 1 N γ n , m x n u n , m 2 + 2 r n , m ( 1 α n ) k n m = 1 N γ n , m x n u n , m A m x n A m p .
This implies that
( 1 α n ) k n γ n , m u n , m x n 2 x n p 2 y n p 2 + ( 1 α n ) ( k n 1 ) x n p 2 + 2 r n , m ( 1 α n ) k n m = 1 N γ n , m x n u n , m A m x n A m p ( x n p + y n p ) x n y n + ( 1 α n ) ( k n 1 ) x n p 2 + 2 r n , m ( 1 α n ) k n m = 1 N γ n , m x n u n , m A m x n A m p .
In view of the restrictions (a) and (b), we obtain from (3.9) and (3.13) that
lim n u n , m x n = 0 .
(3.14)
Since { x n } is bounded, there exists a subsequence { x n i } of { x n } such that x n i q . Next, we show that q F ( S ) . Note that
z n x n = m = 1 N γ n , m u n , m x n m = 1 N γ n , m u n , m x n .
It follows from (3.14) that
lim n z n x n = 0 .
(3.15)
On the other hand, we have
x n ( β n x n + ( 1 β n ) S n x n ) ( β n x n + ( 1 β n ) S n x n ) ( β n z n + ( 1 β n ) S n z n ) + ( β n z n + ( 1 β n ) S n z n ) x n β n x n z n + ( 1 β n ) S n x n S n z n + ( β n z n + ( 1 β n ) S n z n ) x n β n x n z n + ( 1 β n ) L x n z n + ( β n z n + ( 1 β n ) S n z n ) x n L x n z n + ( β n z n + ( 1 β n ) S n z n ) x n .
From (3.10) and (3.15), we find that
lim n x n ( β n x n + ( 1 β n ) S n x n ) = 0 .
(3.16)
Note that
S n x n x n S n x n ( β n x n + ( 1 β n ) S n x n ) + ( β n x n + ( 1 β n ) S n x n ) x n β n S n x n x n + ( β n x n + ( 1 β n ) S n x n ) x n ,
which yields that
( 1 β n ) S n x n x n ( β n x n + ( 1 β n ) S n x n ) x n .
In view of the restriction (a), we find from (3.16) that
lim n S n x n x n = 0 .
(3.17)
Note that
x n S x n x n x n + 1 + x n + 1 S n + 1 x n + 1 + S n + 1 x n + 1 S n + 1 x n + S n + 1 x n S x n ( 1 + L ) x n x n + 1 + x n + 1 S n + 1 x n + 1 + L S n x n x n .
It follows from (3.7) and (3.17) that
lim n S x n x n = 0 .
With the aid of Lemma 2.4, we find that q F ( S ) . Next, we prove q m = 1 N EP ( F m ) . In view of (3.14), we find that u n i , m q for each 1 m N . From (3.14) and the restriction (b), we see that
lim n u n , m x n r n , m = 0 , 1 m N .
(3.18)
Notice that
F m ( u n , m , u ) + A m x n , u u n , m + 1 r n , m u u n , m , u n , m x n 0 , u C .
From (A2), we see that
A m x n , u u n , m + 1 r n , m u u n , m , u n , m x n F m ( u , u n , m ) .
Replacing n by n i , we arrive at
A m x n i , u u n i , m + u u n i , m , u n i , m x n i r n i , m F m ( u , u n i , m ) .
(3.19)
For any t with 0 < t 1 and u C , let ρ t = t u + ( 1 t ) q . Since u C and q C , we have ρ t C . It follows from (3.19) that
ρ t u n i , m , A m ρ t ρ t u n i , m , A m ρ t A m x n i , ρ t u n i , m ρ t u n i , m , u n i , m x n i r n i , m + F m ( ρ t , u n i , m ) = ρ t u n i , m , A m ρ t A m u n , i , m + ρ t u n i , m , A m u n , i , m A m x n i ρ t u n i , m , u n i , m x n i r n i , m + F ( ρ t , u n i , m ) .
(3.20)
Since A m is Lipschitz continuous, we find from (3.14) that A m u n , i , m A m x n i 0 as i . From the monotonicity of A m , we get that
ρ t u n i , m , A m ρ t A m u n , i , m 0 .
In view of (A4), we find from (3.20) that
ρ t q , A m ρ t F ( ρ t , q ) .
(3.21)
With the aid of (A1), (A4), we obtain from (3.21) that
0 = F ( ρ t , ρ t ) t F ( ρ t , u ) + ( 1 t ) F ( ρ t , q ) t F ( ρ t , u ) + ( 1 t ) ρ t q , A m ρ t = t F ( ρ t , u ) + ( 1 t ) t u q , A m ρ t ,
which implies that
F ( ρ t , u ) + ( 1 t ) u q , A m ρ t 0 .
Letting t 0 in the above inequality, we arrive at
F ( q , u ) + u q , A m q 0 .
This shows that q EP ( F m , A m ) , 1 m N . This completes the proof that q F . Put x ¯ = P F x 1 , we obtain that
x 1 x ¯ x 1 q lim inf i x 1 x n i lim sup i x 1 x n i x 1 x ¯ ,
which yields that
lim i x 1 x n i = x 1 q = x 1 x ¯ .

It follows that { x n i } converges strongly to x ¯ . Therefore, we can conclude that the sequence { x n } converges strongly to x ¯ = P F x 1 . This completes the proof. □

Based on Theorem 3.1, we have the following results.

Corollary 3.2 Let C be a nonempty closed convex subset of a real Hilbert space H. Let F be a bifunction from C × C to which satisfies (A1)-(A4) and let A : C H be a ξ-inverse-strongly monotone mapping. Let S : C C be an asymptotically κ-strict pseudocontraction. Assume that F : = F ( S ) EP ( F , A ) is nonempty and bounded. Let { α n } and { β n } be sequences in [ 0 , 1 ] and { r n } be a positive sequence. Let { x n } be a sequence generated in the following manner:
{ x 1 H , C 1 = H , F ( u n , u ) + A x n , u u n + 1 r n u u n , u n x n 0 , u C , y n = α n x n + ( 1 α n ) ( β n u n + ( 1 β n ) S n u n ) , C n + 1 = { w C n : y n w 2 x n w 2 + θ n } , x n + 1 = P C n + 1 x 1 , n 0 ,
where θ n = ( 1 α n ) ( k n 1 ) Θ n and Θ n = sup { x n w 2 : w F } . Assume that the control sequences { α n } , { β n } and { r n } satisfy the following restrictions:
  1. (a)

    0 α n a < 1 , 0 < κ β n b < 1 ;

     
  2. (b)

    0 < d r n e < 2 ξ .

     

Then the sequence { x n } converges strongly to some point x ¯ , where x ¯ = P F x 1 .

Proof Putting F m F , A m A and r n , m r n in Theorem 3.1, we see that m = 1 N γ n , m u n , m u n . With the aid of Theorem 3.1, we can easily conclude the desired conclusion. □

If S is asymptotically nonexpansive, then Corollary 3.2 is reduced to the following.

Corollary 3.3 Let C be a nonempty closed convex subset of a real Hilbert space H. Let F be a bifunction from C × C to which satisfies (A1)-(A4) and let A : C H be a ξ-inverse-strongly monotone mapping. Let S : C C be an asymptotically nonexpansive mapping. Assume that F : = F ( S ) EP ( F , A ) is nonempty and bounded. Let { α n } and { β n } be sequences in [ 0 , 1 ] and let { r n } be a positive sequence. Let { x n } be a sequence generated in the following manner:
{ x 1 H , C 1 = H , F ( u n , u ) + A x n , u u n + 1 r n u u n , u n x n 0 , u C , y n = α n x n + ( 1 α n ) ( β n u n + ( 1 β n ) S n u n ) , C n + 1 = { w C n : y n w 2 x n w 2 + θ n } , x n + 1 = P C n + 1 x 1 , n 0 ,
where θ n = ( 1 α n ) ( k n 1 ) Θ n and Θ n = sup { x n w 2 : w F } . Assume that the control sequences { α n } , { β n } and { r n } satisfy the following restrictions:
  1. (a)

    0 α n a < 1 , 0 β n b < 1 ;

     
  2. (b)

    0 < d r n e < 2 ξ .

     

Then the sequence { x n } converges strongly to some point x ¯ , where x ¯ = P F x 1 .

Putting β n 0 in Corollary 3.3, we have the following.

Corollary 3.4 Let C be a nonempty closed convex subset of a real Hilbert space H. Let F be a bifunction from C × C to which satisfies (A1)-(A4) and let A : C H be a ξ-inverse-strongly monotone mapping. Let S : C C be an asymptotically nonexpansive mapping. Assume that F : = F ( S ) EP ( F , A ) is nonempty and bounded. Let { α n } be a sequence in [ 0 , 1 ] and { r n } be a positive sequence. Let { x n } be a sequence generated in the following manner:
{ x 1 H , C 1 = H , F ( u n , u ) + A x n , u u n + 1 r n u u n , u n x n 0 , u C , y n = α n x n + ( 1 α n ) S n u n , C n + 1 = { w C n : y n w 2 x n w 2 + θ n } , x n + 1 = P C n + 1 x 1 , n 0 ,
where θ n = ( 1 α n ) ( k n 1 ) Θ n and Θ n = sup { x n w 2 : w F } . Assume that the control sequences { α n } and { r n } satisfy the following restrictions:
  1. (a)

    0 α n a < 1 ;

     
  2. (b)

    0 < d r n e < 2 ξ .

     

Then the sequence { x n } converges strongly to some point x ¯ , where x ¯ = P F x 1 .

Corollary 3.5 Let C be a nonempty closed convex subset of a real Hilbert space H. Let A m : C H be a ξ m -inverse-strongly monotone mapping, for each 1 m N , where N 1 is some positive integer. Let S : C C be an asymptotically κ-strict pseudocontraction. Assume that F : = F ( S ) m = 1 N VI ( C , A m ) is nonempty and bounded. Let { α n } and { β n } be sequences in [ 0 , 1 ] and { r n , m } be a positive sequence. Let { γ n , m } be a sequence in [ 0 , 1 ] for each 1 m N such that m = 1 N γ n , m = 1 . Let { x n } be a sequence generated in the following manner:
{ x 1 H , C 1 = H , u n , m = P C ( x n r n , m A m x n ) , y n = α n x n + ( 1 α n ) ( β n m = 1 N γ n , m u n , m + ( 1 β n ) S n m = 1 N γ n , m u n , m ) , C n + 1 = { w C n : y n w 2 x n w 2 + θ n } , x n + 1 = P C n + 1 x 1 , n 0 ,
where θ n = ( 1 α n ) ( k n 1 ) Θ n and Θ n = sup { x n w 2 : w F } . Assume that the control sequences { α n } , { β n } , { γ n , 1 } , , { γ n , N } , { r n , 1 } , and { r n , N } satisfy the following restrictions:
  1. (a)

    0 α n a < 1 , κ β n b < 1 ;

     
  2. (b)

    0 < c γ n , m 1 and 0 < d r n , m e < 2 ξ m for each 1 m N .

     

Then the sequence { x n } converges strongly to some point x ¯ , where x ¯ = P F x 1 .

Proof In Theorem 3.1, put F m ( x , y ) = 0 for all x , y C . From
A m x n , u u n , m + 1 r n , m u u n , m , u n , m x n ,
we have
u u n , m , x n u n , m r n , m A m x n 0 , u C .
This implies that
u n , m = P C ( x n r n , m A m x n ) .

In view of Theorem 3.1, we can immediately obtain the desired conclusion. This completes the proof. □

Corollary 3.6 Let C be a nonempty closed convex subset of a real Hilbert space H. Let F m be a bifunction from C × C to which satisfies (A1)-(A4) for each 1 m N , where N 1 is some positive integer. Let S : C C be an asymptotically κ-strict pseudocontraction. Assume that F : = F ( S ) m = 1 N EP ( F m ) is nonempty and bounded. Let { α n } and { β n } be sequences in [ 0 , 1 ] and { r n , m } be a positive sequence. Let { γ n , m } be a sequence in [ 0 , 1 ] for each 1 m N such that m = 1 N γ n , m = 1 . Let { x n } be a sequence generated in the following manner:
{ x 1 H , C 1 = H , F m ( u n , m , u ) + 1 r n , m u u n , m , u n , m x n 0 , u C , y n = α n x n + ( 1 α n ) ( β n m = 1 N γ n , m u n , m + ( 1 β n ) S n m = 1 N γ n , m u n , m ) , C n + 1 = { w C n : y n w 2 x n w 2 + θ n } , x n + 1 = P C n + 1 x 1 , n 0 ,
where θ n = ( 1 α n ) ( k n 1 ) Θ n and Θ n = sup { x n w 2 : w F } . Assume that the control sequences { α n } , { β n } , { γ n , 1 } , , { γ n , N } , { r n , 1 } , and { r n , N } satisfy the following restrictions:
  1. (a)

    0 α n a < 1 , κ β n b < 1 ;

     
  2. (b)

    0 < c γ n , m 1 and 0 < d r n , m e < for each 1 m N .

     

Then the sequence { x n } converges strongly to some point x ¯ , where x ¯ = P F x 1 .

Proof In Theorem 3.1, put A m = 0 . Then, for any ξ m > 0 , we see that
x y , A m x A m y ξ m A m x A m y 2 , x , y C .

Let { r n , m } be a sequence satisfying the restriction d r n e , where d , e ( 0 , ) . Then we can obtain the desired conclusion easily from Theorem 3.1. This completes the proof. □

Declarations

Acknowledgements

The authors are grateful to the referees for their valuable comments and suggestions which improved the contents of the article.

Authors’ Affiliations

(1)
School of Mathematics and Information Science, North China University of Water Resources and Electric Power
(2)
College of Science, Hebei University of Engineering

References

  1. Iiduka H: Fixed point optimization algorithm and its application to network bandwidth allocation. J. Comput. Appl. Math. 2012, 236: 1733–1742. 10.1016/j.cam.2011.10.004MathSciNetView ArticleMATHGoogle Scholar
  2. Mahato NK, Nahak C: Equilibrium problem under various types of convexities in Banach space. J. Math. Comput. Sci. 2011, 1: 77–88.MathSciNetGoogle Scholar
  3. Shen J, Pang LP: An approximate bundle method for solving variational inequalities. Commun. Optim. Theory 2012, 1: 1–18.Google Scholar
  4. Cho SY, Kang SM: Approximation of common solutions of variational inequalities via strict pseudocontractions. Acta Math. Sci. 2012, 32: 1607–1618. 10.1016/S0252-9602(12)60127-1View ArticleMATHMathSciNetGoogle Scholar
  5. Abdel-Salam HS, Al-Khaled K: Variational iteration method for solving optimization problems. J. Math. Comput. Sci. 2012, 2: 1475–1497.MathSciNetGoogle Scholar
  6. Censor Y, Cohen N, Kutscher T, Shamir J: Summed squared distance error reduction by simultaneous multiprojections and applications. Appl. Math. Comput. 2002, 126: 157–179. 10.1016/S0096-3003(00)00144-2MathSciNetView ArticleMATHGoogle Scholar
  7. Carmi A, Censor Y, Gurfil P: Convex feasibility modeling and projection methods for sparse signal recovery. J. Comput. Appl. Math. 2012, 236: 4318–4335. 10.1016/j.cam.2012.03.021MathSciNetView ArticleMATHGoogle Scholar
  8. Qin X, Chang SS, Kang SM: Iterative methods for generalized equilibrium problems and fixed point problems with applications. Nonlinear Anal. 2010, 11: 2963–2972. 10.1016/j.nonrwa.2009.10.017View ArticleMATHMathSciNetGoogle Scholar
  9. Khader MM, Mohamed ST: Numerical treatment for first order neutral delay differential equations using spline functions. Eng. Math. Lett. 2012, 1: 32–43.Google Scholar
  10. Noor MA, Noor KI, Waseem M: Decomposition method for solving system of linear equations. Eng. Math. Lett. 2012, 2: 34–41.Google Scholar
  11. Kim JK, Anh PN, Nam YM: Strong convergence of an extended extragradient method for equilibrium problems and fixed point problems. J. Korean Math. Soc. 2012, 49: 187–200. 10.4134/JKMS.2012.49.1.187MathSciNetView ArticleMATHGoogle Scholar
  12. Cho SY, Kang SM: Approximation of fixed points of pseudocontraction semigroups based on a viscosity iterative process. Appl. Math. Lett. 2011, 24: 224–228. 10.1016/j.aml.2010.09.008MathSciNetView ArticleMATHGoogle Scholar
  13. Haugazeau, Y: Sur les inéquations variationnelles et la minimisation de fonctionnelles convexes. Thése, Université de Paris, Paris, France (1968)Google Scholar
  14. Goebel K, Kirk WA: A fixed point theorem for asymptotically nonexpansive mappings. Proc. Am. Math. Soc. 1972, 35: 171–174. 10.1090/S0002-9939-1972-0298500-3MathSciNetView ArticleMATHGoogle Scholar
  15. Browder FE, Petryshyn WV: Construction of fixed points of nonlinear mappings in Hilbert space. J. Math. Anal. Appl. 1967, 20: 197–228. 10.1016/0022-247X(67)90085-6MathSciNetView ArticleMATHGoogle Scholar
  16. Qihou L: Convergence theorems of the sequence of iterates for asymptotically demicontractive and hemicontractive mappings. Nonlinear Anal. 1996, 26: 1835–1842. 10.1016/0362-546X(94)00351-HMathSciNetView ArticleMATHGoogle Scholar
  17. Schu J: Iterative construction of fixed points of asymptotically nonexpansive mappings. J. Math. Anal. Appl. 1991, 158: 407–413. 10.1016/0022-247X(91)90245-UMathSciNetView ArticleMATHGoogle 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 ArticleMATHGoogle Scholar
  19. 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
  20. Qin X, Cho SY, Kang SM: On hybrid projection methods for asymptotically quasi- ϕ -nonexpansive mappings. Appl. Math. Comput. 2010, 215: 3874–3883. 10.1016/j.amc.2009.11.031MathSciNetView ArticleMATHGoogle Scholar
  21. Zegeye H, Shahzad N: Strong convergence theorem for a common point of solution of variational inequality and fixed point problem. Adv. Fixed Point Theory 2012, 2: 374–397.MATHMathSciNetGoogle Scholar
  22. Yuan Q, Shang M: Convergence of an extragradient-like iterative algorithm for monotone mappings and nonexpansive mappings. Fixed Point Theory Appl. 2013., 2013: Article ID 67Google Scholar
  23. Kang SM, Cho SY, Liu Z: Convergence of iterative sequences for generalized equilibrium problems involving inverse-strongly monotone mappings. J. Inequal. Appl. 2010., 2010: Article ID 827082Google Scholar
  24. 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 ArticleMATHGoogle Scholar
  25. Tada A, Takahashi W: Weak and strong convergence theorem for an equilibrium problem and a nonexpansive mapping. J. Optim. Theory Appl. 2007, 133: 359–370. 10.1007/s10957-007-9187-zMathSciNetView ArticleMATHGoogle Scholar
  26. Qin X, Cho SY, Kang SM: An extragradient-type method for generalized equilibrium problems involving strictly pseudocontractive mappings. J. Glob. Optim. 2011, 49: 679–693. 10.1007/s10898-010-9556-2MathSciNetView ArticleMATHGoogle Scholar
  27. Kim JK: Strong convergence theorems by hybrid projection methods for equilibrium problems and fixed point problems of the asymptotically quasi- ϕ -nonexpansive mappings. Fixed Point Theory Appl. 2011., 2011: Article ID 10Google Scholar
  28. Kim JK, Cho SY, Qin X: Hybrid projection algorithms for generalized equilibrium problems and strictly pseudocontractive mappings. J. Inequal. Appl. 2010., 2010: Article ID 312602Google Scholar
  29. Yang L, Zhao F, Kim JK: Hybrid projection method for generalized mixed equilibrium problem and fixed point problem of infinite family of asymptotically quasi- ϕ -nonexpansive mappings in Banach spaces. Appl. Math. Comput. 2012, 218: 6072–6082. 10.1016/j.amc.2011.11.091MathSciNetView ArticleMATHGoogle Scholar
  30. Qin X, Cho SY, Kang SM: Strong convergence of shrinking projection methods for quasi- ϕ -nonexpansive mappings and equilibrium problems. J. Comput. Appl. Math. 2010, 234: 750–760. 10.1016/j.cam.2010.01.015MathSciNetView ArticleMATHGoogle Scholar
  31. Blum E, Oettli W: From optimization and variational inequalities to equilibrium problems. Math. Stud. 1994, 63: 123–145.MathSciNetMATHGoogle Scholar
  32. Reinermann J: Uber fixpunkte kontrahievuder Abbidungen und schwach konvergente Tooplite-Verfahren. Arch. Math. 1969, 20: 59–64. 10.1007/BF01898992MathSciNetView ArticleMATHGoogle Scholar
  33. Sahu DR, Xu HK, Yao JC: Asymptotically strict pseudocontractive mappings in the intermediate sense. Nonlinear Anal. 2009, 70: 3502–3511. 10.1016/j.na.2008.07.007MathSciNetView ArticleMATHGoogle Scholar

Copyright

© Cheng and Wu; licensee Springer 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.