1 Introduction

Let E be a reflexive real Banach space E, and E its dual. Let f:E(,] be a proper convex and lower semicontinuous function. The subdifferential of f at xE is the convex set defined by

f(x)= { x E : f ( x ) + x , y x f ( y ) , y E } .
(1.1)

The Fenchel conjugate of f is the function f : E (,+] defined by f (y)=sup{y,xf(x):xE}. It is not difficult to check that when f is proper and lower semicontinuous, so is f .

The function f is said to be essentially smooth if ∂f is both locally bounded and single-valued on its domain. It is called essentially strictly convex, if ( f ) 1 is locally bounded on its domain and f is strictly convex on every convex subset of domf. f is said to be Legendre, if it is both essentially smooth and essentially strictly convex.

Let domf={xE:f(x)<}. Then for any xint(domf) and yE, the right-hand derivative of f at x in the direction of y is defined by

f (x,y):= lim t 0 + f ( x + t y ) f ( x ) t .
(1.2)

If the limit in (1.2) exists then f is called Gâteaux differentiable at x. In this case, f (x,y) coincides with f(x), the value of the gradient ∇f of f at x. The function f is called Gâteaux differentiable if it is Gâteaux differentiable for any xint(domf). The function f called Fréchet differentiable at x if the limit in (1.2) is attained uniformly for all yE such that y=1 and f is said to be uniformly Fréchet differentiable on a subset C of E if the limit is attained uniformly for xC and y=1. When the subdifferential of f is single-valued, it coincides with the gradient f=f (see [1]).

We remark that if E is a reflexive Banach space. Then we have

  1. (1)

    f is essentially smooth if and only if f is essentially strictly convex (see [2], Theorem 5.4).

  2. (2)

    ( f ) 1 = f (see [3]).

  3. (3)

    f is Legendre if and only if f is Legendre (see [2], Corollary 5.5).

  4. (4)

    If f is Legendre, then ∇f is a bijection satisfying f= ( f ) 1 , ranf=dom f =int(dom f ) and ran f =domf=int(domf) (see [2], Theorem 5.10).

When E is a smooth and strictly convex Banach space, one important and interesting example of Legendre function is f(x):= x p (1<p<). In this case the gradient f=p J p (1<p<), where J p is the generalized duality mapping from E into 2 E defined by

J p (x)= { f E : x , f = x p , f = x p 1 } .

In particular, J= J 2 is called the normalized duality mapping. It is well known that if E is strictly convex, then J p is single-valued and that

J p (x)= x p 2 J(x),x0.

If E=H, a Hilbert space, then J is the identity mapping and hence f=2I, where I is the identity mapping in H.

In this paper, E is a reflexive real Banach space, f:E(,+] is a proper, lower semicontinuous, and convex function, and f : E (,+] is the Fenchel conjugate of f.

Let f:E(,+] be a Gâteaux differentiable function. The function D f :domf×int(domf)[0,+) defined by

D f (x,y):=f(x)f(y) f ( y ) , x y

is called the Bregman distance with respect to f [4]. Since ( f ) 1 = f and f (f)=x,f(x)f(x), it is easy to check that

D f ( f ( y ) , f ( x ) ) = D f (x,y).
(1.3)

A Bregman projection [5] of xint(domf) onto the nonempty closed and convex set Cint(domf) is the unique vector P C f (x)C satisfying

D f ( P C f ( x ) , x ) =inf { D f ( y , x ) : y C } .

Remark 1.1 If E is a smooth and strictly convex Banach space and f(x)= x 2 for all xE, then we have f(x)=2Jx, for all xE, where J the normalized duality mapping and hence the function D f (x,y) reduces to ϕ(x,y) which is defined by ϕ(x,y)= x 2 2x,Jy+ y 2 for all x,yE, which is the Lyapunov function introduced by Alber [6], and P C f (x) reduces to the generalized projection Π C (x) (see, e.g., [6]), which is defined by

ϕ ( Π C ( x ) , x ) = min y C ϕ(y,x).

If E=H, a Hilbert space, then J is the identity mapping and hence the Bregman distance becomes D f (x,y)= x y 2 , for x,yH, and the Bregman projection P C f (x) reduces to the metric projection P C of H on to C.

Let C be a nonempty closed and convex subset of int(dom(f)). Let T:Cint(dom(f)) be a mapping. An element pC is called a fixed point of T if T(p)=p. The set of fixed points of T is denoted by F(T). A point p in C is said to be an asymptotic fixed point of T (see [7]) if C contains a sequence { x n } which converges weakly to p such that lim n x n T x n =0. The set of asymptotic fixed points of T will be denoted by F ˆ (T). T is said to be nonexpansive if TxTyxy for each x,yC, and is called quasi-nonexpansive if F(T) and Txpxp for all xC and pF(T). The mapping T is called relatively nonexpansive if (A1) F(T); (A2) ϕ(p,Tx)ϕ(p,x) for xC and pF(T), and (A3) F(T)= F ˆ (T) and is said to be Bregman relatively nonexpansive with respect to f if (B1) F(T); (B2) D f (p,Tx) D f (p,x) for xC, pF(T) and (B3) F(T)= F ˆ (T). We remark that the class of relatively nonexpansive mappings is contained in a class of Bregman relatively nonexpansive mappings with respect to f(x)= x 2 .

Let N(C) and CB(C) denote the family of nonempty subsets and nonempty closed bounded subsets of C, respectively. Let H be the Hausdorff metric on CB(C) defined by

H(A,B)=max { sup a A d ( a , B ) , sup b B d ( b , A ) } ,

for all A,BCB(C), where d(a,B)=inf{ab:bB} is the distance from the point a to the subset B.

Let T:CCB(C) be a mapping. T is said to be nonexpansive if H(Tx,Ty)xy, for all x,yC. An element pC is called a fixed point of T, if pF(T), where F(T):={pC:pT(p)}. A point pC is called an asymptotic fixed point of T, if there exists a sequence { x n } in C which converges weakly to p such that lim n d( x n ,T x n )=0. T is called relatively nonexpansive if (A1)′ F(T); (A2)′ ϕ(p,u)ϕ(p,x) for all uTx, xC, and (A3)′ F(T)= F ˆ (T). A mapping T is called quasi-Bregman nonexpansive with respect to f if F(T) and D f (p,u) D f (p,x) for all uTx, xC, pF(T) and is called Bregman relatively nonexpansive with respect to f if (B1)′ F(T); (B2)′ D f (p,u) D f (p,x) for uTx, xC, pF(T), and (B3)′ F(T)= F ˆ (T).

We note that the class of multi-valued relatively nonexpansive mappings is contained in a class of multi-valued Bregman relatively nonexpansive mappings which includes the class of single-valued Bregman relatively nonexpansive mappings. Hence, the class of multi-valued Bregman relatively nonexpansive mappings is a more general class of mappings. An example of a multi-valued Bregman relatively nonexpansive mapping is given now.

Example 1.2 Let I=[0,1], X= L p (I), 1<p< and C={fX:f(x)0,xI}. Let T:CCB(C) be defined by

T(f)= { { h C : f ( x ) 1 2 h ( x ) f ( x ) 1 4 , x I } , if  f ( x ) > 1 , x I ; { 0 } , otherwise .

Let g:ER be defined by g(x)= 1 p x p , 1<p<, xE. Clearly, we have g(x)= J p (x) for all xE, and g ( x )= 1 q x q , where 1<q< satisfies 1 p + 1 q =1. It is clear that F(T)={0}. Let fC and hT(f) such that f(x)>1 for all x[0,1]. Then, using (1.3), we get

D g ( 0 , h ) = D g ( g ( h ) , g ( 0 ) ) = D g ( J p ( h ) , 0 ) = g ( J p ( h ) ) g ( 0 ) g ( 0 ) , J p ( h ) 0 = 1 q J p ( h ) q 1 q J p ( f ) q = D g ( J p ( f ) , 0 ) = D g ( 0 , f ) .

Next, let fC such that there exists xI such that f(x)1, then

D g (0,0)= D g (0,0) D g ( J p ( f ) , 0 ) = D g (0,f).

Hence, T is a multi-valued quasi-Bregman nonexpansive mapping. Now, we show that F ˆ (T)=F(T). Let { f n }C be a sequence which converges weakly to h, and z n =d( f n ,T( f n ))0. Let nN, then we have

z n = { 1 4 , if  f n ( x ) > 1 , x [ 0 , 1 ] ; f n p , otherwise .

Since z n 0, we have f n p 0 and hence h=0. Therefore, T is a multi-valued Bregman relatively nonexpansive mapping.

The approximations of fixed points of nonexpansive, quasi-nonexpansive, relatively nonexpansive, and relatively quasi-nonexpansive mappings when they exist have been intensively studied for almost 40 years or so by various authors (see, e.g., [818] and the references therein) in Banach spaces.

In 1967, Bregman [5] discovered an effective technique using the so-called Bregman distance function D f in the process of designing and analyzing feasibility and optimization algorithms. This opened a growing area of research in which Bregman’s technique is applied in various ways in order to design and analyze iterative algorithms for solving not only feasibility and optimization problems, but also algorithms for solving variational inequality problems, equilibrium problems, fixed point problems for nonlinear mappings, and so on (see, e.g., [7, 19, 20], and the references therein).

In [21], Reich and Sabach proposed the following algorithms for finding common fixed points of finitely many Bregman firmly nonexpansive operators defined on a nonempty, closed and convex subset C of a reflexive Banach space E (see also [22, 23]). The construction of fixed points for Bregman-type single-valued mappings via iterative processes has been investigated in, for example, [21, 2427]. This now leads to the following important question.

Question Is it possible to obtain the results of Reich and Sabach [21] for the class of multi-valued Bregman relatively nonexpansive mappings?

The study of fixed points for multi-valued nonexpansive mappings using the Hausdorff metric was introduced by Markin [28] (see also [29]). Later, an interesting and rich fixed point theory for such mappings was developed which has applications in control theory, convex optimization, differential inclusion, and economics (see, for example, [30] and references therein). Moreover, the existence of fixed points for multi-valued nonexpansive mappings in uniformly convex Banach spaces was proved by Lim [31] (see also [32]).

Recently, Homaeipour and Razani [33] studied the following iterative scheme for a fixed point of relatively nonexpansive multi-valued mapping in uniformly convex and uniformly smooth Banach space E:

{ x 0 C , chosen arbitrary , x n + 1 = Π C J 1 ( α n J x n + ( 1 α n ) J z n ) , z n T x n , n 0 ,
(1.4)

where { α n }(0,1) for all n0 and lim inf n α n (1 α n )>0. They proved that if J is weakly sequentially continuous then the sequence { x n } converges weakly to a fixed point of T. Furthermore, it is shown that the scheme converges strongly to a fixed point of T if the interior of F(T) is nonempty.

More recently, Zegeye and Shahzad [34], extended the above result to a finite family of multi-valued relatively nonexpansive mappings without the assumption that the interior of F(T) is nonempty. In fact, they proved that if C is a nonempty, closed, and convex subset of a uniformly smooth and uniformly convex real Banach space E and T i :CCB(C), for i=1,2,,N, are relatively nonexpansive multi-valued mappings with F:= i = 1 N F( T i ) nonempty, then the sequence { x n } generated by

{ x 0 = w C , chosen arbitrarily , y n = Π C J 1 ( α n J w + ( 1 α n ) J x n ) , x n + 1 = J 1 ( β n , 0 J x n + i = 1 N β n , i J u n , i ) , u n , i T i y n , n 0 ,

where α n (0,1) and { β n , i }[a,b](0,1), for i=1,2,,N, satisfy certain conditions, converges strongly to an element of ℱ.

In this paper, it is our purpose to introduce an iterative scheme which converges strongly to a common fixed point of a finite family of multi-valued Bregman relatively nonexpansive mappings. We prove strong convergence theorems for the sequences produced by the method. Our results improve and generalize many known results in the current literature (see, for example, [33, 34]).

2 Preliminaries

Let E be a reflexive real Banach space and E as its dual. Let f:E(,+] be a Gâteaux differentiable function. The modulus of the total convexity of f at xdomf is the function ν f (x,):[0,+)[0,+] defined by

ν f (x,t):=inf { D f ( y , x ) : y dom f , y x = t } .

The function f is called totally convex at x if ν f (x,t)>0, whenever t>0. The function f is called totally convex if it is totally convex at any point xint(domf) and is said to be totally convex on bounded sets if ν f (B,t)>0 for any nonempty bounded subset B of E and t>0, where the modulus of total convexity of the function f on the set B is the function ν f :intdomf×[0,+)[0,+] defined by

ν f (B,t):=inf { V f ( x , t ) : x B dom f } .

Let E be a Banach space and let B r :={zE:zr} for all r>0 and S E ={xE:x=1}. Then a function f:ER is said to be uniformly convex on bounded subsets of E [[35], pp.203] if ρ r (t)>0 for all r,t>0, where ρ r :[0,)[0,] is defined by

ρ r (t):= inf x , y B r , x y = t , α ( 0 , 1 ) α f ( x ) + ( 1 α ) f ( y ) f ( α x + ( 1 α ) y ) α ( 1 α ) ,

for all t0. The function ρ r is called the gauge of the uniform convexity of f. We know that f is totally convex on bounded sets if and only if f is uniformly convex on bounded sets (see [36], Theorem 2.10).

If f is uniformly convex, then the following lemma is known.

Lemma 2.1 [37]

Let E be a Banach space, let r>0 be a constant, and let f:ER be a uniformly convex function on bounded subsets of E. Then

f ( k = 0 n α k x k ) k = 0 n α k f( x k ) α i α j ρ r ( x i y j ) ,

for all i,j{0,1,2,,n}, x k Br, α k (0,1), and k=0,1,2,,n with k = 0 n α k =1, where ρ r is the gauge of uniform convexity of f.

A function f on E is coercive [38] if the sublevel set of f is bounded; equivalently, lim x f(x)=. A function f on E is said to be strongly coercive [35] if lim x f(x)/x=.

In the sequel, we shall need the following lemmas.

Lemma 2.2 [39]

The function f:E(,+) is totally convex on bounded subsets of E if and only if for any two sequences { x n } and { y n } in int(domf) and domf, respectively, such that the first one is bounded, we have

lim n D f ( y n , x n )=0 lim n y n x n =0.

Lemma 2.3 [35]

Let f:ER be a strongly coercive and uniformly convex on bounded subsets of E, then f is bounded and uniformly Fréchet differentiable on bounded subsets of  E .

Lemma 2.4 [26]

Let f:E(,+] be a uniformly Fréchet differentiable and bounded on bounded sets of E, thenf is uniformly continuous on bounded subsets of E from the strong topology of E to the strong topology of  E .

Lemma 2.5 [1]

Let f:E(,+] be a proper, lower semicontinuous and convex function, then f : E (,+] is a proper, weak lower semicontinuous and convex function. Thus, for all zE, we have

D f ( z , f ( i = 1 N t i f ( x i ) ) ) i = 1 N t i D f (z, x i ).
(2.1)

Lemma 2.6 [40]

Let f:ER be a Gâteaux differentiable on int(domf) such that f is bounded on bounded subsets of dom f . Let xE and { x n }E. If { D f (x, x n )} is bounded, so is the sequence { x n }.

Lemma 2.7 [36]

Let C be a nonempty, closed, and convex subset of E. Let f:ER be a Gâteaux differentiable and totally convex function and let xE. Then

  1. (i)

    z= P C f (x) if and only if f(x)f(z),yz0, yC.

  2. (ii)

    D f (y, P C f (x))+ D f ( P C f (x),x) D f (y,x), yC.

Let f:ER be a Legendre and Gâteaux differentiable function. Following [6] and [4], we make use of the function V f :E× E [0,+) associated with f, which is defined by

V f ( x , x ) =f(x) x , x + f ( x ) ,xE, x E .
(2.2)

Then we observe that V f is nonnegative and

V f ( x , x ) = D f ( x , f ( x ) ) for all xE and  x E .
(2.3)

Moreover, by the subdifferential inequality,

V f ( x , x ) + y , f ( x ) x V f ( x , x + y ) ,
(2.4)

xE and x , y E (see [41]).

Lemma 2.8 [42]

Let { a n } be a sequence of nonnegative real numbers satisfying the following relation:

a n + 1 (1 α n ) a n + α n δ n ,n n 0 ,

where { α n }(0,1) and { δ n }R satisfy the following conditions: lim n α n =0, n = 1 α n =, and lim sup n δ n 0. Then lim n a n =0.

Lemma 2.9 [43]

Let { a n } be sequences of real numbers such that there exists a subsequence { n i } of {n} such that a n i < a n i + 1 for all iN. Then there exists an increasing sequence { m k }N such that m k and the following properties are satisfied by all (sufficiently large) numbers kN:

a m k a m k + 1 and a k a m k + 1 .

In fact, m k is the largest number n in the set {1,2,,k} such that the condition a n a n + 1 holds.

3 Main result

In the sequel we shall use the following proposition.

Proposition 3.1 Let f:ER be a uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let C be a nonempty, closed, and convex subset of int(domf) and T:CCB(C) be a Bregman relatively nonexpansive mapping. Then F(T) is closed and convex.

Proof First, we show that F(T) is closed. Let { x n } be a sequence in F(T) such that x n x . Since T is Bregman relatively nonexpansive mapping, we have D f ( x n ,u) D f ( x n , x ), for all uT x for all nN. Therefore,

D f ( x , u ) = lim n D f ( x n , u ) lim n D f ( x n , x ) = D f ( x , x ) = 0 .
(3.1)

Thus, by Lemma 2.2 we obtain x =u. Hence, x F(T) and F(T) is closed. Next, we show that F(T) is convex. Let x,yF(T) and p=tx+(1t)y for t(0,1). We show that pF(T). Let wT(p), then we have

D f ( p , w ) = f ( p ) f ( w ) f ( w ) , p w = f ( p ) f ( w ) f ( w ) , t x + ( 1 t ) y w = f ( p ) + t D f ( x , w ) + ( 1 t ) D f ( y , w ) t f ( x ) ( 1 t ) f ( y ) f ( p ) + t D f ( x , p ) + ( 1 t ) D f ( y , p ) t f ( x ) ( 1 t ) f ( y ) f ( p ) + t [ f ( x ) f ( p ) f ( p ) , x p ] + ( 1 t ) [ f ( y ) f ( p ) f ( p ) , y p ] t f ( x ) ( 1 t ) f ( y ) = f ( p ) , t x + ( 1 t ) y p = 0 .

Thus, by Lemma 2.2 we get pT(p). Hence, pF(T) and F(T) is convex. Therefore, F(T) is closed and convex. □

Theorem 3.2 Let f:ER be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let C be a nonempty, closed and convex subset of int(domf) and T i :CCB(C), for i=1,2,,N, be a finite family of Bregman relatively nonexpansive mappings such that F:= i = 1 N F( T i ) is nonempty. For u, x 0 C let { x n } be a sequence generated by

{ w n = P C f f ( α n f ( u ) + ( 1 α n ) f ( x n ) ) , x n + 1 = f ( β 0 f ( w n ) + i = 1 N β i f ( u i , n ) ) , u i , n T i w n , n 0 ,
(3.2)

where { α n }(0,1) and { β i } i = 0 N [c,d](0,1) satisfy lim n α n =0, n = 1 α n = and i = 0 N β i =1. Then { x n } converges strongly to p= P F f (u).

Proof Proposition 3.1 ensures that each F( T i ), for i{1,2,,N}, and hence F , is closed and convex. Thus, P F f is well defined. Let p= P F f (u). Then, from (3.2), Lemmas 2.7, 2.5, and the property of D f , we get

D f ( p , w n ) = D f ( p , P C f f ( α n f ( u ) + ( 1 α n ) f ( x n ) ) ) D f ( p , f ( α n f ( u ) + ( 1 α n ) f ( x n ) ) ) = α n D f ( p , u ) + ( 1 α n ) D f ( p , x n ) .
(3.3)

Moreover, from (3.2), (2.3), and (2.2) we get

D f ( p , x n + 1 ) = D f ( p , f ( β 0 f ( w n ) + i = 1 N β i f ( u i , n ) ) ) = V f ( p , β 0 f ( w n ) + i = 1 N β i f ( u i , n ) ) = f ( p ) p , β 0 f ( w n ) + i = 1 N β i f ( u i , n ) + f ( β 0 f ( w n ) + i = 1 N β i f ( u i , n ) ) .

Since f is uniformly Fréchet differentiable function we find that f is uniformly smooth and hence by Theorem 3.5.5 of [35] we find that f is uniformly convex. This, with Lemma 2.1 and (3.3), gives

D f ( p , x n + 1 ) f ( p ) β 0 p , f ( w n ) i = 1 N β i p , f ( u i , n ) + β 0 f ( f ( w n ) ) + i = 1 N β i f ( f ( u i , n ) ) β 0 β i ρ r ( f ( w n ) f ( u i , n ) ) = β 0 V ( p , f ( w n ) ) + i = 1 N β i V ( p , f ( u i , n ) ) β 0 β i ρ r ( f ( w n ) f ( u i , n ) ) = β 0 D f ( p , w n ) + i = 1 N β i D f ( p , u i , n ) β 0 β i ρ r ( f ( w n ) f ( u i , n ) ) β 0 D f ( p , w n ) + i = 1 N β i D f ( p , w n ) β 0 β i ρ r ( f ( w n ) f ( u i , n ) ) D f ( p , w n ) β 0 β i ρ r ( f ( w n ) f ( u i , n ) ) D f ( p , w n )
(3.4)
α n D f (p,u)+(1 α n ) D f (p, x n ),
(3.5)

for each i{1,2,,N}. Thus, by induction,

D f (p, x n + 1 )max { D f ( p , u ) , D f ( p , x 0 ) } ,n0,

which implies that { x n } is bounded. Furthermore, from (3.2), (2.3), (2.4), and Lemma 2.7 we obtain

D f ( p , w n ) = D f ( p , P C f f ( α n f ( u ) + ( 1 α n ) f ( x n ) ) ) D f ( p , f ( α n f ( u ) + ( 1 α n ) f ( x n ) ) ) = V f ( p , α n f ( u ) + ( 1 α n ) f ( x n ) ) V f ( p , α n f ( u ) + ( 1 α n ) f ( x n ) α n ( f ( u ) f ( p ) ) ) + α n f ( u ) f ( p ) , w n p = V f ( p , α n f ( p ) + ( 1 α n ) f ( x n ) ) + α n f ( u ) f ( p ) , w n p = D f ( p , f ( α n f ( p ) + ( 1 α n ) f ( x n ) ) ) + α n f ( u ) f ( p ) , w n p α n D f ( p , p ) + ( 1 α n ) D f ( p , x n ) + α n f ( u ) f ( p ) , w n p = ( 1 α n ) D f ( p , x n ) + α n f ( u ) f ( p ) , w n p .
(3.6)

Furthermore, from (3.4) and (3.6) we have

D f ( p , x n + 1 ) ( 1 α n ) D f ( p , x n ) + α n f ( u ) f ( p ) , w n p β 0 β i ρ r ( f ( w n ) f ( u i , n ) )
(3.7)
(1 α n ) D f (p, x n )+ α n f ( u ) f ( p ) , w n p .
(3.8)

Now, we consider two cases.

Case 1. Suppose that there exists n 0 N such that { D f (p, x n )} is non-increasing for all n n 0 . In this situation, { D f (p, x n )} is convergent. Then, from (3.7), we have

β 0 β i ρ r ( f ( w n ) f ( u i , n ) ) 0,
(3.9)

which implies, by the property of ρ r that

f( w n )f( u i , n )0as n.
(3.10)

Now, since f is strongly coercive and uniformly convex on bounded subsets of E by Lemma 2.3 we see that f is uniformly Fréchet differentiable on bounded subsets of E and since f is Legendre by Lemma 2.4 we find that f is uniformly continuous on bounded subsets of E and hence from (3.10) we get

w n u i , n 0as n.
(3.11)

In addition, since d( w n , T i w n ) w n u i , n we have

d( w n , T i w n )0as n,
(3.12)

for each i{1,2,,N}. Since { w n } is bounded and E is reflexive, we choose a subsequence { w n j } of { w n } such that w n j w and lim sup n f(u)f(p), w n p= lim j f(u)f(p), w n j p. Thus, from (3.12) and the fact that each T i is Bregman relatively nonexpansive mapping we obtain wF( T i ), for each i{1,2,,N} and hence w i = 1 N F( T i ).

Therefore, by Lemma 2.7, we immediately obtain

lim sup n f ( u ) f ( p ) , w n p = lim j f ( u ) f ( p ) , w n j p = f ( u ) f ( p ) , w p 0 .

It follows from Lemma 2.8 and (3.8) that D f (p, x n )0 as n. Consequently, by Lemma 2.2 we obtain x n pF.

Case 2. Suppose that there exists a subsequence { n l } of {n} such that

D f (p, x n l )< D f (p, x n l + 1 ),

for all lN. Then, by Lemma 2.9, there exists a nondecreasing sequence { m k }N such that m k , D f (p, x m k ) D f (p, x m k + 1 ), and D f (p, x k ) D f (p, x m k + 1 ), for all kN. Then, from (3.7) and the fact that α n 0, we obtain

ρ r ( f ( w m k ) f ( u i , n k ) ) 0as k,

for each i{1,2,,N}. Thus, following the method of proof of Case 1, we obtain d( w m k , T i w m k )0 as k, and hence we obtain

lim sup k f ( u ) f ( p ) , w m k p 0.
(3.13)

Then, from (3.8), we get

D f (p, x m k + 1 )(1 α m k ) D f (p, x m k )+ α m k f ( u ) f ( p ) , w m k p .
(3.14)

Now, since D f (p, x m k ) D f (p, x m k + 1 ), inequality (3.14) implies that

α m k D f ( p , x m k ) D f ( p , x m k ) D f ( p , x m k + 1 ) + α m k f ( u ) f ( p ) , w m k p α m k f ( u ) f ( p ) , w m k p .

Thus, we get

D f (p, x m k ) f ( u ) f ( p ) , w m k p .
(3.15)

Then, from (3.15) and (3.13), we obtain D f (p, x m k )0 as k. This, together with (3.14), gives D f (p, x m k + 1 )0 as k. But D f (p, x k ) D f (p, x m k + 1 ) for all kN, and hence we obtain x k pF. Therefore, from the above two cases, we can conclude that { x n } converges strongly to p= P F f (u) and the proof is complete. □

If in Theorem 3.2, we assume that N=1, then we get the following corollary.

Corollary 3.3 Let f:ER be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let C be a nonempty, closed, and convex subset of int(domf) and T:CCB(C) be a Bregman relatively nonexpansive mapping such that F(T) is nonempty. For u, x 0 C let { x n } be a sequence generated by

{ w n = P C f f ( α n f ( u ) + ( 1 α n ) f ( x n ) ) , x n + 1 = f ( β f ( w n ) + ( 1 β ) f ( u n ) ) , u n T w n , n 0 ,
(3.16)

where { α n }(0,1) and β(0,1) satisfy lim n α n =0, n = 1 α n =. Then { x n } converges strongly to p= P F f (u).

If, in Theorem 3.2, we assume that each T i , i=1,2,,N is a single-valued Bregman relatively nonexpansive mapping, we get the following corollary.

Corollary 3.4 Let f:ER be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let C be a nonempty, closed and convex subset of int(domf) and T i :CC, for i=1,2,,N, be a finite family of Bregman relatively nonexpansive mappings such that F:= i = 1 N F( T i ) is nonempty. For u, x 0 C let { x n } be a sequence generated by

{ w n = P C f f ( α n f ( u ) + ( 1 α n ) f ( x n ) ) , x n + 1 = f ( β 0 f ( w n ) + i = 1 N β i f ( T i w n ) ) , n 0 ,
(3.17)

where { α n }(0,1) and { β i } i = 0 N [c,d](0,1) satisfy lim n α n =0, n = 1 α n = and i = 0 N β i =1. Then { x n } converges strongly to p= P F f (u).

If, in Theorem 3.2, we assume that each T i , i=1,2,,N, is a multi-valued quasi-Bregman relatively nonexpansive mapping, we get the following corollary.

Corollary 3.5 Let f:ER be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable, and totally convex on bounded subsets of E. Let C be a nonempty, closed, and convex subset of int(domf) and T i :CCB(C), for i=1,2,,N, be a finite family of quasi-Bregman nonexpansive mappings with F( T i )= F ˆ ( T i ), for each i{1,2,,N}. Suppose that F:= i = 1 N F( T i ) is nonempty. For u, x 0 C let { x n } be a sequence generated by

{ w n = P C f f ( α n f ( u ) + ( 1 α n ) f ( x n ) ) , x n + 1 = f ( β 0 f ( w n ) + i = 1 N β i f ( u i , n ) ) , u i , n T i w n , n 0 ,
(3.18)

where { α n }(0,1) and { β i } i = 0 N [c,d](0,1) satisfy lim n α n =0, n = 1 α n = and i = 0 N β i =1. Then { x n } converges strongly to p= D F f (u).

Remark 3.6 (i) Theorem 3.2 improves and extends the corresponding results of Homaeipour and Razani [33] and Zegeye and Shahzad [34] to the class of multi-valued Bregman relatively nonexpansive mappings in a reflexive real Banach spaces. (ii) The requirement that the interior of F is nonempty is dispensed with.