1 Introduction

For several years, the study of fixed point theory for multi-valued nonlinear mappings has attracted, and continues to attract, the interest of several well known mathematicians (see, for example, Brouwer [1], Chang [2], Chidume et al. [3], Denavari and Frigon [4], Yingtaweesittikul [5], Kakutani [6], Nash [7, 8], Geanakoplos [9], Nadler [10], Downing and Kirk [11]).

Interest in such studies stems, perhaps, mainly from the usefulness of such fixed point theory in real-world applications, such as in Game Theory and Market Economy and in other areas of mathematics, such as in Non-Smooth Differential Equations (see e.g., [12]).

Game theory is perhaps the most successful area of application of fixed point theory for multi-valued mappings. However, it has been remarked that the applications of this theory to equilibrium problems in game theory are mostly static in the sense that while they enhance the understanding of conditions under which equilibrium may be achieved, they do not indicate how to construct a process starting from a non-equilibrium point that will converge to an equilibrium solution. Iterative methods for fixed points of multi-valued mappings are designed to address this problem. For more details, one may consult [1214].

Let K be a nonempty subset of a normed space E. The set K is called proximinal (see e.g., [1517]) if for each xE, there exists uK such that

d(x,u)=inf { x y : y K } =d(x,K),

where d(x,y)=xy for all x,yE. Every nonempty, closed and convex subset of a real Hilbert space is proximinal.

Let CB(K) and P(K) denote the families of nonempty, closed and bounded subsets, and of nonempty, proximinal and bounded subsets of K, respectively. The Hausdorff metric on CB(K) is defined by

D(A,B)=max { sup a A d ( a , B ) , sup b B d ( b , A ) } for all A,BCB(K).

Let T:D(T)ECB(E) be a multi-valued mapping on E. A point xD(T) is called a fixed point of T if xTx. The fixed point set of T is denoted by F(T):={xD(T):xTx}.

A multi-valued mapping T:D(T)ECB(E) is called L-Lipschitzian if there exists L>0 such that

D(Tx,Ty)Lxyx,yD(T).
(1.1)

When L(0,1) in (1.1), we say that T is a contraction, and T is called nonexpansive if L=1.

Several papers deal with the problem of approximating fixed points of multi-valued nonexpansive mappings (see, for example [1520] and the references therein) and their generalizations (see e.g., [21, 22]).

Recently, Abbas et al. [18], introduced a one-step iterative process as follows, x 1 K:

x n + 1 = a n x n + b n y n + c n z n ,n1.
(1.2)

Using (1.2), Abbas et al. proved weak and strong convergence theorems for approximation of common fixed point of two multi-valued nonexpansive mappings in real Banach spaces.

Very recently, Chidume et al. [12], introduced the class of multi-valued k-strictly pseudo-contractive maps defined on a real Hilbert space H as follows.

Definition 1.1 A multi-valued map T:D(T)HCB(H) is called k-strictly pseudo-contractive if there exists k(0,1) such that for all x,yD(T),

( D ( T x , T y ) ) 2 x y 2 +k x y ( u v ) 2 uTx,vTy.
(1.3)

In the case that T is single-valued, definition 1.1 reduces to the definition introduced and studied by Browder and Petryshn [23] as an important generalization of the class of nonexpansive mappings. Chidume et al. [12], proved strong convergence theorems for approximating fixed points of this class of mappings using a Krasnoselskii-type algorithm, [24] which is well known to be superior to the recursion formula of Mann [25] or Ishikawa [26].

In this paper, motivated by the results of Chidume et al. [12], Abbas et al. [18], Khastan [27], Eslamian [28], Shahzad and Zegeye [29] and Song and Wong [17], we introduce a new Krasnoselskii-type algorithm and prove strong convergence theorems for the sequence of the algorithm for approximating a common fixed point of a finite family of multi-valued strictly pseudo-contractive mappings in a real Hilbert space. Our results, under the setting of our theorems, generalize those of Abbas et al. [18] and Chidume et al. [12], which are themselves generalizations of many important results, from two multi-valued nonexpansive mappings, and a single multi-valued strictly pseudo-contractive mapping, respectively, to a finite family of multi-valued strictly pseudo-contractive mappings.

2 Main result

In the sequel, we shall need the following lemma whose proof can be found in Eslamian [28]. We reproduce the proof here for completeness.

Lemma 2.1 Let H be a real Hilbert space. Let { x i ,i=1,,m}H. For α i (0,1), i=1,,m such that i = 1 m α i =1, the following identity holds:

i = 1 m α i x i 2 = i = 1 m α i x i 2 i , j = 1 , i j m α i α j x i x j 2 .
(2.1)

Proof The proof is by induction. For m=2, (2.1) reduces to the standard identity in Hilbert spaces. Assume that (2.1) is true for some k2, that is,

i = 1 k α i x i 2 = i = 1 k α i x i 2 i , j = 1 , i j k α i α j x i x j 2 .
(2.2)

Then

i = 1 k + 1 α i x i 2 = α 1 x 1 2 + ( 1 α 1 ) i = 2 k + 1 α i ( 1 α 1 ) x i 2 α 1 ( 1 α 1 ) i = 2 k + 1 α i ( 1 α 1 ) ( x 1 x i ) 2 = α 1 x 1 2 + ( 1 α 1 ) i = 1 k α i + 1 x i + 1 2 α 1 ( 1 α 1 ) i = 1 k α i + 1 ( x 1 x i + 1 ) 2 , α i : = α i ( 1 α 1 ) .
(2.3)

Using (2.2) in (2.3), we obtain

i = 1 k + 1 α i x i 2 = α 1 x 1 2 + ( 1 α 1 ) [ i = 1 k α i + 1 x i + 1 2 i , j = 1 , i j k α i + 1 α j + 1 x i + 1 x j + 1 2 ] α 1 ( 1 α 1 ) [ i = 1 k α i + 1 ( x 1 x i + 1 ) 2 i , j = 1 , i j k α i + 1 α j + 1 x i + 1 x j + 1 2 ] = i = 1 k + 1 α i x i 2 i = 2 k + 1 α 1 α i ( x 1 x i ) 2 i , j = 2 , i j k + 1 α i α j x i x j 2 = i = 1 k + 1 α i x i 2 i , j = 1 , i j k + 1 α i α j x i x j 2 .
(2.4)

Therefore, by induction, we find that (2.1) is true. This completes the proof. □

We now prove the following theorem.

Theorem 2.2 Let K be a nonempty, closed and convex subset of a real Hilbert space H and T i :KCB(K) be a finite family of multi-valued k i -strictly pseudo-contractive mappings, k i (0,1), i=1,,m such that i = 1 m F( T i ). Assume that for p i = 1 m F( T i ), T i p={p}. Let { x n } be a sequence defined by x 0 K,

x n + 1 = λ 0 x n + λ 1 y n 1 + λ 2 y n 2 ++ λ m y n m ,
(2.5)

where y n i T i x n , n1 and λ i (k,1), i=0,1,,m, such that i = 0 m λ i =1 and k:=max{ k i ,i=1,,m}. Then lim n d( x n , T i x n )=0 i=0,,m.

Proof Let p i = 1 m F( T i ). Then

x n + 1 p 2 = λ 0 ( x n p ) + i = 1 m λ i ( y n i p ) 2 := i = 0 m λ i z i 2 ,

where z 0 =( x n p), z i =( y n i p), i=1,,m, and i = 1 m λ i z i = i = 1 m λ i ( y n i p).

Using Lemma 2.3 of [12] and the identity (2.1), we obtain the following estimates:

x n + 1 p 2 = λ 0 x n p 2 + i = 1 m λ i y n i p 2 i = 1 m λ i λ 0 x n y n i 2 i , j = 1 , i j m λ i λ j y n i y n j 2 λ 0 x n p 2 + i = 1 m λ i y n i p 2 i = 1 m λ i λ 0 x n y n i 2 λ 0 x n p 2 + i = 1 m λ i ( D ( T i x n , T i p ) ) 2 i = 1 m λ i λ 0 x n y n i 2 = x n p 2 i = 1 m λ i ( λ 0 k ) x n y n i 2 .
(2.6)

Thus, since λ i (k,1), we obtain

i = 1 m x n y n i 2 1 ( λ 0 k ) k ( x n p 2 x n + 1 p 2 ) n1.

This implies that, for each i=1,2,,m, n = 1 x n y n i 2 <. Hence, lim n x n y n i =0, for each i=1,,m. Since y n i T i x n , i=1,,m, we have 0d( x n , T i x n ) x n y n i and so

lim n d( x n , T i x n )=0.

This completes the proof. □

Definition 2.3 A mapping T:KCB(K) is called hemicompact if, for any sequence { x n } in K such that d( x n ,T x n )0 as n, there exists a subsequence { x n k } of { x n } such that x n k pK. We note that if K is compact, then every multi-valued mapping T:KCB(K) is hemicompact.

Theorem 2.4 Let K be a nonempty, closed and convex subset of a real Hilbert space H and T i :KCB(K) be a finite family of multi-valued k i -strictly pseudo-contractive mappings, k i (0,1), i=1,,m such that i = 1 m F( T i ). Assume that for p i = 1 m F( T i ), T i p={p} and T i , i=1,,m is hemicompact and continuous. Let { x n } be a sequence defined by x 0 K,

x n + 1 = λ 0 x n + λ 1 y n 1 + λ 2 y n 2 ++ λ m y n m ,
(2.7)

where y n i T i x n , n1 and λ i (k,1), i=0,1,,m such that 0 = 1 m λ i =1 with k:=max{ k i ,i=1,,m}. Then the sequence { x n } converges strongly to an element of i = 1 m F( T i ).

Proof From Theorem 2.2, we have lim n d( x n , T i x n )=0, i=1,,m. Since T i , i=1,,m, is hemicompact, there exists a subsequence { x n k } of { x n } such that x n k q as k for some qK. Moreover, by continuity of T i , i=1,,m, we also have d( x n k , T i x n k )d(q, T i q), i=1,,m as k. Therefore, d(q, T i q)=0, i=1,,m and so qF( T i ). Setting p=q in the proof of Theorem 2.2, it follows from inequality (2.6) that lim n x n q exists. So, { x n } converges strongly to q i = 1 m F( T i ). This completes the proof. □

The following is an immediate corollary of Theorem 2.4. The proof basically follows as the proof of its analog for single multi-valued strictly pseudo-contractive map in Chidume et al. [12]. The proof is therefore omitted.

Corollary 2.5 Let K be a nonempty, compact and convex subset of a real Hilbert space H and T i :KCB(K) be a finite family of multi-valued k i -strictly pseudo-contractive mappings, k i (0,1), i=1,,m such that i = 1 m F( T i ). Assume that for p i = 1 m F( T i ), T i p={p} and T i , i=1,,m is continuous. Let { x n } be a sequence defined by x 0 K,

x n + 1 = λ 0 x n + λ 1 y n 1 + λ 2 y n 2 ++ λ m y n m ,
(2.8)

where y n i T i x n , n1 and λ i (k,1), i=0,1,,m such that 0 = 1 m λ i =1 with k:=max{ k i ,i=1,,m}. Then the sequence { x n } converges strongly to an element of i = 1 m F( T i ).

Remark 2.6 In Theorem 2.4, the continuity assumption on T i , i=1,,m can be dispensed with if we assume that for every xK, T i x, i=1,,m is proximinal and weakly closed.

Remark 2.7 If we set i=1 in all the results obtained in this paper, we recover the results of Chidume et al. [12].

Remark 2.8 The recursion formulas studied in this paper are of the Krasnoselkii type (see e.g. [24]) which is well known to be superior to the recursion formula of either the Mann algorithm or the so-called Ishikawa-type algorithm.

Remark 2.9 Our theorems and corollary improve the results of Chidume et al. [12] from single multi-valued strictly pseudo-contractive mapping to finite family of multi-valued strictly pseudo-contractive mappings. Furthermore, under the setting of Hilbert space, our theorems and corollary improve the convergence theorems for multi-valued nonexpansive mappings to the more general class of multi-valued strictly pseudo-contractive mappings studied in Sastry and Babu [15], Panyanak [16], Song and Wang [17], Shahzad and Zegeye [29] and Abbas et al. [18]. Also, in all our algorithms, y n T x n is arbitrary and is not required to satisfy the very restrictive condition, ‘ y n T( x n ) such that y n x =d( x ,T x n )’ imposed in [1518, 20, 29].

For examples of multi-valued maps such that, for each xK, the set Tx is proximinal and weakly closed, the reader may consult Chidume et al. [12].