Skip to main content

New iterative methods for a common solution of fixed points for pseudo-contractive mappings and variational inequalities

Abstract

In this paper, we introduce three iterative methods for finding a common element of the set of fixed points for a continuous pseudo-contractive mapping and the solution set of a variational inequality problem governed by continuous monotone mappings. Strong convergence theorems for the proposed iterative methods are proved. Our results improve and extend some recent results in the literature.

MSC:47H05, 47H09, 47J25, 65J15.

1 Introduction

The theory of variational inequalities represents, in fact, a very natural generalization of the theory of boundary value problems and allows us to consider new problems arising from many fields of applied mathematics, such as mechanics, physics, engineering, the theory of convex programming, and the theory of control. While the variational theory of boundary value problems has its starting point in the method of orthogonal projection, the theory of variational inequalities has its starting point in the projection on a convex set.

Let C be a nonempty closed and convex subset of a real Hilbert space H. The classical variational inequality problem is to find u∈C such that 〈v−u,Au〉≥0 for all v∈C, where A is a nonlinear mapping. The set of solutions of the variational inequality is denoted by VI(C,A). The variational inequality problem has been extensively studied in the literature; see [1–9] and the references therein. In the context of the variational inequality problem, this implies that u∈VI(C,A)⇔u= P C (u−λAu), ∀λ>0, where P C is a metric projection of H into C.

Let A be a mapping from C to H, then A is called monotone if and only if for each x,y∈C,

〈x−y,Ax−Ax〉≥0.
(1.1)

An operator A is said to be strongly positive on H if there exists a constant γ ¯ >0 such that

〈Ax,x〉≥ γ ¯ ∥ x ∥ 2 ,∀x∈H.

A mapping A of C into itself is called L-Lipschitz continuous if there exits a positive number L such that

∥Ax−Ay∥≤L∥x−y∥,∀x,y∈C.

A mapping A of C into H is called α-inverse-strongly monotone if there exists a positive real number α such that

〈x−y,Ax−Ay〉≥α ∥ A x − A y ∥ 2

for all x,y∈C; see [9–14]. If A is an α-inverse strongly monotone mapping of C into H, then it is obvious that A is 1 α -Lipschitz continuous, that is, ∥Ax−Ay∥≤ 1 α ∥x−y∥ for all x,y∈C. Clearly, the class of monotone mappings includes the class of α-inverse strongly monotone mappings.

A mapping A of C into H is called γ ¯ -strongly monotone if there exists a positive real number γ ¯ such that

〈x−y,Ax−Ay〉≥ γ ¯ ∥ x − y ∥ 2

for all x,y∈C; see [15]. Clearly, the class of γ ¯ -strongly monotone mappings includes the class of strongly positive mappings.

Recall that a mapping T of C into H is called pseudo-contractive if for each x,y∈C, we have

〈Tx−Ty,x−y〉≤ ∥ x − y ∥ 2 .
(1.2)

T is said to be a k-strict pseudo-contractive mapping if there exists a constant 0≤k≤1 such that

〈x−y,Tx−Ty〉≤ ∥ x − y ∥ 2 −k ∥ ( I − T ) x − ( I − T ) y ∥ 2 for all x,y∈D(T).

A mapping T of C into itself is called nonexpansive if ∥Tx−Ty∥≤∥x−y∥ for all x,y∈C. We denote by F(T) the set of fixed points of T. Clearly, the class of pseudo-contractive mappings includes the class of nonexpansive and strict pseudo-contractive mappings.

For a sequence { α n } of real numbers in (0,1) and arbitrary u∈C, let the sequence { x n } in C be iteratively defined by x 0 ∈C and

x n + 1 := α n + 1 u+(1− α n + 1 )T x n ,n≥0,
(1.3)

where T is a nonexpansive mapping of C into itself. Halpern [16] was first to study the convergence of algorithm (1.3) in the framework of Hilbert spaces. Lions [17] and Wittmann [18] improved the result of Halpern by proving strong convergence of { x n } to a fixed point of T if the real sequence { α n } satisfies certain conditions. Reich [19], Shioji and Takahashi [20], and Zegeye and Shahzad [21] extended the result of Wittmann [18] to the case of a Banach space.

In 2000, Moudafi [22] introduced a viscosity approximation method and proved that if H is a real Hilbert space, for given x 0 ∈C, the sequence { x n } generated by the algorithm

x n + 1 := α n f( x n )+(1− α n )T x n ,n≥0,
(1.4)

where f:C→C is a contraction mapping and { α n }⊂(0,1) satisfies certain conditions, converges strongly to the unique solution x ∗ in C of the variational inequality

〈 ( I − f ) x ∗ , x − x ∗ 〉 ≥0,x∈C.
(1.5)

Moudafi [22] generalized Halpern’s theorems in the direction of viscosity approximations. In [23], Zegeye et al. extended Moudafi’s result to the case of Lipschitz pseudo-contractive mappings in Banach spaces more general that Hilbert spaces.

In 2006, Marino and Xu [24] introduced the following general iterative method:

x n + 1 := α n γf( x n )+(1− α n A)T x n ,n≥0.
(1.6)

They proved that if the sequence { α n } of parameters satisfies appropriate conditions, then the sequence { x n } generated by (1.6) converges strongly to the unique solution of the variational inequality

〈 ( A − γ f ) x ∗ , x − x ∗ 〉 ≥0,x∈C,
(1.7)

which is the optimality condition for the minimization problem

min x ∈ C 1 2 〈Ax,x〉−h(x),

where h is a potential function for γf (i.e., h ′ (x)=γf(x) for x∈H).

Recently, Zegeye and Shahzad [25] introduced an iterative method and proved that if C is a nonempty subset of a real Hilbert space H, T 1 :C→C is a pseudo-contractive mapping and T 2 :C→H is a continuous monotone mapping such that F:=F( T 1 )∩VI(C, T 2 )≠∅. For { r n }⊂(0,∞) defined T r n , F r n :H→C by the following: for x∈H and { r n }⊂(0,∞), define

T r n x:= { z ∈ C : 〈 y − z , T 1 z 〉 − 1 r n 〈 y − z , ( 1 + r n ) z − x 〉 ≤ 0 , y ∈ C } ,
(1.8)
F r n x:= { z ∈ C : 〈 y − z , T 2 z 〉 + 1 r n 〈 y − z , z − x 〉 ≥ 0 , y ∈ C } .
(1.9)

Then the sequence { x n } generated by x 1 ∈C and

x n + 1 := α n f( x n )+(1− α n ) T r n F r n x n ,n≥1,
(1.10)

where f:C→C is a contraction mapping and { α n }⊂[0,1] and { r n } satisfy certain conditions, converges strongly to z∈F, where z= P F f(z).

In this paper, motivated and inspired by the method of Marino and Xu [24] and the work of Zegeye and Shahzad [25], we introduce a viscosity approximation method for finding a common fixed point of a set of fixed points of continuous pseudo-contractive mappings more general than nonexpansive mappings and a solution set of the variational inequality problem for continuous monotone mappings more general than α-inverse strongly monotone mappings in a real Hilbert space. Our result extend and unify most of the results that have been proved for important classes of nonlinear operators.

Let C be a nonempty closed and convex subset of a real Hilbert space H. Let T 1 , T 2 :C→H be a continuous pseudo-contractive mapping and a continuous monotone mapping, respectively. For x∈H and { r n }⊂(0,∞), let T r n , F r n :H→C be defined by (1.8) and (1.9).

We consider the three iterative methods given as follows:

x 1 ∈ H , x n + 1 : = α n γ f ( x n ) + ( I − α n A ) T r n F r n x n , n ≥ 1 ,
(1.11)
y 1 ∈ H , y n + 1 : = α n γ f ( T r n F r n y n ) + ( I − α n A ) T r n F r n y n , n ≥ 1 ,
(1.12)
z 1 ∈ H , z n + 1 : = T r n F r n ( α n γ f ( z n ) + ( I − α n A ) z n ) , n ≥ 1 ,
(1.13)

where A is a γ ¯ -strongly monotone and L-Lipschitzian continuous operator and f:H→H is a contraction mapping. We prove in Section 3 that if { α n } and { r n } of parameters satisfy appropriate conditions, then the sequences { x n }, { y n } and { z n } converge strongly to z= P F (I−A+γf)(z).

2 Preliminaries

Let C be a closed and convex subset of a real Hilbert space H. For every x∈H, there exists a unique nearest point in C, denoted by P C x, such that

∥x− P C x∥=∥x−y∥,∀y∈C.
(2.1)

P C is called the metric projection of H onto C. We know that P C is a nonexpansive mapping of H onto C. In connection with metric projection, we have the following lemma.

Lemma 2.1 Let H be a real Hilbert space. The following identity holds:

∥ x + y ∥ 2 ≤ ∥ x ∥ 2 +2〈y,x+y〉,∀x,y∈H.

Lemma 2.2 Let C be a nonempty closed convex subset of a Hilbert space H. Let x∈H and y∈C. Then y= P C x if and only if

〈x−y,y−z〉≥0,∀z∈C.
(2.2)

Lemma 2.3 [26]

Let { a n } be a sequence of nonnegative real numbers such that

a n + 1 ≤(1− γ n ) a n + σ n ,∀n≥0,

where

  1. (i)

    { γ n }⊂[0,1], ∑ n = 1 ∞ γ n =∞ and

  2. (ii)

    lim sup n → ∞ σ n γ n ≤0 or ∑ n = 1 ∞ | σ n |<∞.

Then a n →0 as n→∞.

Lemma 2.4 [27]

Let C be a nonempty closed and convex subset of a real Hilbert space H. Let A:C→H be a continuous monotone mapping. Then, for r>0 and x∈H, there exists z∈C such that

〈y−z,Az〉+ 1 r 〈y−z,z−x〉≥0,∀y∈C.
(2.3)

Moreover, by a similar argument as in the proof of Lemmas 2.8 and 2.9 in [28], Zegeye [27]obtained the following lemmas.

Lemma 2.5 [27]

Let C be a nonempty closed and convex subset of a real Hilbert space H. Let A:C→H be a continuous monotone mapping. For r>0 and x∈H, define a mapping F r :H→C as follows:

F r x:= { z ∈ C : 〈 y − z , A z 〉 + 1 r 〈 y − z , z − x 〉 ≥ 0 , ∀ y ∈ C }

for all x∈H. Then the following hold:

  1. (1)

    F r is single-valued;

  2. (2)

    F r is a firmly nonexpansive type mapping, i.e., for all x,y∈H,

    ∥ F r x − F r y ∥ 2 ≤〈 F r x− F r y,x−y〉;
  3. (3)

    F( F r )=VI(C,A);

  4. (4)

    VI(C,A) is closed and convex.

In the sequel, we shall make use of the following lemmas.

Lemma 2.6 [27]

Let C be a nonempty closed and convex subset of a real Hilbert space H. Let T:C→H be a continuous pseudo-contractive mapping. Then, for r>0 and x∈H, there exists z∈C such that

〈y−z,Tz〉− 1 r 〈 y − z , ( 1 + r ) z − x 〉 ≤0,∀y∈C.
(2.4)

Lemma 2.7 [27]

Let C be a nonempty closed and convex subset of a real Hilbert space H. Let T:C→C be a continuous pseudo-contractive mapping. For r>0 and x∈H, define a mapping T r :H→C as follows:

T r x:= { z ∈ C : 〈 y − z , T z 〉 + 1 r 〈 y − z , ( 1 + r ) z − x 〉 ≤ 0 , ∀ y ∈ C }

for all x∈H. Then the following hold:

  1. (1)

    T r is single-valued;

  2. (2)

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

    ∥ T r x − T r y ∥ 2 ≤〈 T r x− T r y,x−y〉;
  3. (3)

    F( T r )=F(T);

  4. (4)

    F(T) is closed and convex.

Lemma 2.8 [15]

Let 0<α<1 and let f be an α-contraction of a real Hilbert space H into itself, and let A be a γ ¯ -strongly monotone and L-Lipschitzian continuous operator of H into itself with γ ¯ >0 and L>0. Take μ, γ to be real numbers as follows:

0<μ< 2 γ ¯ L 2 ,0<γ< γ ¯ − L 2 μ 2 α .

If { α n }⊆(0,1), lim n → ∞ α n =0 and τ= γ ¯ − L 2 μ 2 , then

∥ ( I − α n A ) x − ( I − α n A ) y ∥ ≤(1− α n τ)∥x−y∥,∀x,y∈H.

3 Main results

Now, we prove our main theorems.

Theorem 3.1 Let H be a real Hilbert space, T 1 :C→C be a continuous pseudo-contractive mapping and T 2 :C→H be a continuous monotone mapping such that F:=F( T 1 )∩VI(C, T 2 )≠∅. Let 0<α<1 and let f be an α-contraction of H into itself, and let A be a γ ¯ -strongly monotone and L-Lipschitzian continuous operator of C into H with γ ¯ >0 and L>0. Take μ, γ to be real numbers as follows:

0<μ< 2 γ ¯ L 2 ,0<γ< γ ¯ − L 2 μ 2 α .

For x 1 ∈H, let { x n } be a sequence generated by (1.11), where { α n }⊂[0,1] and { r n }⊂(0,∞) are such that lim n → ∞ α n =0, ∑ n = 1 ∞ α n =∞, ∑ n = 1 ∞ | α n + 1 − α n |<∞, lim inf n → ∞ r n >0 and ∑ n = 1 ∞ | r n + 1 − r n |<∞. Then the sequence { x n } converges strongly to z∈F, where z= P F (I−A+γf)(z).

Proof Since α n →0 as n→∞, we may assume, without loss of generality, α n <1 for all n. For Q= P F , it implies that Q(I−A+γf) is a contraction of H into itself. Since H is a real Hilbert space, there exists a unique element z∈H such that z= P F (I−A+γf)(z).

Let v∈F, and let u n := T r n w n , where w n := F r n x n . Then we have from Lemma (2.5) and (2.7) that

∥ u n −v∥=∥ T r n w n − T r n v∥≤∥ w n −v∥=∥ F r n x n − F r n v∥≤∥ x n −v∥.
(3.1)

Moreover, from (1.11) and (3.1), we get that

∥ x n + 1 − v ∥ = ∥ α n γ f ( x n ) + ( I − α n A ) u n − v ∥ = ∥ α n ( γ f ( x n ) − A ( v ) ) + ( I − α n A ) u n − ( I − α n A ) v ∥ ≤ ( 1 − α n τ ) ∥ x n − v ∥ + α n γ α ∥ x n − v ∥ + α n ∥ γ f ( v ) − A ( v ) ∥ ≤ ( 1 − α n ( τ − γ α ) ) ∥ x n − v ∥ + α n ∥ γ f ( v ) − A ( v ) ∥ = ( 1 − α n ( τ − γ α ) ) ∥ x n − v ∥ + α n ( τ − γ α ) ∥ γ f ( v ) − A ( v ) ∥ τ − γ α .
(3.2)

It follows from induction that

∥ x n −v∥≤max { ∥ x 1 − v ∥ , ∥ γ f ( v ) − A ( v ) ∥ τ − γ α } ,n≥1.
(3.3)

Thus { x n } is bounded, and hence so are { u n }, { w n } and {f( x n )}. Next, to show that ∥ x n + 1 − x n ∥→0, we have

∥ x n + 1 − x n ∥ = ∥ α n γ f ( x n ) + ( I − α n A ) u n − ( α n − 1 γ f ( x n − 1 ) + ( I − α n − 1 A ) u n − 1 ) ∥ = ∥ α n γ f ( x n ) − α n γ f ( x n − 1 ) + α n γ f ( x n − 1 ) − α n − 1 γ f ( x n − 1 ) + ( I − α n A ) u n − ( I − α n A ) u n − 1 + ( I − α n A ) u n − 1 − ( I − α n − 1 A ) u n − 1 ∥ ≤ α n γ α ∥ x n − x n − 1 ∥ + | α n − α n − 1 | γ ∥ f ( x n − 1 ) ∥ + ( 1 − α n τ ) ∥ u n − u n − 1 ∥ + | α n − α n − 1 | ∥ A u n − 1 ∥ ≤ α n γ α ∥ x n − x n − 1 ∥ + ( 1 + γ ) | α n − α n − 1 | K + ( 1 − α n τ ) ∥ u n − u n − 1 ∥ ≤ α n γ α ∥ x n − x n − 1 ∥ + ( 1 + γ ) | α n − α n − 1 | K + ( 1 − α n τ ) ∥ w n − w n − 1 ∥ ,
(3.4)

where .

Moreover, since w n = F r n x n , w n + 1 = F r n + 1 x n + 1 , we get that

〈y− w n , T 2 w n 〉+ 1 r n 〈y− w n , w n − x n 〉≥0for all y∈C,
(3.5)
〈y− w n + 1 , T 2 w n + 1 〉+ 1 r n + 1 〈y− w n + 1 , w n + 1 − x n + 1 〉≥0for all y∈C.
(3.6)

Putting y= w n + 1 in (3.5) and y= w n in (3.6), we get that

〈 w n + 1 − w n , T 2 w n 〉+ 1 r n 〈 w n + 1 − w n , w n − x n 〉≥0,
(3.7)
〈 w n − w n + 1 , T 2 w n + 1 〉+ 1 r n + 1 〈 w n − w n + 1 , w n + 1 − x n + 1 〉≥0.
(3.8)

Adding (3.7) and (3.8), we have

〈 w n + 1 − w n , T 2 w n − T 2 w n + 1 〉+ 〈 w n + 1 − w n , w n − x n r n − w n + 1 − x n + 1 r n + 1 〉 ≥0,
(3.9)

which implies that

−〈 w n + 1 − w n , T 2 w n + 1 − T 2 w n 〉+ 〈 w n + 1 − w n , w n − x n r n − w n + 1 − x n + 1 r n + 1 〉 ≥0.
(3.10)

Now, using the fact that T 2 is monotone, we get that

〈 w n + 1 − w n , w n − x n r n − w n + 1 − x n + 1 r n + 1 〉 ≥0,
(3.11)

and hence

〈 w n + 1 − w n , w n − w n + 1 + w n + 1 − x n − r n r n + 1 ( w n + 1 − x n + 1 ) 〉 ≥0.
(3.12)

Without loss of generality, let us assume that there exists a real number b such that r n >b>0 for all . Then we have

∥ w n + 1 − w n ∥ 2 ≤ 〈 w n + 1 − w n , x n + 1 − x n + ( 1 − r n r n + 1 ) ( w n + 1 − x n + 1 ) 〉 ≤ ∥ w n + 1 − w n ∥ { ∥ x n + 1 − x n ∥ + | ( 1 − r n r n + 1 ) | ∥ w n + 1 − x n + 1 ∥ } ,
(3.13)

and hence from (3.13) we obtain that

∥ w n + 1 − w n ∥ ≤ ∥ x n + 1 − x n ∥ + 1 r n + 1 | r n + 1 − r n | ∥ w n + 1 − x n + 1 ∥ ≤ ∥ x n + 1 − x n ∥ + 1 b | r n + 1 − r n | L ,
(3.14)

where .

Furthermore, from (3.4) and (3.14) we have that

∥ x n + 1 − x n ∥ ≤ α n γ α ∥ x n − x n − 1 ∥ + ( 1 + γ ) | α n − α n − 1 | K + ( 1 − α n τ ) ( ∥ x n − x n − 1 ∥ + 1 b | r n − r n − 1 | L ) .
(3.15)

Hence by Lemma 2.3, we have

∥ x n + 1 − x n ∥→0as n→∞.
(3.16)

Consequently, from (3.14) and (3.16), we have that

∥ w n + 1 − w n ∥→0as n→∞.
(3.17)

Moreover, since u n = T r n w n , u n + 1 = T r n + 1 w n + 1 , we get that

〈y− u n , T 1 u n 〉− 1 r n 〈 y − u n , ( 1 + r n ) u n − w n 〉 ≤0for all y∈C.
(3.18)

and

〈y− u n + 1 , T 1 u n + 1 〉− 1 r n + 1 〈 y − u n + 1 , ( 1 + r n + 1 ) u n + 1 − w n + 1 〉 ≤0for all y∈C.
(3.19)

Putting y= u n + 1 in (3.18) and y= u n in (3.19), we get that

〈 u n + 1 − u n , T 2 u n 〉− 1 r n 〈 u n + 1 − u n , ( 1 + r n ) u n − w n 〉 ≤0
(3.20)

and

〈 u n − u n + 1 , T 2 u n + 1 〉− 1 r n + 1 〈 u n − u n + 1 , ( 1 + r n + 1 ) u n + 1 − w n + 1 〉 ≤0.
(3.21)

Adding (3.20) and (3.21), we have

〈 u n + 1 − u n , T 2 u n − T 2 u n + 1 〉 − 〈 u n + 1 − u n , ( 1 + r n ) u n − w n r n − ( 1 + r n + 1 ) u n + 1 − w n + 1 r n + 1 〉 ≤ 0 ,
(3.22)

which implies that

〈 u n + 1 − u n , ( u n + 1 − T 2 u n + 1 ) − ( u n − T 2 u n ) 〉 − 〈 u n + 1 − u n , u n − w n r n − u n + 1 − w n + 1 r n + 1 〉 ≤ 0 .
(3.23)

Now, using the fact that T 1 is pseudo-contractive, we get that

〈 u n + 1 − u n , u n − w n r n − u n + 1 − w n + 1 r n + 1 〉 ≥0,
(3.24)

and hence

〈 u n + 1 − u n , u n − u n + 1 + u n + 1 − w n − r n r n + 1 ( u n + 1 − w n + 1 ) 〉 ≥0.
(3.25)

Thus, using the method in (3.13) and (3.14), we have that

∥ u n + 1 − u n ∥ ≤ ∥ x n + 1 − x n ∥ + 1 r n + 1 | r n + 1 − r n | ∥ u n + 1 − w n + 1 ∥ ≤ ∥ x n + 1 − x n ∥ + 1 b | r n + 1 − r n | L ,
(3.26)

where .

Therefore, from (3.16) and the property of { r n }, we have that

∥ u n + 1 − u n ∥→0as n→∞.
(3.27)

Furthermore, since x n = α n − 1 γf( x n − 1 )+(I− α n − 1 A) u n − 1 , we have that

∥ x n − u n ∥ ≤ ∥ x n − u n − 1 ∥ + ∥ u n − 1 − u n ∥ = ∥ α n − 1 γ f ( x n − 1 ) + ( I − α n − 1 A ) u n − 1 − u n − 1 ∥ + ∥ u n − 1 − u n ∥ = α n − 1 ∥ γ f ( x n − 1 ) − A u n − 1 ∥ + ∥ u n − 1 − u n ∥ .
(3.28)

From α n →0, we have ∥ x n − u n ∥→0.

Now, for v∈F, using Lemma 2.5, we get that

∥ w n − v ∥ 2 = ∥ F r n x n − F r n v ∥ 2 ≤ 〈 F r n x n − F r n v , x n − v 〉 = 〈 w n − v , x n − v 〉 = 1 2 ( ∥ w n − v ∥ 2 + ∥ x n − v ∥ 2 − ∥ x n − w n ∥ 2 ) ,
(3.29)

and hence

∥ w n − v ∥ 2 ≤ ∥ x n − v ∥ 2 − ∥ x n − w n ∥ 2 .
(3.30)

Therefore, we have

∥ x n + 1 − v ∥ 2 = ∥ α n γ f ( x n ) + ( I − α n A ) u n − v ∥ 2 = ∥ α n ( γ f ( x n ) − A v ) + ( I − α n A ) ( u n − v ) ∥ 2 ≤ ( 1 − α n τ ) 2 ∥ u n − v ∥ 2 + 2 α n 〈 γ f ( x n ) − A v , x n + 1 − v 〉 ≤ ( 1 − α n τ ) 2 ∥ w n − v ∥ 2 + 2 α n 〈 γ f ( x n ) − γ f ( v ) + γ f ( v ) − A v , x n + 1 − v 〉 ≤ ( 1 − α n τ ) 2 ∥ w n − v ∥ 2 + 2 α n γ 〈 f ( x n ) − f ( v ) , x n + 1 − v 〉 + 2 α n 〈 γ f ( v ) − A v , x n + 1 − v 〉 ≤ ( 1 − α n τ ) 2 ∥ w n − v ∥ 2 + 2 α n γ α ∥ x n − v ∥ ∥ x n + 1 − v ∥ + 2 α n ∥ γ f ( v ) − A v ∥ ∥ x n + 1 − v ∥ ≤ ( 1 − α n τ ) 2 ( ∥ x n − v ∥ 2 − ∥ x n − w n ∥ 2 ) + 2 α n γ α ∥ x n − v ∥ ∥ x n + 1 − v ∥ + 2 α n ∥ γ f ( v ) − A v ∥ ∥ x n + 1 − v ∥ = ( 1 − 2 α n τ + ( α n τ ) 2 ) ∥ x n − v ∥ 2 − ( 1 − α n τ ) 2 ∥ x n − w n ∥ 2 + 2 α n γ α ∥ x n − v ∥ ∥ x n + 1 − v ∥ + 2 α n ∥ γ f ( v ) − A v ∥ ∥ x n + 1 − v ∥ .
(3.31)

Hence

( 1 − α n τ ) 2 ∥ x n − w n ∥ 2 ≤ ∥ x n − v ∥ 2 − ∥ x n + 1 − v ∥ 2 + α n γ ¯ 2 ∥ x n − v ∥ 2 + 2 α n γ α ∥ x n − v ∥ ∥ x n + 1 − v ∥ + 2 α n ∥ γ f ( v ) − A v ∥ ∥ x n + 1 − v ∥ ≤ ∥ x n − x n + 1 ∥ { ∥ x n − v ∥ + ∥ x n + 1 − v ∥ } + α n τ 2 ∥ x n − v ∥ 2 + 2 α n γ α ∥ x n − v ∥ ∥ x n + 1 − v ∥ + 2 α n ∥ γ f ( v ) − A v ∥ ∥ x n + 1 − v ∥ .
(3.32)

So, we have

∥ x n − w n ∥→0as n→∞.
(3.33)

Since ∥ u n − w n ∥≤∥ u n − x n ∥+∥ x n − w n ∥, it follows that

∥ u n − w n ∥→0as n→∞.

Next, we show that

lim sup n → ∞ 〈 ( A − γ f ) z , z − x n 〉 ≤0,

where z= P F (I−A+γf)(z).

To show this equality, we choose a subsequence { x n i } of { x n } such that

lim sup n → ∞ 〈 ( A − γ f ) z , z − x n i 〉 = lim sup n → ∞ 〈 ( A − γ f ) z , z − x n 〉 .

Since { x n i } is bounded, there exists a subsequence { x n i j } of { x n i } and w∈H such that x n i j ⇀w. Without loss of generality, we may assume that x n i ⇀w. Since { x n i }⊂H and H is closed and convex, we get that w∈H. Moreover, since x n − w n →0 as n→∞, we have that w n i ⇀w.

Now, we show that w∈F. Note that from the definition of w n , we have

〈y− w n i , T 2 w n i 〉+ 〈 y − w n i , w n i − x n i r n i 〉 ≥0for all y∈C.
(3.34)

Put z t =tv+(1−t)w for all t∈(0,1] and v∈H. Consequently, we get that z t ∈H. From (3.34) it follows that

〈 z t − w n i , T 2 z t 〉 ≥ 〈 z t − w n i , T 2 z t 〉 − 〈 z t − w n i , T 2 w n i 〉 − 〈 z t − w n i , w n i − x n i r n i 〉 = 〈 z t − w n i , T 2 z t − T 2 w n i 〉 − 〈 z t − w n i , w n i − x n i r n i 〉 .

From the fact that w n i − x n i →0 as n→∞, we obtain that w n i − x n i r n i →0 as n→∞.

Since T 2 is monotone, we have that 〈 z t − w n i , T 2 z t − T 2 w n i 〉≥0. Thus, it follows that

0≤ lim i → ∞ 〈 z t − w n i , T 2 z t 〉=〈 z t −w, T 2 z t 〉,

and hence

〈z−w, T 2 z t 〉≥0for all z∈C.
(3.35)

Letting t→0 and using the fact that T 2 is continuous, we obtain that

〈z−w, T 2 w〉≥0for all v∈C.
(3.36)

This implies that w∈VI(C, T 2 ).

Furthermore, from the definition of u n i we have that

〈y− u n i , T 2 u n i 〉− 1 r n i 〈 y − u n i , ( r n i + 1 ) u n i − x n i 〉 ≤0for all y∈C.
(3.37)

Put z t =tv+(1−t)w for all t∈(0,1] and v∈H. Consequently, we get that z t ∈H. From (3.33) and pseudo-contractivity of T 1 , it follows that

〈 u n i − z t , T 1 z t 〉 ≥ 〈 u n i − z t , T 1 z t 〉 + 〈 z t − u n i , T 1 u n i 〉 − 1 r n i 〈 z t − u n i , ( r n i + 1 ) u n i − w n i 〉 = − 〈 z t − u n i , T 1 z t − T 1 u n i 〉 − 1 r n i 〈 z t − u n i , u n i − w n i 〉 − 〈 z t − u n i , u n i 〉 ≥ − ∥ z t − u n i ∥ 2 − 1 r n i 〈 z t − u n i , u n i − w n i 〉 − 〈 z t − u n i , u n i 〉 = − 〈 z t − u n i , z t 〉 − 〈 z t − u n i , u n i − w n i r n i 〉 .
(3.38)

Then, since w n − x n →0 as n→∞, we obtain that w n i − x n i r n i →0 as i→∞. Thus, as i→∞, it follows that

〈w− z t , T 1 z t 〉≥〈w− z t , z t 〉,
(3.39)

and hence

−〈v−w, T 1 z t 〉≥−〈v−w, z t 〉for all v∈C.
(3.40)

Letting t→0 and using the fact that T 1 is continuous, we obtain that

−〈v−w, T 1 w〉≥−〈v−w,w〉for all v∈C.
(3.41)

Now, let v= T 1 w. Then we obtain that w= T 1 w and hence w∈F( T 1 ).

Therefore, w∈F( T 1 )∩VI(C, T 2 ) and since z= P F (I−A+γf)(z), by Lemma 2.2, implies that

lim sup n → ∞ 〈 ( γ f − A ) ( z ) , x n − z 〉 = lim sup i → ∞ 〈 ( I − A + γ f ) ( z ) , x n i − z 〉 = 〈 ( γ f − A ) ( z ) , w − z 〉 ≤ 0 .
(3.42)

Now, we show that x n →z as n→∞. From x n + 1 −z= α n (γf( x n )−Az)+(I− α n A)( u n −z), we have that

∥ x n + 1 − z ∥ 2 = ∥ α n ( γ f ( x n ) − A z ) + ( I − α n A ) ( u n − z ) ∥ 2 ≤ ( 1 − α n τ ) 2 ∥ u n − z ∥ 2 + 2 α n 〈 γ f ( x n ) − A z , x n + 1 − z 〉 ≤ ( 1 − α n τ ) 2 ∥ x n − z ∥ 2 + 2 α n 〈 γ f ( x n ) − γ f ( z ) + γ f ( z ) − A z , x n + 1 − z 〉 ≤ ( 1 − α n τ ) 2 ∥ x n − z ∥ 2 + 2 α n γ 〈 f ( x n ) − f ( z ) , x n + 1 − z 〉 + 2 α n 〈 γ f ( z ) − A z , x n + 1 − z 〉 ≤ ( 1 − α n τ ) 2 ∥ x n − z ∥ 2 + 2 α n γ α ∥ x n − z ∥ ∥ x n + 1 − z ∥ + 2 α n 〈 γ f ( z ) − A z , x n + 1 − z 〉 ≤ ( 1 − α n τ ) 2 ∥ x n − z ∥ 2 + α n γ α { ∥ x n − z ∥ 2 + ∥ x n + 1 − z ∥ 2 } + 2 α n 〈 γ f ( z ) − A z , x n + 1 − z 〉 = ( ( 1 − α n τ ) 2 + α n γ α ) ∥ x n − z ∥ 2 + α n γ α ∥ x n + 1 − z ∥ 2 + 2 α n 〈 γ f ( z ) − A z , x n + 1 − z 〉 .
(3.43)

This implies that

∥ x n + 1 − z ∥ 2 ≤ 1 − 2 α n τ + ( α n τ ) 2 + α n γ α 1 − α n γ α ∥ x n − z ∥ 2 + 2 α n 1 − α n γ α 〈 γ f ( z ) − A z , x n + 1 − z 〉 = [ 1 − 2 ( τ − γ α ) α n 1 − α n γ α ] ∥ x n − z ∥ 2 + ( α n τ ) 2 1 − α n γ α ∥ x n − z ∥ 2 + 2 α n 1 − α n γ α 〈 γ f ( z ) − A z , x n + 1 − z 〉 ≤ [ 1 − 2 ( τ − γ α ) α n 1 − α n γ α ] ∥ x n − z ∥ 2 + 2 ( τ − γ α ) α n 1 − α n γ α { ( α n τ ) M 2 ( γ ¯ − γ α ) + 1 τ − γ α 〈 γ f ( z ) − A z , x n + 1 − z 〉 } = ( 1 − δ n ) ∥ x n − z ∥ 2 + δ n β n ,
(3.44)

where , δ n = 2 ( τ − γ α ) α n 1 − α n γ α and β n = ( α n τ ) M 2 ( τ − γ α ) + 1 τ − γ α 〈γf(z)−Az, x n + 1 −z〉. We put ξ n = δ n β n . It is easy to see that δ n →0, ∑ n = 1 ∞ δ n =∞ and lim sup n → ∞ ξ n δ n ≤0 by (3.42). Hence, by Lemma 2.3, the sequence { x n } converges strongly to z. This completes the proof. □

Theorem 3.2 Let H be a real Hilbert space, T 1 :C→H be a continuous pseudo-contractive mapping and T 2 :C→H be a continuous monotone mapping such that F:=F( T 1 )∩VI(C, T 2 )≠∅. Let 0<α<1 and let f be an α-contraction of H into itself, and let A be a γ ¯ -strongly monotone and L-Lipschitzian continuous operator of H into itself H with γ ¯ >0 and L>0. Take μ, γ to be real numbers as follows:

0<μ< 2 γ ¯ L 2 ,0<γ< γ ¯ − L 2 μ 2 α .

For y 1 ∈H, let { y n } be a sequence generated by (1.12), where { α n }⊂[0,1] and { r n }⊂(0,∞) are such that lim n → ∞ α n =0, ∑ n = 1 ∞ α n =∞, ∑ n = 1 ∞ | α n + 1 − α n |<∞, lim inf n → ∞ r n >0 and ∑ n = 1 ∞ | r n + 1 − r n |<∞. The sequence { y n } converges strongly to z∈F, where z= P F (I−A+γf)(z).

Proof Let { x n } be the sequence given by x 1 = y 1 and

x n + 1 = α n γf( x n )+(I− α n A) T r n F r n x n ,∀n≥1.

From Theorem 3.1, x n →z. We claim that y n →z. Indeed, we estimate

∥ x n + 1 − y n + 1 ∥ ≤ ∥ α n γ f ( x n ) − α n γ f ( T r n F r n y n ) ∥ + ∥ ( I − α n A ) T r n F r n x n − ( I − α n A ) T r n F r n y n ∥ ≤ α n γ α ∥ T r n F r n y n − x n ∥ + ( 1 − α n τ ) ∥ x n − y n ∥ ≤ α n γ α ∥ T r n F r n y n − T r n F r n z ∥ + α n γ α ∥ T r n F r n z − x n ∥ + ( 1 − α n τ ) ∥ x n − y n ∥ ≤ α n γ α ∥ y n − z ∥ + α n γ α ∥ z − x n ∥ + ( 1 − α n τ ) ∥ x n − y n ∥ ≤ α n γ α ∥ y n − x n ∥ + α n γ α ∥ x n − z ∥ + α n γ α ∥ z − x n ∥ + ( 1 − α n τ ) ∥ x n − y n ∥ = ( 1 − α n ( τ − γ α ) ) ∥ x n − y n ∥ + α n ( τ − γ α ) 2 γ α τ − γ α ∥ x n − z ∥ .
(3.45)

It follows from ∑ n = 1 ∞ α n =∞, lim n → ∞ ∥ x n −z∥=0 and Lemma 2.3 that ∥ x n − y n ∥→0.

Consequently, y n →z as required. □

Theorem 3.3 Let H be a real Hilbert space, T 1 :C→H be a continuous pseudo-contractive mapping and T 2 :C→H be a continuous monotone mapping such that F:=F( T 1 )∩VI(C, T 2 )≠∅. Let 0<α<1 and let f be an α-contraction of H into itself, and let A be a γ ¯ -strongly monotone and L-Lipschitzian continuous operator of H into itself H with γ ¯ >0 and L>0. Take μ, γ to be real numbers as follows:

0<μ< 2 γ ¯ L 2 ,0<γ< γ ¯ − L 2 μ 2 α .

For z 1 ∈H, let { z n } be a sequence generated by (1.13), where { α n }⊂[0,1] and { r n }⊂(0,∞) are such that lim n → ∞ α n =0, ∑ n = 1 ∞ α n =∞, ∑ n = 1 ∞ | α n + 1 − α n |<∞, lim inf n → ∞ r n >0 and ∑ n = 1 ∞ | r n + 1 − r n |<∞. The sequence { z n } converges strongly to z∈F, where z= P F (I−A+γf)(z).

Proof Define the sequences { y n } and { β n } by

y n = α n γf( z n )+(I− α n A) z n and β n = α n + 1 ,∀n≥1.

Taking p∈F, we have

∥ z n + 1 − p ∥ = ∥ T r n F r n y n − T r n F r n p ∥ ≤ ∥ y n − p ∥ = ∥ α n γ f ( z n ) + ( I − α n A ) z n − ( I − α n A ) p − α n A ( p ) ∥ ≤ ( 1 − α n τ ) ∥ z n − p ∥ + α n ∥ γ f ( z n ) − A ( p ) ∥ = ( 1 − α n τ ) ∥ z n − p ∥ + α n τ ∥ γ f ( z n ) − A ( p ) ∥ τ .
(3.46)

It follows from induction that

∥ z n + 1 −p∥≤max { ∥ z 1 − p ∥ , ∥ γ f ( z 1 ) − A ( p ) ∥ τ } ,n≥1.
(3.47)

Thus both { z n } and { y n } are bounded. We observe that

y n + 1 = α n + 1 γf( z n + 1 )+(I− α n + 1 A) z n + 1 = β n γf( T r n F r n y n )+(I− β n A) T r n F r n y n .

Thus Theorem 3.2 implies that { y n } converges to some point z. In this case, we also have

∥ z n −z∥≤∥ z n − y n ∥+∥ y n −z∥= α n ∥ γ f ( z n ) − A ( z n ) ∥ +∥ y n −z∥→0.

Hence the sequence { z n } converges to some point z. This completes the proof. □

Setting γ=1, A≡I, where I is the identity mapping in Theorem 3.1, we have the following result.

Corollary 3.4 Let H be a real Hilbert space, T 1 :C→C be a continuous pseudo-contractive mapping and T 2 :C→H be a continuous monotone mapping such that F:=F( T 1 )∩VI(C, T 2 )≠∅. Let f be a contraction of H into itself and let { x n } be a sequence generated by x 1 ∈H and

x n + 1 = α n f( x n )+(1− α n ) F r n T r n x n ,
(3.48)

where { α n }⊂[0,1] and { r n }⊂(0,∞) are such that lim n → ∞ α n =0, ∑ n = 0 ∞ α n =∞, ∑ n = 0 ∞ | α n + 1 − α n |<∞, lim inf n → ∞ r n >0 and ∑ n = 0 ∞ | r n + 1 − r n |<∞. The sequence { x n } converges strongly to z∈F, where z= P F f(z).

In Theorem 3.1, γ=1, A≡I, f:=u∈H is a constant mapping, then we get z= P F (u). In fact, we have the following corollary.

Corollary 3.5 Let H be a real Hilbert space, T 1 :C→C be a continuous pseudo-contractive mapping and T 2 :C→H be a continuous monotone mapping such that F:=F( T 1 )∩VI(C, T 2 )≠∅. Let { x n } be a sequence generated by x 1 ,u∈H and

x n + 1 = α n u+(1− α n ) F r n T r n x n ,
(3.49)

where { α n }⊂[0,1] and { r n }⊂(0,∞) are such that lim n → ∞ α n =0, ∑ n = 0 ∞ α n =∞, ∑ n = 0 ∞ | α n + 1 − α n |<∞, lim inf n → ∞ r n >0 and ∑ n = 0 ∞ | r n + 1 − r n |<∞. The sequence { x n } converges strongly to z∈F, where z= P F (u).

In Theorem 3.1, γ=1 and A, T 1 ≡I, where I is the identity mapping, then we have the following corollary.

Corollary 3.6 Let H be a real Hilbert space and T 2 :C→H be a continuous monotone mapping such that VI(C, T 2 )≠∅. Let f be a contraction of H into itself, and let { x n } be a sequence generated by x 1 ∈H and

x n + 1 = α n f( x n )+(1− α n ) T r n x n ,
(3.50)

where { α n }⊂[0,1] and { r n }⊂(0,∞) are such that lim n → ∞ α n =0, ∑ n = 0 ∞ α n =∞, ∑ n = 0 ∞ | α n + 1 − α n |<∞, lim inf n → ∞ r n >0 and ∑ n = 0 ∞ | r n + 1 − r n |<∞. The sequence { x n } converges strongly to z∈F( T 1 ), where z= P F ( T 1 ) (z).

Remark 3.7 Our results extend and unify most of the results that have been proved for these important classes of nonlinear operators. In particular, Theorem 3.1 extends Theorem 3.1 of Iiduka and Takahashi [12] and Zegeye et al. [25], Corollary 3.2 of Su et al. [29] in the sense that our convergence is for the more general class of continuous pseudo-contractive and continuous monotone mappings. Corollary 3.4 also extends Theorem 4.2 of Iiduka and Takahashi [12] in the sense that our convergence is for the more general class of continuous pseudo-contractive and continuous monotone mappings.

References

  1. Borwein FE: Nonlinear monotone operators and convex sets in Banach spaces. Bull. Am. Math. Soc. 1965, 71: 780–785. 10.1090/S0002-9904-1965-11391-X

    Article  Google Scholar 

  2. Bruck RE: On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space. J. Math. Anal. Appl. 1977, 61: 159–164. 10.1016/0022-247X(77)90152-4

    Article  MathSciNet  Google Scholar 

  3. Noor MA, Noor KI, Al-Said E: Iterative methods for solving general quasi-variational inequalities. Optim. Lett. 2010, 4: 513–530. 10.1007/s11590-010-0180-3

    Article  MathSciNet  Google Scholar 

  4. Takahashi W: Nonlinear complementarity problem and systems of convex inequalities. J. Optim. Theory Appl. 1978, 24: 493–508.

    Article  Google Scholar 

  5. Yao Y, Liou YC, Yao JC: An extragradient method for fixed point problems and variational inequality problems. J. Inequal. Appl. 2007. 10.1055/2007/38752

    Google Scholar 

  6. Yao Y, Liou YC, Yao JC: An iterative algorithm for approximating convex minimization problem. Appl. Math. Comput. 2007, 188: 648–656. 10.1016/j.amc.2006.10.039

    Article  MathSciNet  Google Scholar 

  7. Yao Y, Noor MA, Liou YC: Strong convergence of a modified extragradient method to the minimum-norm solution of variational inequalities. Abstr. Appl. Anal. 2012. 10.1155/2012/817436

    Google Scholar 

  8. Yao Y, Cho YJ, Chen R: An iterative algorithm for solving fixed point problems, variational inequality problems and mixed equilibrium problems. Nonlinear Anal. 2009, 71: 3363–3373. 10.1016/j.na.2009.01.236

    Article  MathSciNet  Google Scholar 

  9. 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

    Article  MathSciNet  Google Scholar 

  10. Borwein JM: Fifty years of maximal monotonicity. Optim. Lett. 2010, 4: 473–490. 10.1007/s11590-010-0178-x

    Article  MathSciNet  Google Scholar 

  11. Browder FE, Petryshyn WV: Construction of fixed points of nonlinear mappings in Hilbert spaces. J. Math. Anal. Appl. 1967, 20: 197–228. 10.1016/0022-247X(67)90085-6

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  13. Liu F, Nashed MZ: Regularization of nonlinear ill-posed variational inequalities and convergence rates. Set-Valued Anal. 1998, 6: 313–344. 10.1023/A:1008643727926

    Article  MathSciNet  Google Scholar 

  14. Nakajo K, Takahashi W: Strong and weak convergence theorems by an improved splitting method. Commun. Appl. Nonlinear Anal. 2002, 9: 99–107.

    MathSciNet  Google Scholar 

  15. Lin LJ, Takahashi W: A general iterative method for hierarchical variational inequality problems in Hilbert spaces and applications. Positivity 2012. 10.1007/s11117-012-0161-0

    Google Scholar 

  16. Halpern B: Fixed points of nonexpansive maps. Bull. Am. Math. Soc. 1967, 73: 957–961. 10.1090/S0002-9904-1967-11864-0

    Article  Google Scholar 

  17. Lions PL: Approximation de points fixes de contractions. C. R. Acad. Sci. Paris Sér. A-B 1977, 284: 1357–1359.

    Google Scholar 

  18. Wittmann R: Approximation of fixed points of nonexpansive mappings. Arch. Math. 1991, 58: 486–491.

    Article  MathSciNet  Google Scholar 

  19. Reich S: Strong convergence theorems for resolvents of accretive operators in Banach spaces. J. Math. Anal. Appl. 1980, 75: 287–292. 10.1016/0022-247X(80)90323-6

    Article  MathSciNet  Google Scholar 

  20. Shioji N, Takahashi W: Strong convergence of approximated sequences for nonexpansive mappings in Banach spaces. Proc. Am. Math. Soc. 2009, 70: 45–57.

    Google Scholar 

  21. Zegeye H, Shahzad N: Viscosity approximation methods for fixed-points problems. Appl. Math. Comput. 2007, 191: 155–163. 10.1016/j.amc.2007.02.072

    Article  MathSciNet  Google Scholar 

  22. Moudafi A: Viscosity approximation methods for fixed-points problems. J. Math. Anal. Appl. 2000, 241: 46–55. 10.1006/jmaa.1999.6615

    Article  MathSciNet  Google Scholar 

  23. Zegeye H, Shahzad N, Mekkonen T: Viscosity approximation methods for pseudocontractive mappings in Banach spaces. Appl. Math. Comput. 2007, 185: 538–546. 10.1016/j.amc.2006.07.063

    Article  MathSciNet  Google Scholar 

  24. Marino G, Xu HK: A general iterative method for nonexpansive mapping in Hilbert spaces. J. Math. Anal. Appl. 2006, 318: 43–52. 10.1016/j.jmaa.2005.05.028

    Article  MathSciNet  Google Scholar 

  25. Zegeye H, Shahzad N: Strong convergence of an iterative method for pseudo-contractive and monotone mappings. J. Glob. Optim. 2012, 54: 173–184. 10.10007/s10898-011-9755-5

    Article  MathSciNet  Google Scholar 

  26. Xu HK: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 2002, 66: 240–256. 10.1112/S0024610702003332

    Article  Google Scholar 

  27. Zegeye H: An iterative approximation methods for a common fixed point of two pseudo-contractive mappings. ISRN Math. Anal. 2011., 2011: Article ID 621901 10.5402/2011/621901

    Google Scholar 

  28. Takahashi W, Zembayashi K: Strong and weak convergence theorems for equilibriums problems and relatively nonexpansive mappings in Banach spaces. Nonlinear Anal. 2009, 70: 45–57. 10.1016/j.na.2007.11.031

    Article  MathSciNet  Google Scholar 

  29. Su Y, Shang M, Qin X: An iterative method of solution for equilibrium and optimization problems. Nonlinear Anal. 2008, 69: 2709–2719. 10.1016/j.na.2007.08.045

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors would like to thank Naresuan University and the university of Phayao. Moreover, the authors would like to thank the referees for reading this paper carefully, providing valuable suggestions and comments, and pointing out a major error in the original version of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kamonrat Nammanee.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally and significantly in writing this paper. All authors read and approved the final manuscript.

Rights and permissions

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

Reprints and permissions

About this article

Cite this article

Wangkeeree, R., Nammanee, K. New iterative methods for a common solution of fixed points for pseudo-contractive mappings and variational inequalities. Fixed Point Theory Appl 2013, 233 (2013). https://doi.org/10.1186/1687-1812-2013-233

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2013-233

Keywords