# Modified Proximal point algorithms for finding a zero point of maximal monotone operators, generalized mixed equilibrium problems and variational inequalities

## Abstract

In this article, we prove strong and weak convergence theorems of modified proximal point algorithms for finding a common element of the zero point of maximal monotone operators, the set of solutions of generalized mixed equilibrium problems, the set of solutions of variational inequality problems and the fixed point set of relatively nonexpansive mappings in a Banach space under difference conditions. Our results modify and improve previous result of Li and Song.

Mathematics Subject Classification 2000: 47H09; 47H10.

## 1. Introduction

Let E be a Banach space with norm || · ||, C be a nonempty closed convex subset of E and let E* denote the dual of E. Let B be a monotone operator of C into E*. The variational inequality problem is to find a point x C such that

(1.1)

The set of solutions of the variational inequality problem is denoted by V I(C, B). Such a problem is connected with the convex minimization problem, the complementarity problem, the problem of finding a point u E satisfying 0 = Bu and so on. An operator B of C into E* is said to be inverse-strongly monotone, if there exists a positive real number α such that

$⟨ x - y , B x - B y ⟩ ≥α B x - B y 2$
(1.2)

for all x, y C. In such a case, B is said to be α-inverse-strongly monotone. If an operator B of C into E* is α-inverse-strongly monotone, then B is Lipschitz continuous, that is $B x - B y ≤ 1 α x - y$ for all x, y C.

A point x C is a fixed point of a mapping S: CC if Sx = x, by F(S) denote the set of fixed points of S; that is, F(S) = {x C: Sx = x}. A point p in C is said to be an asymptotic fixed point of S (see ) if C contains a sequence {x n } which converges weakly to p such that limn→∞||x n - Sx n || = 0. The set of asymptotic fixed points of S will be denoted by $F ^ ( S )$. A mapping S from C into itself is said to be relatively nonexpansive  if $F ^ ( S ) =F ( S )$and ϕ(p, Sx) ≤ ϕ(p, x) for all x C and p F(S). The asymptotic behavior of a relatively nonexpansive mapping was studied in [5, 6]. A mapping S is said to be ϕ-nonexpansive, if ϕ(Sx, Sy) ≤ ϕ(x, y) for x, y C. A mapping S is said to be quasi ϕ-nonexpansive if $F ( S ) ≠ 0$ and ϕ(p, Sx) ≤ ϕ(p, x) for x C and p F(S).

Let E be a Banach space with norm || · ||, C be a nonempty closed convex subset of E and let E* be the dual of E. Let Θ: C × C be a bifunction, φ: C be a real-valued function, and B: CE* be a nonlinear mapping. The generalized mixed equilibrium problem, which is to find x C such that

$Θ ( x , y ) + ⟨ B x , y - x ⟩ +φ ( y ) -φ ( x ) ≥0,∀y∈C.$
(1.3)

The solutions set to (1.3) is denoted by Ω, i.e.,

$Ω = { x ∈ C : Θ ( x , y ) + ⟨ B x , y - x ⟩ + φ ( y ) - φ ( x ) ≥ 0 , ∀ y ∈ C } .$
(1.4)

If B = 0, the problem (1.3) reduce into the mixed equilibrium problem for Θ, denoted by MEP(Θ, φ), which is to find x C such that

$Θ ( x , y ) + φ ( y ) - φ ( x ) ≥ 0 , ∀ y ∈ C .$
(1.5)

If Θ ≡ 0, the problem (1.3) reduce into the mixed variational inequality of Browder type, denoted by V I(C, B, φ), is to find x C such that

$⟨ B x , y - x ⟩ +φ ( y ) -φ ( x ) ≥0,∀y∈C.$
(1.6)

If B = 0 and φ = 0 the problem (1.3) reduce into the equilibrium problem for Θ, denoted by EP(Θ), is to find x C such that

$Θ ( x , y ) ≥0,∀y∈C.$
(1.7)

The above formulation (1.7) was shown in  to cover monotone inclusion problems, saddle point problems, variational inequality problems, minimization problems, optimization problems, variational inequality problems, vector equilibrium problems, Nash equilibria in noncooperative games. 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 articles have appeared in the literature on the existence of solutions of EP(Θ); see, for example  and references therein. Some solution methods have been proposed to solve the EP(Θ) (see, for example, [8, 1015] and references therein). In 2005, Combettes and Hirstoaga  introduced an iterative scheme of finding the best approximation to the initial data when EP(Θ) is nonempty and they also proved a strong convergence theorem.

In 2004, in Hilbert space H, Iiduka et al.  proved that the sequence {x n } defined by: x1 = x C and

$x n + 1 = P C ( x n - λ n B x n ) ,$
(1.8)

where P C is the metric projection of H onto C and {λ n } is a sequence of positive real numbers, converges weakly to some element of V I(C, B).

In 2008, Iiduka and Takahashi  introduced the following iterative scheme for finding a solution of the variational inequality problem for an inverse-strongly monotone operator B that satisfies the following conditions in a 2-uniformly convex and uniformly smooth Banach space E:

(C1) B is inverse-strongly monotone,

(C2) $VI ( C , B ) ≠ 0$,

(C3) ||Ay|| ≤ || Ay - Au|| for all y C and u V I(C, B).

Let x1 = x C and

$x n + 1 = Π C J - 1 ( J x n - λ n B x n )$
(1.9)

for every n = 1, 2, 3, ..., where Π C is the generalized metric projection from E onto C, J is the duality mapping from E into E* and {λ n } is a sequence of positive real numbers. They proved that the sequence {x n } generated by (1.9) converges weakly to some element of V I(C, B).

Consider the problem of finding:

(1.10)

where A is an operator from E into E*. Such v E is called a zero point of A. When A is a maximal monotone operator, a well-know methods for solving (1.10) in a Hilbert space H is the proximal point algorithm: x1 = x H and,

$x n + 1 = J r n x n ,n=1,2,3,…,$
(1.11)

where {r n } (0, ∞) and $J r n = ( I + r n A ) - 1$, then Rockafellar  proved that the sequence {x n } converges weakly to an element of A-1(0). Such a problem contains numerous problems in economics, optimization, and physics and is connected with a variational inequality problem. It is well known that the variational inequalities are equivalent to the fixed point problems.

In 2000, Kamimura and Takahashi  proved the following strong convergence theorem in Hilbert spaces, by the following algorithm

$x n + 1 = α n x+ ( 1 - α n ) J r n x n ,n=1,2,3,…,$
(1.12)

where J r = (I + rA)-1 J, then the sequence {x n } converges strongly to $P A - 1 0 ( x )$, where $P A - 1 0$ is the projection from H onto A-1(0). These results were extended to more general Banach spaces see [20, 21].

In 2003, Kohsaka and Takahashi  introduced the following iterative sequence for a maximal monotone operator A in a smooth and uniformly convex Banach space: x1 = x E and

$x n + 1 = J - 1 ( α n J x + ( 1 - α n ) J ( J r n x n ) ) , n = 1 , 2 , 3 , … ,$
(1.13)

where J is the duality mapping from E into E* and J r = (I + rA)-1J.

In 2004, Kamimura et al.  considered the algorithm (1.14) in a uniformly smooth and uniformly convex Banach space E, namely

$x n + 1 = J - 1 ( α n J x n + ( 1 - α n ) J ( J r n x n ) ) ,n=1,2,3,….$
(1.14)

They proved that the algorithm (1.14) converges weakly to some element of A-10.

In 2008, Li and Song  proved a strong convergence theorem in a Banach space, by the following algorithm: x1 = x E and

$y n = J - 1 ( β n J ( x n ) + ( 1 - β n ) J ( J r n x n ) ) , x n + 1 = J - 1 ( α n J x + ( 1 - α n ) J ( y n ) ) ,$
(1.15)

with the coefficient sequences {α n }, {β n } [0, 1] and {r n } (0, ∞) satisfying limn→ ∞α n = 0, $∑ n = 1 ∞ α n = ∞$, limn→∞β n = 0, and limn→∞r n = ∞, where J is the duality mapping from E into E* and J r = (I + rA)-1 J. Then they proved that the sequence {x n } converges strongly to Π C x, where Π C is the generalized projection from E onto C.

In this article, motivated and inspired by Kamimura et al. , Li and Song , Iiduka and Takahashi , Zhang  and Inoue et al. , we introduce the new hybrid algorithm (3.1) below. Under appropriate difference conditions, we will prove that the sequence {x n } generated by algorithms (3.1) converges strongly to the point $∏ Ω ∩ V I ( C , A ) ∩ A - 1 ( 0 ) ∩ F ( S ) x 0$ and converges weakly to the point $lim n → ∞ ∏ Ω ∩ V I ( C , A ) ∩ A - 1 ( 0 ) ∩ F ( S ) x n$. The results presented in this article extend and improve the corresponding ones announced by Kamimura et al. , Li and Song  and some authors in the literature.

## 2. Preliminaries

A Banach space E is said to be strictly convex if $x + y 2 <1$ for all x, y E with ||x|| = ||y|| = 1 and xy. Let U = {x E: ||x|| = 1} be the unit sphere of E. Then the Banach space E is said to be smooth provided

$lim t → 0 x + t y - x t$

exists for each x, y U. It is also said to be uniformly smooth if the limit is attained uniformly for x, y E. The modulus of convexity of E is the function δ: [0, 2] → [0, 1] defined by

$δ ( ε ) = inf 1 - x + y 2 : x , y ∈ E , x = y = 1 , x - y ≥ ε .$
(2.1)

A Banach space E is uniformly convex if and only if δ(ε) > 0 for all ε (0, 2]. Let p be a fixed real number with p ≥ 2. A Banach space E is said to be p-uniformly convex if there exists a constant c > 0 such that δ(ε) ≥ p for all ε [0, 2] (see [26, 27] for more details). Observe that every p-uniform convex is uniformly convex. One should note that no a Banach space is p-uniform convex for 1 < p < 2. It is well known that a Hilbert space is 2-uniformly convex and uniformly smooth. For each p > 1, the generalized duality mapping $J p :E→ 2 E *$ is defined by

$J p ( x ) = { x * ∈ E * : ⟨ x , x * ⟩ = | | x | | p , | | x * | | = | | x | | p - 1 }$
(2.2)

for all x E. In particular, J = J2 is called the normalized duality mapping. If E is a Hilbert space, then J = I, where I is the identity mapping. It is also known that if E is uniformly smooth, then J is uniformly norm-to-norm continuous on each bounded subset of E.

We know the following (see ):

1. (1)

if E is smooth, then J is single-valued;

2. (2)

if E is strictly convex, then J is one-to-one and 〈x - y, x* - y*〉 > 0 holds for all (x, x*), (y, y*) J with xy;

3. (3)

if E is reflexive, then J is surjective;

4. (4)

if E is uniformly convex, then it is reflexive;

5. (5)

if E* is uniformly convex, then J is uniformly norm-to-norm continuous on each bounded subset of E.

The duality J from a smooth Banach space E into E* is said to be weakly sequentially continuous  if x n x implies Jx n * Jx, where * implies the weak* convergence.

Lemma 2.1. [30, 31] If E be a 2-uniformly convex Banach space. Then, for all x, y E we have

$x - y ≤ 2 c 2 J x - J y ,$

where J is the normalized duality mapping of E and 0 < c ≤ 1.

The best constant $1 c$ in Lemma is called the 2-uniformly convex constant of E (see ).

Lemma 2.2. [30, 32] If E be a p-uniformly convex Banach space and let p be a given real number with p ≥ 2. Then for all x, y E, J x J p (x) and J y J p (y)

$⟨ x - y , J x - J y ⟩ ≥ c p 2 p - 2 p x - y p ,$

where J p is the generalized duality mapping of E and $1 c$ is the p-uniformly convexity constant of E.

Lemma 2.3. (Xu ) Let E be a uniformly convex Banach space. Then for each r > 0, there exists a strictly increasing, continuous and convex function g: [0, ∞) → [0, ∞) such that g(0) = 0 and

$λ x + ( 1 - λ y ) 2 ≤λ x 2 + ( 1 - λ ) y 2 -λ ( 1 - λ ) g ( x - y )$
(2.3)

for all x, y {z E: ||z|| ≤ r} and λ [0, 1].

Let E be a smooth, strictly convex and reflexive Banach space and let C be a nonempty closed convex subset of E. Throughout this article, we denote by ϕ the function defined by

$ϕ ( x , y ) = x 2 -2 ⟨ x , J y ⟩ + y 2 , for x,y∈E.$
(2.4)

Following Alber , the generalized projection Π C : EC is a map that assigns to an arbitrary point x E the minimum point of the functional ϕ(x, y), that is, $∏ C x= x ̄$, where $x ̄$ is the solution to the minimization problem

$ϕ ( x ̄ , x ) = inf y ∈ C ϕ ( y , x )$
(2.5)

existence and uniqueness of the operator Π C follows from the properties of the functional ϕ(x, y) and strict monotonicity of the mapping J. It is obvious from the definition of function ϕ that (see )

$y - x 2 ≤ϕ ( y , x ) ≤ y + x 2 ,∀x,y∈E.$
(2.6)

If E is a Hilbert space, then ϕ(x, y) = ||x - y||2.

If E is a reflexive, strictly convex and smooth Banach space, then for x, y E, ϕ(x, y) = 0 if and only if x = y. It is sufficient to show that if ϕ(x, y) = 0 then x = y. From (2.6), we have ||x|| = ||y||. This implies that 〈x, Jy〉 = ||x||2 = ||Jy||2. From the definition of J, one has Jx = Jy. Therefore, we have x = y (see [28, 34] for more details).

Lemma 2.4. (Kamimura and Takahashi ) Let E be a uniformly convex and smooth real Banach space and let {x n }, {y n } be two sequences of E. If ϕ(x n , y n ) → 0 and either {x n } or {y n } is bounded, then ||x n - y n || → 0.

Lemma 2.5. (Alber ) Let C be a nonempty closed convex subset of a smooth Banach space E and x E. Then, x0 = Π C x if and only if

$⟨ x 0 - y , J x - J x 0 ⟩ ≥0,∀y∈C.$

Lemma 2.6. (Alber ) Let E be a reflexive, strictly convex and smooth Banach space, let C be a nonempty closed convex subset of E and let x E. Then

$ϕ ( y , Π C x ) +ϕ ( Π C x , x ) ≤ϕ ( y , x ) ,∀y∈C.$

Let E be a strictly convex, smooth and reflexive Banach space, let J be the duality mapping from E into E*. Then J-1 is also single-valued, one-to-one, and surjective, and it is the duality mapping from E* into E. Define a function V: E × E* → as follows (see ):

$V ( x , x * ) = x 2 - 2 ⟨ x , x * ⟩ + x * 2$
(2.7)

for all x Ex E and x* E*. Then, it is obvious that V (x, x*) = ϕ(x, J-1(x*)) and V (x, J(y)) = ϕ(x, y).

Lemma 2.7. (Kohsaka and Takahashi [, Lemma 3.2]) Let E be a strictly convex, smooth and reflexive Banach space, and let V be as in (2.7). Then

$V ( x , x * ) +2 ⟨ J - 1 ( x * ) - x , y * ⟩ ≤V ( x , x * + y * )$
(2.8)

for all x E and x*, y* E*.

Let E be a reflexive, strictly convex and smooth Banach space. Let C be a closed convex subset of E. Because ϕ(x, y) is strictly convex and coercive in the first variable, we know that the minimization problem infyCϕ(x, y) has a unique solution. The operator Π C x: = arg minyCϕ(x, y) is said to be the generalized projection of x on C.

A set-valued mapping A: EE* with domain $D ( A ) = x ∈ E : A ( x ) ≠ 0$ and range R(A) = {x* E*: x* A(x), x D(A)} is said to be monotone if 〈x - y, x* - y*〉 ≥ 0 for all x* A(x), y* A(y). We denote the set {s E: 0 Ax} by A-10. A is maximal monotone if its graph G(A) is not properly contained in the graph of any other monotone operator. If A is maximal monotone, then the solution set A-10 is closed and convex.

Let E be a reflexive, strictly convex and smooth Banach space, it is knows that A is a maximal monotone if and only if R(J + rA) = E* for all r > 0.

Define the resolvent of A by J r x = x r . In other words, J r = (J + rA)-1J for all r > 0. J r is a single-valued mapping from E to D(A). Also, A-1(0) = F(J r ) for all r > 0, where F(J r ) is the set of all fixed points of J r . Define, for r > 0, the Yosida approximation of A by A r = (J - JJ r )/r. We know that A r x A(J r x) for all r > 0 and x E.

Lemma 2.8. (Kohsaka and Takahashi [, Lemma 3.1]) Let E be a smooth, strictly convex and reflexive Banach space, let A E × E* be a maximal monotone operator with $A - 1 0≠ 0$, let r > 0 and let J r = (J + rT)-1J. Then

$ϕ ( x , J r y ) +ϕ ( J r y , y ) ≤ϕ ( x , y )$

for all x A-10 and y E.

Let B be an inverse-strongly monotone mapping of C into E* which is said to be hemicontinuous if for all x, y C, the mapping F of [0, 1] into E*, defined by F(t) = B(tx + (1 - t)y), is continuous with respect to the weak* topology of E*. We define by N C (v) the normal cone for C at a point v C, that is,

$N C ( v ) = { x * ∈ E * : ⟨ v - y , x * ⟩ ≥ 0 , ∀ y ∈ C } .$
(2.9)

Theorem 2.9. (Rockafellar ) Let C be a nonempty, closed convex subset of a Banach space E and B a monotone, hemicontinuous operator of C into E*. Let T E × E* be an operator defined as follows:

$Tv= B v + N C ( v ) , v ∈ C ; 0 , otherwise .$
(2.10)

Then T is maximal monotone and T-10 = V I(C, B).

Lemma 2.10. (Tan and Xu ) Let {a n } and {b n } be two sequence of nonnegative real numbers satisfying the inequality

$a n + 1 = a n + b n f o r a l l n ≥ 0 .$

If $∑ n = 1 ∞ b n <∞$, then limn→∞a n exists.

Lemma 2.11. (Xu ) Let {s n } be a sequence of nonnegative real numbers satisfying

$s n + 1 = ( 1 - α n ) s n + α n t n + r n n≥1,$

where {α n }, {t n }, and {r n } satisfy {α n } [0, 1], $∑ n = 1 ∞ α n = ∞$, lim supn→∞t n ≤ 0 and r n ≥ 0, $∑ n = 1 ∞ r n <∞$. Then limn→∞s n = 0.

For solving the mixed equilibrium problem, let us assume that the bifunction Θ: C × C and φ: C is convex and lower semi-continuous satisfies the following conditions:

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

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

(A3) for each x, y, z C,

$lim sup t ↓ 0 Θ ( t z + ( 1 - t ) x , y ) ≤Θ ( x , y ) ;$

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

Lemma 2.12. (Blum and Oettli ) Let C be a closed convex subset of a uniformly smooth, strictly convex and reflexive Banach space E and let Θ be a bifunction of C × C into satisfying (A 1)-(A 4). Let r > 0 and x E. Then, there exists z C such that

$Θ ( z , y ) + 1 r ⟨ y - z , z - x ⟩ ≥0forally∈C.$

Lemma 2.13. (Takahashi and Zembayashi ) Let C be a closed convex subset of a uniformly smooth, strictly convex and reflexive Banach space E and let Θ be a bifunction from C × C to satisfying (A 1)-(A 4). For all r > 0 and x E, define a mapping T r : EC as follows:

$T r x = z ∈ C : Θ ( z , y ) + 1 r ⟨ y - z , J z - J x ⟩ ≥ 0 , ∀ y ∈ C$
(2.11)

for all x E. Then, the followings hold:

1. (1)

T r is single-valued;

2. (2)

T r is a firmly nonexpansive-type mapping, i.e., for all x, y E,

$⟨ T r x - T r y , J T r x - J T r y ⟩ ≤ ⟨ T r x - T r y , J x - J y ⟩ ;$
3. (3)

F(T r ) = EP(Θ);

4. (4)

EP(Θ) is closed and convex.

Lemma 2.14. (Takahashi and Zembayashi ) Let C be a closed convex subset of a smooth, strictly convex, and reflexive Banach space E, let Θ be a bifunction from C ×C to satisfying (A 1)-(A 4) and let r > 0. Then, for x E and q F(T r ),

$ϕ ( q , T r x ) +ϕ ( T r x , x ) ≤ϕ ( q , x ) .$

Lemma 2.15. (Zhang ) Let C be a closed convex subset of a smooth, strictly convex and reflexive Banach space E. Let B: CE* be a continuous and monotone mapping, φ: C is convex and lower semi-continuous and Θ be a bifunction from C × C to satisfying (A1)-(A4). For r > 0 and x E, then there exists u C such that

$Θ ( u , y ) + ⟨ B u , y - u ⟩ +φ ( y ) -φ ( u ) + 1 r ⟨ y - u , J u - J x ⟩ ≥0,∀y∈C.$

Define a mapping K r : CC as follows:

$K r ( x ) = u ∈ C : Θ ( u , y ) + ⟨ B u , y - u ⟩ + φ ( y ) - φ ( u ) + 1 r ⟨ y - u , J u - J x ⟩ ≥ 0 , ∀ y ∈ C$
(2.12)

for all x E. Then, the followings hold:

1. (i)

K r is single-valued;

2. (ii)

K r is firmly nonexpansive, i.e., for all x, y E, 〈K r x - K r y, JK r x - JK r y〉 ≤ 〈K r x -K r y, Jx -Jy〉;

3. (iii)

F(K r ) = Ω;

4. (iv)

Ω is closed and convex;

5. (v)

ϕ(p, K r z) + ϕ(K r z, z) ≤ ϕ(p, z) p F(K r ), z E.

Remark 2.16. (Zhang ) It follows from Lemma 2.13 that the mapping K r : CC defined by (2.12) is a relatively nonexpansive mapping. Thus, it is quasi-ϕ-nonexpansive.

Lemma 2.17. (Xu  and Zalinescu ) Let E be a uniformly convex Banach space and let r > 0. Then there exists a strictly increasing, continuous and convex function g: [0, ∞) → [0, ∞) such that g(0) = 0 and

$t x + ( 1 - t ) y 2 ≤t x 2 + ( 1 - t ) y 2 -t ( 1 - t ) g ( x - y )$
(2.13)

for all x, y B r (0) and t [0, 1], where B r (0) = {z E: ||z|| ≤ r}.

## 3. Strong convergence theorem

In this section, we prove a strong convergence theorem for finding a common element of the set of solutions of mixed equilibrium problems, the set of solution of the variational inequality problem, the fixed point set of relatively nonexpansive mappings and the zero point of a maximal monotone operators in a Banach space by using the shrinking hybrid projection method.

Theorem 3.1. Let E be a 2-uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E. Let Θ be a bifunction from C × C to satisfying (A1)-(A4) let φ: C be a proper lower semicontinuous and convex function, let T: EE* be a maximal monotone operator satisfying D(T) C. Let J r = (J + rT)-1J for r > 0, let B: CE* be a continuous and monotone mappings and S be a relatively nonexpansive mappings from C into itself, with $F : = Ω ∩ V I ( C , A ) ∩ T - 1 ( 0 ) ∩ F ( S ) ≠ 0$. Assume that A an operator of C into E* that satisfies the conditions (C1)-(C3). Let {x n } be a sequence generated by x1 = x C and,

$u n = K r n x n , z n = Π C J - 1 ( J - λ n A ) u n , y n = J - 1 ( β n J x n + ( 1 - β n ) J S J r n z n ) , x n + 1 = Π C J - 1 ( α n J x + ( 1 - α n ) J y n ) ,$
(3.1)

for all n , where Π C is the generalized projection from E onto C, J is the duality mapping on E. The coefficient sequences {λ n } [a, b] for some a, b with $0 is the 2-uniformly convexity constant of E and {α n } [0, 1], {β n } (0, 1] {r n } (0, ∞) satisfying

1. (i)

limn→∞α n = 0, $∑ n = 1 ∞ α n = ∞$,

2. (ii)

lim supn→∞β n < 1,

3. (iii)

lim infn→∞r n > 0.

Then the sequence {x n } converges strongly to Π F x0.

Proof . Let H(u n , y) = Θ(u n , y) + 〈Bu n , y -u n 〉 + φ(y) - φ(u n ), y C and $K r n = { u n ∈ C : H ( u n , y ) + 1 r n ⟨ y - u n , J u n - J x n ⟩ ≥ 0 , ∀ y ∈ C }$. We first show that {x n } is bounded. Put v n = J-1(J - λ n A)u n and $w n = J r n z n$ for all n ≥ 0. Let p F: = Ω ∩ V I(C, A) ∩ T-1(0) ∩ F(S) and $u n = K r n x n$. Since S, $J r n$ and $K r n$ are relatively nonexpansive mappings, we get

$ϕ ( p , u n ) =ϕ ( p , K r n x n ) ≤ϕ ( p , x n )$
(3.2)

and Lemma 2.7, the convexity of the function V in the second variable, we obtain

$ϕ ( p , z n ) = ϕ ( p , Π C v n ) ≤ ϕ ( p , v n ) = ϕ ( p , J - 1 ( J u n - λ n A u n ) ) ≤ V ( p , J u n - λ n A u n + λ n A u n ) - 2 ⟨ J - 1 ( J u n - λ n A u n ) - p , λ n A u n ⟩ = V ( p , J u n ) - 2 λ n ⟨ v n - p , A u n ⟩ = ϕ ( p , u n ) - 2 λ n ⟨ u n - p , A u n ⟩ + 2 ⟨ v n - u n , - λ n A u n ⟩ .$
(3.3)

Since p V I(C, A) and A is α-inverse-strongly monotone, we have

$- 2 λ n ⟨ u n - p , A u n ⟩ = - 2 λ n ⟨ u n - p , A u n - A p ⟩ - 2 λ n ⟨ u n - p , A p ⟩ ≤ - 2 α λ n A u n - A p 2 ,$
(3.4)

and by Lemma 2.1, we obtain

$2 ⟨ v n - u n , - λ n A u n ⟩ = 2 ⟨ J - 1 ( J u n - λ n A u n ) - u n , - λ n A u n ⟩ ≤ 2 J - 1 ( J u n - λ n A u n ) - u n λ n A u n ≤ 4 c 2 J u n - λ n A u n - J u n λ n A u n = 4 c 2 λ n 2 A u n 2 ≤ 4 c 2 λ n 2 A u n - A p 2 .$
(3.5)

Substituting (3.4) and (3.5) into (3.3), we get

$ϕ ( p , z n ) ≤ ϕ ( p , u n ) - 2 α λ n A u n - A p 2 + 4 c 2 λ n 2 A u n - A p 2 ≤ ϕ ( p , u n ) + 2 λ n 2 c 2 λ n - α A u n - A p 2 ≤ ϕ ( p , u n ) ≤ ϕ ( p , x n ) .$
(3.6)

By Lemmas 2.7, 2.8 and (3.6), we have

$ϕ ( p , y n ) = ϕ ( p , J - 1 ( β n J x n + ( 1 - β n ) J S w n ) ) = V ( p , β n J x n + ( 1 - β n ) J S w n ) ≤ V ( p , β n J x n ) + ( 1 - β n ) V ( p , J S w n ) = β n ϕ ( p , x n ) + ( 1 - β n ) ϕ ( p , S w n ) ≤ β n ϕ ( p , x n ) + ( 1 - β n ) ϕ ( p , w n ) ≤ β n ϕ ( p , x n ) + ( 1 - β n ) ( ϕ ( p , z n ) - ϕ ( w n , z n ) ) ≤ β n ϕ ( p , x n ) + ( 1 - β n ) ϕ ( p , z n ) ≤ β n ϕ ( p , x n ) + ( 1 - β n ) ϕ ( p , x n ) = ϕ ( p , x n ) ,$
(3.7)

it follows that

$ϕ ( p , x n + 1 ) = ϕ ( p , Π C J - 1 ( α n J x 1 + ( 1 - α n ) J y n ) ) ≤ ϕ ( p , J - 1 ( α n J x 1 + ( 1 - α n ) J y n ) ) = V ( p , α n J x 1 + ( 1 - α n ) J y n ) ≤ α n V ( p , J x 1 ) + ( 1 - α n ) V ( p , J y n ) = α n ϕ ( p , x 1 ) + ( 1 - α n ) ϕ ( p , y n ) ≤ α n ϕ ( p , x 1 ) + ( 1 - α n ) ϕ ( p , x n )$
(3.8)

for all n . Hence, by induction, we have that ϕ(p, x n ) ≤ ϕ(p, x1) for all n . Since (||x n || - ||p||)2ϕ(p, x n ). It implies that {x n } is bounded and {y n }, {z n }, {w n } are also bounded.

From (3.6)-(3.8), we have

$ϕ ( p , x n + 1 ) ≤ α n ϕ ( p , x 1 ) + ( 1 - α n ) [ β n ϕ ( p , x n ) + ( 1 - β n ) ( ϕ ( p , x n ) - ϕ ( w n , z n ) ) ] ≤ α n ϕ ( p , x 1 ) + ( 1 - α n ) ϕ ( p , x n ) - ( 1 - α n ) ( 1 - β n ) ϕ ( w n , z n )$

and then

$( 1 - α n ) ( 1 - β n ) ϕ ( w n , z n ) ≤ α n ϕ ( p , x 1 ) + ( 1 - α n ) ϕ ( p , x n ) -ϕ ( p , x n + 1 )$

for all n . Since limn-∞α n = 0, lim supn→∞β n < 1, it follows that limn→∞ϕ(w n , z n ) = 0. Applying Lemma 2.4, we have

$lim n → ∞ w n - z n = lim n → ∞ J r n z n - z n = 0 .$
(3.9)

Since J is uniformly norm-to-norm continuous on bounded sets, we obtain

$lim n → ∞ J w n - J z n = lim n → ∞ J J r n z n - J z n = 0 .$
(3.10)

By (3.2), (3.6)-(3.8) again, we note that

$ϕ ( p , x n + 1 ) ≤ α n ϕ ( p , x 1 ) + ( 1 - α n ) β n ϕ ( p , x n ) + ( 1 - β n ) ϕ ( p , x n ) - 2 λ n α - 2 c 2 λ n A u n - A p 2 ≤ α n ϕ ( p , x 1 ) + ( 1 - α n ) ϕ ( p , x n ) - ( 1 - α n ) ( 1 - β n ) 2 λ n α - 2 c 2 λ n A u n - A p 2$

and hence

$2 λ n α - 2 c 2 λ n A u n - A p 2 ≤ 1 ( 1 - α n ) ( 1 - β n ) ( α n ϕ ( p , x 1 ) + ( 1 - α n ) ϕ ( p , x n ) - ϕ ( p , x n + 1 ) )$

for all n . Since $0, limn→∞α n = 0, lim supn→∞β n < 1, we have

$lim n → ∞ A u n - A p = 0 .$
(3.11)

From Lemmas 2.6, 2.7 and (3.5), we get

$ϕ ( u n , z n ) = ϕ ( u n , Π C v n ) ≤ ϕ ( u n , v n ) = ϕ ( u n , J - 1 ( J u n - λ n A u n ) ) = V ( u n , J u n - λ n A u n ) ≤ V ( u n , ( J u n - λ n A u n ) + λ n A u n ) - 2 ⟨ J - 1 ( J u n - λ n A u n ) - u n , λ n A u n ⟩ = ϕ ( u n , u n ) + 2 ⟨ v n - u n , - λ n A u n ⟩ = 2 ⟨ v n - u n , - λ n A u n ⟩ ≤ 4 c 2 λ n 2 A u n - A p 2 .$

From Lemma 2.4 and (3.11), we have

$lim n → ∞ u n - z n = 0 .$
(3.12)

Since J is uniformly norm-to-norm continuous on bounded sets, we obtain

$lim n → ∞ J u n - J z n = 0 .$
(3.13)

From Lemmas 2.6, 2.7 and (3.5), we obtain

$ϕ ( x n , z n ) = ϕ ( x n , Π C J - 1 ( J u n - λ n A u n ) ) ≤ ϕ ( x n , J - 1 ( J u n - λ n A u n ) ) = V ( x n , J u n - λ n A u n ) ≤ V ( x n , ( J u n - λ n A u n ) + λ n A u n ) - 2 ⟨ J - 1 ( J u n - λ n A u n ) - u n , λ n A u n ⟩ = ϕ ( x n , u n ) + 2 ⟨ J - 1 ( J u n - λ n A u n ) - u n , - λ n A u n ⟩ = ϕ ( x n , x n ) + 2 ⟨ J - 1 ( J u n - λ n A u n ) - u n , - λ n A u n ⟩ = 4 c 2 A u n - A p 2$

for all n . Since limn→∞||Au n - Ap ||2 = 0, we have limn→∞ϕ(x n , z n ) = 0.

Applying Lemma 2.4, we get

$lim n → ∞ x n - z n = 0 .$
(3.14)

Since J is uniformly norm-to-norm continuous on bounded set, we obtain

$lim n → ∞ J x n - J z n =0.$
(3.15)

So, by the triangle inequality, we get

$x n - u n ≤ x n - z n + z n - u n .$

By (3.12) and (3.14), we also have

$lim n → ∞ x n - u n = 0 .$
(3.16)

From (3.1), we obtain

$ϕ ( y n , z n ) = ϕ ( x n , J - 1 ( β n J x n + ( 1 - β n ) J S w n ) ) = V ( x n , β n J x n + ( 1 - β n ) J S w n ) ≤ β n V ( x n , J x n ) + ( 1 - β n ) V ( x n , J S w n ) = β n ϕ ( x n , x n ) + ( 1 - β n ) ϕ ( x n , S w n ) ≤ β n ϕ ( x n , x n ) + ( 1 - β n ) ϕ ( x n , w n ) = ( 1 - β n ) ϕ ( x n , z n )$

for all n . Since lim n→∞ ϕ(x n , z n ) = 0, we have limn→∞ϕ(y n , z n ) = 0. Applying Lemma 2.4, we get

$lim n → ∞ y n - z n = 0 .$
(3.17)

Since J is uniformly norm-to-norm continuous on bounded set, we obtain

$lim n → ∞ J y n - J z n = 0 .$
(3.18)

From

$x n - y n ≤ x n - z n + z n - y n ,$

we have

$lim n → ∞ x n - y n = 0 .$
(3.19)

Since J is uniformly norm-to-norm continuous on bounded set, we obtain

$lim n → ∞ J x n - J y n = 0 .$
(3.20)

From Lemma 2.17 and (3.7), we have

$ϕ ( p , y n ) = ϕ ( p , J - 1 ( β n J x n + ( 1 - β n ) J S w n ) ) = p 2 - 2 ⟨ p β n J x n + ( 1 - β n ) J S w n ⟩ + β J x n + ( 1 - β n ) J S w n 2 ≤ p 2 - 2 β n ⟨ p , J x n ⟩ - 2 ( 1 - β n ) ⟨ p , J S w n ⟩ + β n x n 2 + ( 1 - β n ) S w n 2 - β n ( 1 - β n ) g J x n - J S w n = β n ϕ ( p , x n ) + ( 1 - β n ) ϕ ( p , S w n ) - β n ( 1 - β n ) g J x n - J S w n ≤ β n ϕ ( p , x n ) + ( 1 - β n ) ϕ ( p , x n ) - β n ( 1 - β n ) g J x n - J S w n = ϕ ( p , x n ) - β n ( 1 - β n ) g J x n - J S w n .$
(3.21)

This implies that

$β n ( 1 - β n ) g ( J x n - J S w n ) ≤ϕ ( p , x n ) -ϕ ( p , y n ) .$
(3.22)

On the other hand, we have

$ϕ ( p , x n ) - ϕ ( p , y n ) = x n 2 - y n 2 - 2 ⟨ p , J x n - J y n ⟩ = x n - y n x n + y n + 2 p J x n - J y n .$
(3.23)

Noticing (3.19) and (3.20), we obtain

(3.24)

Since lim supn→∞β n < 1 and (3.24), it follows from (3.22) that

$g J x n - J S w n →0, as n→∞.$
(3.25)

If follows from the property of g that

$lim n → ∞ J x n - J S w n = 0 .$
(3.26)

Since J is uniformly norm-to-norm continuous on bounded set, we see that

$lim n → ∞ x n - S w n = 0 .$
(3.27)

Since

$z n - S w n ≤ z n - x n + x n - S w n ,$

from (3.14) and (3.27), we obtain that

$lim n → ∞ z n - S w n = 0 .$
(3.28)

By (3.9) and (3.14), we obtain

$lim n → ∞ w n - x n = 0 .$
(3.29)

Also, by (3.9) and (3.28), we obtain

$lim n → ∞ w n - S w n = 0 .$
(3.30)

Since {x n } is bounded, there exists a subsequence ${ x n i }$ of {x n } such that $x n i ⇀u∈C$. It follows from (3.29), we have $w n i ⇀u$ as i → ∞ and S be a relatively nonexpansive, we have that $u∈ F ^ ( S ) =F ( S )$.

Next, we show that u T-10. Indeed, since lim infn→∞r n > 0, it follows from (3.10) that

$lim n → ∞ | | A r n z n | | = lim n → ∞ 1 r n | | J z n - J w n | | = 0 .$
(3.31)

If (z, z*) T, then it holds from the monotonicity of A that

$⟨ z - z n i , z * - A r n i z n i ⟩ ≥0$

for all i . Letting i → ∞, we get 〈 z - u, z*〉 ≥ 0. Then, the maximality of T implies u T-10.

Next, we show that u V I(C, A). Let B E × E* be an operator as follows:

$Bv= A v + N C ( v ) , v ∈ C ; 0 , otherwise$

By Theorem 2.9, B is maximal monotone and B-10 = V I(C, A). Let (v, w) G(B).

Since w Bv = Av + N C (v), we get w - Av N C (v). From z n C, we have

$⟨ v - z n , w - A v ⟩ ≥0.$
(3.32)

On the other hand, since z n = Π C J-1 (Ju n - λ n Au n ). Then by Lemma 2.5, we have

$⟨ v - z n , J z n - ( J u n - λ n A u n ) ⟩ ≥0,$

thus

$v - z n , J u n - J z n λ n - A u x n ≤ 0 .$
(3.33)

It follows from (3.32) and (3.33) that

$⟨ v - z n , w ⟩ ≥ ⟨ v - z n , A v ⟩ ≥ ⟨ v - z n , A v ⟩ + v - z n , J u n - J z n λ n - A u n = ⟨ v - z n , A v - A u n ⟩ + v - z n , J u n - J z n λ n = ⟨ v - z n , A v - A z n ⟩ + ⟨ v - z n , A z n - A u n ⟩ + v - z n , J u n - J z n λ n ≥ - v - z n z n - u n α - v - z n J u n - J z n a ≥ - M z n - u n α + J u n - J z n a ,$

where M = supn≥1{||v - z n ||}. From (3.12) and (3.13), we obtain 〈v - u, w〉 ≥ 0. By the maximality of B, we have u B-10 and hence u V I(C, A).

Next, we show that u Ω. From (3.16) and J is uniformly norm-to-norm continuous on bounded set, we obtain

$lim n → ∞ J u n - J x n = 0 .$
(3.34)

From the assumption lim infn→∞r n > a, we get

$lim n → ∞ J u n - J x n r n = 0 .$

Noticing that $u n = K r n x n$, we have

$H ( u n , y ) + 1 r n ⟨ y - u n , J u n - J x n ⟩ ≥ 0 , ∀ y ∈ C .$

Hence,

$H ( u n i , y ) + 1 r n i ⟨ y - u n i , J u n i - J x n i ⟩ ≥ 0 , ∀ y ∈ C .$

From the (A2), we note that

$y - u n i J u n i - J x n i r n i ≥ 1 r n i ⟨ y - u n i , J u n i - J x n i ⟩ ≥ - H ( u n i , y ) ≥ H ( y , u n i ) , ∀ y ∈ C .$

Taking the limit as n → ∞ in above inequality and from (A4) and $u n i ⇀u$, we have H(y, u) ≤ 0, y C. For 0 < t < 1 and y C, define y t = ty + (1 - t)u. Noticing that y, u C, we obtains y t C, which yields that H(y t , u) ≤ 0. It follows from (A1) that

$0 = H ( y t , y t ) ≤ t H ( y t , y ) + ( 1 - t ) H ( y t , x ^ ) ≤ t H ( y t , y ) .$

That is, H(y t , y) ≥ 0.

Let t ↓ 0, from (A3), we obtain H(u, y) ≥ 0, y C. This implies that u Ω. Hence u F: = Ω ∩ V I(C, B) ∩ T-1(0).

Finally, we show that u = Π F x. Indeed from $x n = Π C n x$ and Lemma 2.5, we have

$J x - J x n , x n - z ≥ 0 , ∀ z ∈ C n .$

Since F C n , we also have

$J x - J x n , x n - p ≥ 0 , ∀ p ∈ F .$
(3.35)

Taking limit n → ∞, we obtain

$J x - J u , u - p ≥ 0 , ∀ p ∈ F .$

By again Lemma 2.5, we can conclude that u = Π F x0. This completes the proof. □

Corollary 3.2. Let E be a 2-uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E. Let T: EE* be a maximal monotone operator satisfying D(T) C. Let J r = (J + rT)-1 J for r > 0, let A be an α-inverse-strongly monotone operator of C into E* and S be a relatively nonexpansive mappings from C into itself, with $F : = V I ( C , A ) ∩ T - 1 ( 0 ) ∩ F ( S ) ≠ 0$. Assume that A an operator of C into E* that satisfies the conditions (C1)-(C3). Let {x n } be a sequence generated by x1 = x C and,

$z n = Π C J - 1 ( J x n - λ n A x n ) , y n = J - 1 ( β n J x n + ( 1 - β n ) J S J r n z n ) , x n + 1 = Π C J - 1 ( α n J x 1 + ( 1 - α n ) J y n ) ,$
(3.36)

for all n , where Π C is the generalized projection from E onto C, J is the duality mapping on E. The coefficient sequence {a n } [0, 1], {β n } (0, 1], {r n } (0, ∞) satisfying limn→∞α n = 0, $∑ n = 1 ∞ α n = ∞$, lim supn→∞β n < 1, lim infn→∞r n > 0 and {λ n } [a, b] for some a, b with $0, $1 c$ is the 2-uniformly convexity constant of E. Then the sequence {x n } converges strongly to Π F x0.

## 4. Weak convergence theorem

We next prove a weak convergence theorem under difference condition on data. First we prove the generalized projection sequence {Π F x0} of {x n } is strongly convergent.

Theorem 4.1. Let E be a 2-uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E. Let Θ be a bifunction from C × C to satisfying (A1)-(A4) let φ: C be a proper lower semicontinuous and convex function, let T: EE* be a maximal monotone operator satisfying D(T) C. Let J r = (J + rT)-1 J for r > 0 and let A be an α-inverse-strongly monotone operator of C into E*, let B: CE* be a continuous and monotone mappings and S be a relatively nonexpansive mapping. from C into itself, with $F : = Ω ∩ V I ( C , A ) ∩ T - 1 ( 0 ) ∩ F ( S ) ≠ 0$. Assume that A an operator of C into E* that satisfies the conditions (C1)-(C3). Let {x n } be a sequence generated by x1 = x C and,

$u n = K r n x n , z n = Π C J - 1 ( J u n - λ n A u n ) , y n = J - 1 ( β n J x n + ( 1 - β n ) J S J r n z n ) , x n + 1 = Π C J - 1 ( α n J x 1 + ( 1 - α n ) J y n ) ,$
(4.1)

for all n , where Π C is the generalized projection from E onto C, J is the duality mapping on E. The coefficient sequence {α n } [0, 1], {β n } (0, 1], {r n } (0, ∞) satisfying $∑ n = 1 ∞ α n < ∞$, lim supn→∞β n < 1, lim infn→∞r n > 0 and {λ n } [a, b] for some a, b with $0 , $1 c$ is the 2-uniformly convexity constant of E. Then the sequence F x n } converges strongly to an element v of F , which is a unique element of F satisfying

$lim n → ∞ ϕ ( v , x n ) = min y ∈ F lim n → ∞ ϕ ( y , x n ) .$

Proof . Let H(u n , y) = Θ(u n , y) + 〈Bu n , y - u n 〉 + φ(y) - φ(u n ), y C and $K r n = { u n ∈ C : H ( u n , y ) + 1 r n ⟨ y - u n , J u n - J x n ⟩ ≥ 0 . ∀ y ∈ C }$. We first show that {x n } is bounded. Let p F: = Ω ∩ V I(C, A) ∩ T-1(0) ∩ F (S) and $u n = K r n x n$. Put v n = J-1(Ju n - λ n Au n ) and $w n = J r n z n$ for all n ≥ 0. Since $J r n$, $K r n$ and S are relatively nonexpansive mappings. By (3.8), we have that, for all n

$ϕ ( p , x n + 1 ) ≤ α n ϕ ( p , x 1 ) + ( 1 - α n ) ϕ ( p , x n ) .$
(4.2)

From $∑ n = 1 ∞ α n < ∞$ and Lemma 2.10, we deduce that limn→∞ϕ(p, x n ) exists. This implies that {ϕ(p, x n )} is bounded. So {x n } is bounded.

Define a function g: F → [0, ∞) as follows:

$g ( p ) = lim n → ∞ ϕ ( p , x n ) , ∀ p ∈ F .$

Then, by the same argument as in proof of [, Theorem 3.1], we obtain g is a continuous convex function and if ||z n || → ∞ then g(z n ) → ∞. Hence, by [, Theorem 1.3.11], there exists a point v F such that

$g ( v ) = min y ∈ F g ( y ) ( : = l ) .$
(4.3)

Put t n = Π F x n for all n ≥ 0. We next prove that t n v as n → ∞. Suppose on the contrary that there exists ε0 > 0 such that, for each n , there is n'n satisfying ||wn'- v|| ≥ ϵ0. Since v F, we have

$ϕ ( t n , x n ) = ϕ ( Π F x n , x n ) ≤ ϕ ( v , Π F x n ) + ϕ ( Π F x n , x n ) ≤ ϕ ( v , x n )$
(4.4)

for all n ≥ 0. This implies that

$lim sup n → ∞ ϕ ( t n , x n ) ≤ lim n → ∞ ϕ ( v , x n ) = l .$
(4.5)

Since (||v|| - ||Π F x n ||)2ϕ(v, w n ) ≤ ϕ(v, x n ) for all n ≥ 0 and {x n } is bounded, we get {w n } is also bounded. By Lemma 2.3, there exists a stricly increasing, continuous and convex function K: [0, ∞) → [0, ∞) such that K(0) = 0 and

$w n + v 2 2 ≤ 1 2 t n 2 + 1 2 v 2 - 1 4 K ( t n - v ) ,$
(4.6)

for all n ≥ 0. Now, choose σ satisfying $0<σ< 1 4 K ( ϵ 0 )$. Hence, there exists n0 such that

$ϕ ( t n , x n ) ≤ l + σ , ϕ ( v , x n ) ≤ l + σ ,$
(4.7)

for all n ≥ 0. Thus there exists kn0 satisfying the following:

$ϕ ( t k , x k ) ≤ l + σ , ϕ ( v , x k ) ≤ l + σ , t k - v ≥ ϵ 0 .$
(4.8)

From (4.2), (4.6) and (4.8), we obtain

$ϕ t k + v 2 , x n + k ≤ ϕ t k + v 2 , x k = t k + v 2 2 - 2 t k + v 2 , J x k + x k 2 ≤ 1 2 t k 2 + 1 2 v 2 - 1 4 K ( t k - v ) - ⟨ t k + v , J x k ⟩ + x k 2 = 1 2 ϕ ( t k , x k ) + 1 2 ϕ ( v , x k ) - 1 4 K ( t k - v ) ≤ l + σ - 1 4 K ( ϵ 0 ) ,$
(4.9)

for all n ≥ 0. Hence

$l ≤ lim n → ∞ ϕ t k + v 2 , x n = lim n → ∞ ϕ t k + v 2 , x n + k ≤ l + σ - 1 4 K ( ϵ 0 ) < l + σ - σ = l .$
(4.10)

This is a contradiction. So, {w n } converges strongly to v F: = Ω ∩ V I(C, A) ∩T-1(0) ∩ F(S). Consequently, v F is the unique element of F such that

$lim n → ∞ ϕ ( v , x n ) = min y ∈ F lim n → ∞ ϕ ( y , x n ) .$
(4.11)

This completes the proof. □

Theorem 4.2. Let E be a 2-uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E. Let T: EE* be a maximal monotone operator satisfying D(T) C. Let J r = (J + rT)-1 J for r > 0, let A be an α-inverse-strongly monotone operator of C into E* and S be a relatively nonexpansive mappings from C into itself, with $F : = V I ( C , A ) ∩ T - 1 ( 0 ) ∩ F ( S ) ≠ 0$. Assume that A an operator of C into E* that satisfies the conditions (C1)-(C3). Let {x n } be a sequence generated by x1 = x C and,

$z n = Π C J - 1 ( J x n - λ n A x n ) , y n = J - 1 ( β n J x n + ( 1 - β n ) J S J r n z n ) , x n + 1 = Π C J - 1 ( α n J x 1 + ( 1 - α n ) J y n ) ,$
(4.12)

for all n , where Π C is the generalized projection from E onto C, J is the duality mapping on E. The coefficient sequence {a n } [0, 1], {β n } (0, 1], {r n } (0, ∞) satisfying $∑ n = 1 ∞ α n < ∞$, lim supn→∞β n < 1, lim infn→∞r n > 0 and {λ n } [a, b] for some a, b with $0, $1 c$ is the 2-uniformly convexity constant of E. Then the sequence F x n } converges strongly to an element v of F, which is a unique element of F satisfying

$lim n → ∞ ϕ ( v , x n ) = min y ∈ F lim n → ∞ ϕ ( y , x n ) .$

Now, we prove a weak convergence theorem for the algorithm (4.13) below under different condition on data.

Theorem 4.3. Let E be a 2-uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E. Let Θ be a bifunction from C × C to satisfying (A1)-(A4) let φ: C be a proper lower semicontinuous and convex function, let T: EE* be a maximal monotone operator satisfying D(T) C. Let J r = (J + rT)-1 J for r > 0 and let A be an α-inverse-strongly monotone operator of C into E*, let B: CE* be a continuous and monotone mappings and S be a relatively nonexpansive mappings from C into itself, with $F : = Ω ∩ V I ( C , A ) ∩ T - 1 ( 0 ) ∩ F ( S ) ≠ 0$. Assume that A an operator of C into E* that satisfies the conditions (C1)-(C3). Let {x n } be a sequence generated by x1 = x C and,

$u n = K r n x n , z n = Π C J - 1 ( J u n - λ n A u n ) , y n = J - 1 ( β n J x n + ( 1 - β n ) J S J r n z n ) , x n + 1 = Π C J - 1 ( α n J x 1 + ( 1 - α n ) J y n ) ,$
(4.13)

for all n , where Π C is the generalized projection from E onto C, J is the duality mapping on E. The coefficient sequence {α n } [0, 1], {βn} (0, 1], {r n } (0, ∞) satisfying $∑ n = 1 ∞ α n < ∞$, lim supn→∞β n < 1, lim infn→∞r n > 0 and {λ n } [a, b] for some a, b with $0, $1 c$ is the 2-uniformly convexity constant of E. Then the sequence {x n } converges weakly to an element v of F , where v = limn→∞Π F x n .

Proof . As in Proof of Theorem 3.1, we have {x n } is bounded, there exists a subsequence ${ x n i }$ of {x n } such that $x n i ⇀u∈C$ and hence u F: = Ω ∩ V I(C, A)∩T-1(0)∩F(S). By Theorem 4.1 the {Π F x n } converges strongly to a point v F which is a unique element of F such that

$lim n → ∞ ϕ ( v , x n ) = min y ∈ F lim n → ∞ ϕ ( y , x n ) .$
(4.14)

By the uniform smoothness of E, we also have $lim n → ∞ J ∏ F x n i - J v =0$.

Finally, we prove u = v. From Lemma 2.5 and u F, we have

$⟨ Π F x n i - u , J x n i - J Π F x n i ⟩ ≥ 0$

Since J is weakly sequentially continuous, $u n i ⇀u$ and u n - x n → 0, then

$⟨ v - u , J u - J v ⟩ ≥ 0 .$

On the other hand, since J is monotone, we have

$⟨ v - u , J u - J v ⟩ ≤ 0 .$

Hence,

$⟨ v - u , J u - J v ⟩ = 0 .$

Since E is strict convexity, it follows that u = v. Therefore the sequence {x n } converges weakly to v = limnΠ F x n . This completes the proof. □

Theorem 4.4. Let E be a 2-uniformly convex and uniformly smooth Banach space, let C be a nonempty closed convex subset of E. Let T: EE* be a maximal monotone operator satisfying D(T) C. Let J r = (J + rT)-1 J for r > 0, let A be an α-inverse-strongly monotone operator of C into E* and S be a relatively nonexpansive mappings from C into itself, with $F : = V I ( C , A ) ∩ T - 1 ( 0 ) ∩ F ( S ) ≠ 0$. Assume that A an operator of C into E* that satisfies the conditions (C1)-(C3). Let {x n } be a sequence generated by x1 = x C and,

$z n = Π C J - 1 ( J x n - λ n A x n ) , y n = J - 1 ( β n J x n + ( 1 - β n ) J S J r n z n ) , x n + 1 = Π C J - 1 ( α n J x 1 + ( 1 - α n ) J y n ) ,$
(4.15)

for all n , where Π C is the generalized projection from E onto C, J is the duality mapping on E. The coefficient sequence {α n } [0, 1], {β n } (0, 1], {r n } (0, ∞) satisfying $∑ n = 1 ∞ α n < ∞$, lim supn→∞β n < 1, lim infn→∞r n > 0 and {λ n } [a, b] for some a, b with $0 , $1 c$ is the 2-uniformly convexity constant of E. Then the sequence {x n } converges weakly to an element v of F, where v = limn→∞Π F x n .

## References

1. 1.

Reich S: A Weak Convergence Theorem for the Alternating Method with Bregman Distance. In Theory and Applications of Nonlinear Operators of Accretive and Monotone Type. Edited by: Kartsatos AG. Marcel Dekker, New York; 1996:313–318.

2. 2.

Nilsrakoo W, Saejung S: Strong convergence to common fixed points of countable relatively quasi-nonexpansive mappings. Fixed Point Theory Appl 2008, 2008: 19. (Article ID 312454)

3. 3.

Su Y, Wang D, Shang M: Strong convergence of monotone hybrid algorithm for hemi-relatively nonexpansive mappings. Fixed Point Theory Appl 2008, 2008: 8. (Article ID 284613)

4. 4.

Zegeye H, Shahzad N: Strong convergence for monotone mappings and relatively weak nonexpansive mappings. Nonlinear Anal 2009, 70: 2707–2716. 10.1016/j.na.2008.03.058

5. 5.

Butnariu D, Reich S, Zaslavski AJ: Asymptotic behavior of relatively nonexpansive operators in Banach spaces. J Appl Anal 2001, 7: 151–174.

6. 6.

Cens Y, Reich S: Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization. Optimization 1996, 37: 323–339. 10.1080/02331939608844225

7. 7.

Blum E, Oettli W: From optimization and variational inequalities to equilibrium problems. Math Student 1994, 63: 123–145.

8. 8.

Flam SD, Antipin AS: Equilibrium progamming using proximal-link algolithms. Math Program 1997, 78: 29–41.

9. 9.

Moudafi A, Thera M: Proximal and dynamical approaches to equilibrium problems. In Lecture note in Economics and Mathematical Systems. Volume 477. Springer-Verlag, New York; 1999:187–201. 10.1007/978-3-642-45780-7_12

10. 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.036

11. 11.

Combettes PL, Hirstoaga SA: Equilibrium programming in Hilbert spaces. J Nonlinear Convex Anal 2005, 6: 117–136.

12. 12.

Saewan S, Kumam P: A hybrid iterative scheme for a maximal monotone operator and two countable families of relatively quasi-nonexpansive mappings for generalized mixed equilibrium and variational inequality problems. Abstr Appl Anal 2010, 2010: 31. (Article ID 123027)

13. 13.

Saewan S, Kumam P, Wattanawitoon K: Convergence theorem based on a new hybrid projection method for finding a common solution of generalized equilibrium and variational inequality problems in Banach spaces. Abstr Appl Anal 2010, 2010: 26. (Article ID 734126)

14. 14.

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 Publishers. Yokohama; 2006:609–617.

15. 15.

Tada A, Takahashi W: Weak and strong convergence theorems for a nonexpansive mappings and an equilibrium problem. J Optim Theory Appl 2007, 133: 359–370. 10.1007/s10957-007-9187-z

16. 16.

Iiduka H, Takahashi W, Toyoda M: Approximation of solutions of variational inequalities for monotone mappings. Panamer Math J 2004, 14: 49–61.

17. 17.

Iiduka H, Takahashi W: Weak convergence of a projection algorithm for variational inequalities in a Banach space. J Math Anal Appl 2008, 339: 668–679. 10.1016/j.jmaa.2007.07.019

18. 18.

Rockafellar RT: Monotone operators and the proximal point algorithm. SIAM J Control Optim 1976, 14: 877–898. 10.1137/0314056

19. 19.

Kamimura S, Takahashi W: Approximating solutions of maximal monotone operators in Hilbert spaces. J Approx Theory 2000, 160: 226–240.

20. 20.

Kamimura S, Takahashi W: Strong convergence of a proximal-type algorithm in a Banach space. SIAM J Optim 2002, 13(3):938–945. 10.1137/S105262340139611X

21. 21.

Kohsaka F, Takahashi W: Strong convergence of an iterative sequence for maximal monotone operators in a Banach space. Abstr Appl Anal 2004, 3: 239–249.

22. 22.

Kamimura S, Kohsaka F, Takahashi W: Weak and strong convergence of a maximal monotone operators in a Banach space. Set-Valued Anal 2004, 12(4):417–429. 10.1007/s11228-004-8196-4

23. 23.

Li L, Song W: Modified proximal-point algorithm for maximal monotone operators in Banach spaces. J Optim Theory Appl 2008, 138: 45–64. 10.1007/s10957-008-9370-x

24. 24.

Zhang S: Generalized mixed equlibrium problem in Banach spaces. Appl Math Mech Engl Ed 2009, 30: 1105–1112. 10.1007/s10483-009-0904-6