1 Introduction

Let H be a real Hilbert space with the inner product , and the norm , let C be a nonempty closed convex subset of H, and let P C be the metric projection of H onto C. Let S:CC be a self-mapping on C. We denote by Fix(S) the set of fixed points of S and by R the set of all real numbers. A mapping A:CH is called L-Lipschitz continuous if there exists a constant L0 such that

AxAyLxy,x,yC.

In particular, if L=1, then A is called a nonexpansive mapping [1]; if L[0,1), then A is called a contraction. Also, a mapping A:CH is called monotone if AxAy,xy0 for all x,yC. A is called η-strongly monotone if there exists a constant η>0 such that

AxAy,xyη x y 2 ,x,yC.

A is called α-inverse-strongly monotone if there exists a constant α>0 such that

AxAy,xyα A x A y 2 ,x,yC.

It is obvious that if A is α-inverse-strongly monotone, then A is monotone and 1 α -Lipschitz continuous.

For a given nonlinear operator A:CH, we consider the variational inequality problem (VIP) of finding x C such that

A x , x x 0,xC.
(1.1)

The solution set of VIP (1.1) is denoted by VI(C,A). VIP (1.1) was first discussed by Lions [2] and now has many applications in computational mathematics, mathematical physics, operations research, mathematical economics, optimization theory, and other fields; see, e.g., [36]. It is well known that if A is a strongly monotone and Lipschitz-continuous mapping on C, then VIP (1.1) has a unique solution.

In the literature, there is a growing interest in studying how to find a common solution of Fix(S)VI(C,A). Under various assumptions imposed on A and S, iterative algorithms were derived to yield iterates which converge strongly or weakly to a common solution of these two problems.

1.1 Finding a common element and weak convergence

Consider that a set CH is nonempty, closed and convex, a mapping S:CC is nonexpansive and a mapping A:CH is α-inverse-strongly monotone. Takahashi and Toyoda [7] introduced the Mann-type iterative scheme:

{ x 0 = x C chosen arbitrarily , x n + 1 = α n x n + ( 1 α n ) S P C ( x n λ n A x n ) , n 0 ,
(1.2)

where { α n } is a sequence in (0,1) and { λ n } is a sequence in (0,2α). They proved that if Fix(S)VI(C,A), then the sequence { x n } generated by (1.2) converges weakly to some zFix(S)VI(C,A).

Motivated by Korpelevich’s extragradient method [8], Nadezhkina and Takahashi [9] proposed an extragradient iterative method and showed the iterates converge weakly to a common element of Fix(S)VI(C,A):

{ x 0 = x C chosen arbitrarily , y n = P C ( x n λ n A x n ) , x n + 1 = α n x n + ( 1 α n ) S P C ( x n λ n A y n ) , n 0 ,

where A:CH is a monotone, L-Lipschitz continuous mapping and S:CC is a nonexpansive mapping and { λ n }[a,b] for some a,b(0,1/L) and { α n }[c,d] for some c,d(0,1). See also Zeng and Yao [10], in which a hybridized iterative method was proposed to yield a new weak convergence result.

1.2 Finding a common element and strong convergence

Let CH be a nonempty closed convex subset, let S:CC be a nonexpansive mapping, and let A:CH be an α-inverse strongly monotone mapping. Iiduka and Takahashi [11] introduced the following hybrid method:

{ x 0 = x C chosen arbitrarily , y n = α n x n + ( 1 α n ) S P C ( x n λ n A x n ) , C n = { z C : y n z x n z } , Q n = { z C : x n z , x x n 0 } , x n + 1 = P C n Q n x , n 0 ,

where 0 α n c<1 and 0<a λ n b<2α. They showed that if Fix(S)VI(C,A), then the sequence { x n }, generated by this iterative process, converges strongly to P Fix ( S ) VI ( C , A ) x. Recently, the method proposed by Nadezhkina and Takahashi [12] also demonstrated the strong convergence result. However, note that they assumed that A is monotone and L-Lipschitz-continuous while S is nonexpansive. For another strong convergence result, see Ceng and Yao [13] whose method is based on the extragradient method and the viscosity approximation method.

As we have seen, most of the papers were based on the different assumptions imposed on A while the mapping S is nonexpansive. In the following, we shall relax the nonexpansive requirement on S (for instance, κ-strictly pseudocontractive, asymptotically κ-strictly pseudocontractive mapping in the intermediate sense, etc.). Furthermore, we also consider adding a general system of variational inequalities to our settings.

1.3 Relaxation on nonexpansive S

Definition 1.1 Let C be a nonempty subset of a normed space X, and let S:CC be a self-mapping on C.

  1. (i)

    S is asymptotically nonexpansive (cf. [14]) if there exists a sequence { k n } of positive numbers satisfying the property lim n k n =1 and

    S n x S n y k n xy,n1,x,yC;
  2. (ii)

    S is asymptotically nonexpansive in the intermediate sense [15] provided S is uniformly continuous and

    lim sup n sup x , y C ( S n x S n y x y ) 0;
  3. (iii)

    S is uniformly Lipschitzian if there exists a constant L>0 such that

    S n x S n y Lxy,n1,x,yC.

It is clear that every nonexpansive mapping is asymptotically nonexpansive and every asymptotically nonexpansive mapping is uniformly Lipschitzian.

The class of asymptotically nonexpansive mappings was introduced by Goebel and Kirk [14] as an important generalization of the class of nonexpansive mappings. The existence of fixed points of asymptotically nonexpansive mappings was proved by Goebel and Kirk [14] as follows.

Theorem GK (see [[14], Theorem 1])

If C is a nonempty closed convex bounded subset of a uniformly convex Banach space, then every asymptotically nonexpansive mapping S:CC has a fixed point in C.

Let C be a nonempty closed convex bounded subset of a Hilbert space H. An iterative method for the approximation of fixed points of an asymptotically nonexpansive mapping with sequence { k n } was developed by Schu [16] via the following Mann-type iterative scheme:

x n + 1 =(1 α n ) x n + α n S n x n ,n1,
(1.3)

where δ α n 1δ (n1) for some δ>0. He proved the weak convergence of { x n } to a fixed point of S if n = 1 ( k n 1)<. Moreover, iterative methods for approximation of fixed points of asymptotically nonexpansive mappings have been further studied by other authors (see, e.g., [1618] and references therein).

The class of asymptotically nonexpansive mappings in the intermediate sense was introduced by Bruck et al. [15] and iterative methods for the approximation of fixed points of such types of non-Lipschitzian mappings were studied by Bruck et al. [15], Agarwal et al. [19], Chidume et al. [20], Kim and Kim [21] and many others.

Recently, Kim and Xu [22] introduced the concept of asymptotically κ-strictly pseudocontractive mappings in a Hilbert space as follows.

Definition 1.2 Let C be a nonempty subset of a Hilbert space H. A mapping S:CC is said to be an asymptotically κ-strictly pseudocontractive mapping with sequence { γ n } if there exists a constant κ[0,1) and a sequence { γ n } in [0,) with lim n γ n =0 such that

S n x S n y 2 (1+ γ n ) x y 2 +κ x S n x ( y S n y ) 2 ,n1,x,yC.
(1.4)

They studied weak and strong convergence theorems for this class of mappings. It is important to note that every asymptotically κ-strictly pseudocontractive mapping with sequence { γ n } is a uniformly ℒ-Lipschitzian mapping with L=sup{ κ + 1 + ( 1 κ ) γ n 1 + κ :n1}.

Very recently, Sahu et al. [23] considered the concept of asymptotically κ-strictly pseudocontractive mappings in the intermediate sense, which are not necessarily Lipschitzian.

Definition 1.3 Let C be a nonempty subset of a Hilbert space H. A mapping S:CC is said to be an asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n } if there exists a constant κ[0,1) and a sequence { γ n } in [0,) with lim n γ n =0 such that

lim sup n sup x , y C ( S n x S n y 2 ( 1 + γ n ) x y 2 κ x S n x ( y S n y ) 2 ) 0.
(1.5)

Put c n :=max{0, sup x , y C ( S n x S n y 2 (1+ γ n ) x y 2 κ x S n x ( y S n y ) 2 )}. Then c n 0 (n1), c n 0 (n) and (1.5) reduces to the relation

S n x S n y 2 (1+ γ n ) x y 2 +κ x S n x ( y S n y ) 2 + c n ,n1,x,yC.
(1.6)

Whenever c n =0 for all n1 in (1.6), then S is an asymptotically κ-strictly pseudocontractive mapping with sequence { γ n }.

For S to be a uniformly continuous asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n } such that Fix(S) is nonempty and bounded, Sahu et al. [23] proposed an iterative Mann-type CQ method in which the iterates converge strongly to a fixed point of S.

Theorem SXY (see [[23], Theorem 4.1])

Let C be a nonempty closed convex subset of a real Hilbert space H, and let S:CC be a uniformly continuous asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n } such that Fix(S) is nonempty and bounded. Let { α n } be a sequence in [0,1] such that 0<δ α n 1κ for all n1. Let { x n } be a sequence in C generated by the following (CQ) algorithm:

{ x 1 = x C chosen arbitrarily , y n = ( 1 α n ) x n + α n S n x n , C n = { z C : y n z 2 x n z 2 + θ n } , Q n = { z C : x n z , x x n 0 } , x n + 1 = P C n Q n x , n 1 ,
(1.7)

where θ n = c n + γ n Δ n and Δ n =sup{ x n z 2 :zFix(S)}<. Then { x n } converges strongly to P Fix ( S ) x.

1.4 Common solution of three problems

Let B 1 , B 2 :CH be two mappings. Recently, Ceng et al. [24] introduced and considered the problem of finding ( x , y )C×C such that

{ μ 1 B 1 y + x y , x x 0 , x C , μ 2 B 2 x + y x , x y 0 , x C ,
(1.8)

which is called a general system of variational inequalities (GSVI), where μ 1 >0 and μ 2 >0 are two constants. The set of solutions of GSVI (1.8) is denoted by GSVI(C, B 1 , B 2 ). In particular, if B 1 = B 2 , then GSVI (1.8) reduces to the new system of variational inequalities (NSVI), introduced and studied by Verma [25]. Further, if x = y additionally, then the NSVI reduces to VIP (1.1). Moreover, they transformed GSVI (1.8) into a fixed point problem in the following way.

Lemma CWY (see [24])

For given x ¯ , y ¯ C, ( x ¯ , y ¯ ) is a solution of GSVI (1.8) if and only if x ¯ is a fixed point of the mapping G:CC defined by

G(x)= P C [ P C ( x μ 2 B 2 x ) μ 1 B 1 P C ( x μ 2 B 2 x ) ] ,xC,

where x ¯ = P C ( x ¯ μ 2 B 2 x ¯ ).

In particular, if the mapping B i :CH is β i -inverse strongly monotone for i=1,2, then the mapping G is nonexpansive provided μ i (0,2 β i ) for i=1,2.

Utilizing Lemma CWY, they introduced and studied a relaxed extragradient method for solving GSVI (1.8). Throughout this paper, the set of fixed points of the mapping G is denoted by Ξ. Based on the relaxed extragradient method and the viscosity approximation method, Yao et al. [26] proposed and analyzed an iterative algorithm for finding a common solution of GSVI (1.8), and the fixed point problem of a κ-strictly pseudocontractive mapping S:CC (namely, there exists a constant κ[0,1) such that S x S y 2 x y 2 +κ ( I S ) x ( I S ) y 2 for all x,yC).

The main theme of this paper is to study the problem of finding a common element of the solution set of VIP (1.1), the solution set of GSVI (1.8) and the fixed point set of a self-mapping S:CC. Ceng et al. [27] analyzed this problem by assuming the mapping S to be strictly pseudocontractive as follows.

Theorem CGY (see [[27], Theorem 3.1])

Let C be a nonempty closed convex subset of a real Hilbert space H. Let A:CH be α-inverse strongly monotone and B i :CH be β i -inverse strongly monotone for i=1,2. Let S:CC be a κ-strictly pseudocontractive mapping such that Fix(S)ΞVI(C,A). Let f:CC be a ρ-contraction with ρ[0, 1 2 ). For given x 0 C arbitrarily, let the sequences { x n }, { y n } and { z n } be generated iteratively by

{ z n = P C ( x n λ n A x n ) , y n = α n f ( x n ) + ( 1 α n ) P C [ P C ( z n μ 2 B 2 z n ) μ 1 B 1 P C ( z n μ 2 B 2 z n ) ] , x n + 1 = β n x n + γ n y n + δ n S y n , n 0 ,
(1.9)

where μ i (0,2 β i ) for i=1,2, { λ n }(0,2α] and { α n },{ β n },{ γ n },{ δ n }[0,1] such that

  1. (i)

    β n + γ n + δ n =1 and ( γ n + δ n )k γ n for all n0;

  2. (ii)

    lim n α n =0 and n = 0 α n =;

  3. (iii)

    0< lim inf n β n lim sup n β n <1 and lim inf n δ n >0;

  4. (iv)

    lim n ( γ n + 1 1 β n + 1 γ n 1 β n )=0;

  5. (v)

    0< lim inf n λ n lim sup n λ n <2α and lim inf n | λ n + 1 λ n |=0.

Then the sequence { x n } generated by (1.9) converges strongly to x ¯ = P Fix ( S ) Ξ VI ( C , A ) Q x ¯ and ( x ¯ , y ¯ ) is a solution of GSVI (1.8), where y ¯ = P C ( x ¯ μ 2 B 2 x ¯ ).

In this paper, we study the problem of finding a common element of the solution set of VIP (1.1), the solution set of GSVI (1.8) and the fixed point set of a self-mapping S:CC, where the mapping S is assumed to be a uniformly continuous asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n } such that Fix(S)ΞVI(C,A) is nonempty and bounded. Not surprisingly, our main points of proof come from the ideas in [[23], Theorem 4.1] and [[27], Theorem 3.1]. Our major contribution ensures a strong convergence result to the extent of involving uniformly continuous asymptotically κ-strictly pseudocontractive mappings in the intermediate sense. Moreover, in Section 4 we extend Ceng, Hadjisavvas and Wong’s hybrid extragradient-like approximation method given in [[28], Theorem 5] to establish a new weak convergence theorem for finding a common solution of VIP (1.1), GSVI (1.8) and the fixed point problem of S.

2 Preliminaries

Let H be a real Hilbert space whose inner product and norm are denoted by , and , respectively. Let C be a nonempty closed convex subset of H. We write x n x to indicate that the sequence { x n } converges weakly to x and x n x to indicate that the sequence { x n } converges strongly to x. Moreover, we use ω w ( x n ) to denote the weak ω-limit set of the sequence { x n }, i.e.,

ω w ( x n ):= { x H : x n i x  for some subsequence  { x n i }  of  { x n } } .

The metric (or nearest point) projection from H onto C is the mapping P C :HC which assigns to each point xH the unique point P C xC satisfying the property

x P C x= inf y C xy=:d(x,C).

Some important properties of projections are gathered in the following proposition.

Proposition 2.1 For given xH and zC:

  1. (i)

    z= P C xxz,yz0, yC;

  2. (ii)

    z= P C x x z 2 x y 2 y z 2 , yC;

  3. (iii)

    P C x P C y,xy P C x P C y 2 , yH.

Consequently, P C is nonexpansive and monotone.

We need some facts and tools which are listed as lemmas below.

Lemma 2.1 (see [[29], demiclosedness principle])

Let C be a nonempty closed and convex subset of a Hilbert space H, and let S:CC be a nonexpansive mapping. Then the mapping IS is demiclosed on C. That is, whenever { x n } is a sequence in C such that x n xC and (IS) x n y, it follows that (IS)x=y. Here I is the identity operator of H.

Lemma 2.2 ([[19], Proposition 2.4])

Let { x n } be a bounded sequence on a reflexive Banach space X. If ω w ({ x n })={x}, then x n x.

Lemma 2.3 Let A:CH be a monotone mapping. In the context of the variational inequality problem, the characterization of the projection (see Proposition  2.1(i)) implies

uVI(C,A)u= P C (uλAu),λ>0.

Lemma 2.4 Let H be a real Hilbert space. Then the following hold:

  1. (a)

    x y 2 = x 2 y 2 2xy,y for all x,yH;

  2. (b)

    ( 1 t ) x + t y 2 =(1t) x 2 +t y 2 t(1t) x y 2 for all t[0,1] and for all x,yH;

  3. (c)

    If { x n } is a sequence in H such that x n x, it follows that

    lim sup n x n y 2 = lim sup n x n x 2 + x y 2 ,yH.

Lemma 2.5 ([[23], Lemma 2.5])

Let H be a real Hilbert space. Given a nonempty closed convex subset of H and points x,y,zH, and given also a real number aR, the set

{ v C : y v 2 x v 2 + z , v + a }

is convex (and closed).

Lemma 2.6 ([[23], Lemma 2.6])

Let C be a nonempty subset of a Hilbert space H, and let S:CC be an asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n }. Then

S n x S n y 1 1 κ ( κ x y + ( 1 + ( 1 κ ) γ n ) x y 2 + ( 1 κ ) c n )

for all x,yC and n1.

Lemma 2.7 ([[23], Lemma 2.7])

Let C be a nonempty subset of a Hilbert space H, and let S:CC be a uniformly continuous asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n }. Let { x n } be a sequence in C such that x n x n + 1 0 and x n S n x n 0 as n. Then x n S x n 0 as n.

Lemma 2.8 (Demiclosedness principle [[23], Proposition 3.1])

Let C be a nonempty closed convex subset of a Hilbert space H, and let S:CC be a continuous asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n }. Then IS is demiclosed at zero in the sense that if { x n } is a sequence in C such that x n xC and lim sup m lim sup n x n S m x n =0, then (IS)x=0.

Lemma 2.9 ([[23], Proposition 3.2])

Let C be a nonempty closed convex subset of a Hilbert space H, and let S:CC be a continuous asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n } such that Fix(S). Then Fix(S) is closed and convex.

Remark 2.1 Lemmas 2.8 and 2.9 give some basic properties of an asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n }. Moreover, Lemma 2.8 extends the demiclosedness principles studied for certain classes of nonlinear mappings in Kim and Xu [22], Gornicki [30], Marino and Xu [31] and Xu [32].

To prove a weak convergence theorem by the hybrid extragradient-like method for finding a common solution of VIP (1.1), GSVI (1.8) and the fixed point problem of an asymptotically κ-strictly pseudocontractive mapping in the intermediate sense, we need the following lemma by Osilike et al. [33].

Lemma 2.10 ([[33], p.80])

Let { a n } n = 1 , { b n } n = 1 and { δ n } n = 1 be sequences of nonnegative real numbers satisfying the inequality

a n + 1 (1+ δ n ) a n + b n ,n1.

If n = 1 δ n < and n = 1 b n <, then lim n a n exists. If, in addition, { a n } n = 1 has a subsequence which converges to zero, then lim n a n =0.

Corollary 2.1 ([[34], p.303])

Let { a n } n = 0 and { b n } n = 0 be two sequences of nonnegative real numbers satisfying the inequality

a n + 1 a n + b n ,n0.

If n = 0 b n converges, then lim n a n exists.

We need a technique lemma in the sequel, whose proof is an immediate consequence of Opial’s property [35] of a Hilbert space and is hence omitted.

Lemma 2.11 Let K be a nonempty closed and convex subset of a real Hilbert space H. Let { x n } n = 1 be a sequence in H satisfying the properties:

  1. (i)

    lim n x n x exists for each xK;

  2. (ii)

    ω w ( x n )K.

Then { x n } n = 1 is weakly convergent to a point in K.

A set-valued mapping T:H 2 H is called monotone if for all x,yH, fTx and gTy imply xy,fg0. A monotone mapping T:H 2 H is maximal if its graph Gph(T) is not properly contained in the graph of any other monotone mapping. It is known that a monotone mapping T is maximal if and only if for (x,f)H×H, xy,fg0 for all (y,g)Gph(T) implies fTx. Let A:CH be a monotone and Lipschitzian mapping, and let N C v be the normal cone to C at vC, i.e., N C v={wH:vu,w0,uC}. Define

Tv={ A v + N C v if  v C , if  v C .

It is known that in this case T is maximal monotone, and 0Tv if and only if vΩ; see [36].

3 Strong convergence theorem

In this section, we prove a strong convergence theorem for a hybrid viscosity CQ iterative algorithm for finding a common solution of VIP (1.1), GSVI (1.8) and the fixed point problem of a uniformly continuous asymptotically κ-strictly pseudocontractive mapping S:CC in the intermediate sense. This iterative algorithm is based on the extragradient method, the CQ method, the Mann-type iterative method and the viscosity approximation method.

Theorem 3.1 Let C be a nonempty closed convex subset of a real Hilbert space H. Let A:CH be α-inverse strongly monotone, and let B i :CH be β i -inverse strongly monotone for i=1,2. Let f:CC be a ρ-contraction with ρ[0,1), and let S:CC be a uniformly continuous asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n } such that Fix(S)ΞVI(C,A) is nonempty and bounded. Let { γ n } and { c n } be defined as in (1.6). Let { x n }, { y n } and { z n } be the sequences generated by

{ x 1 = x C chosen arbitrarily , y n = P C ( x n λ n A x n ) , t n = α n f ( x n ) + ( 1 α n ) P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] , z n = ( 1 μ n ν n ) x n + μ n t n + ν n S n t n , C n = { z C : z n z 2 x n z 2 + θ n } , Q n = { z C : x n z , x x n 0 } , x n + 1 = P C n Q n x , n 1 ,
(3.1)

where μ i (0,2 β i ) for i=1,2, θ n = c n +( α n + γ n ) Δ n ,

Δ n =sup { x n z 2 + 1 + γ n 1 ρ ( I f ) z 2 : z Fix ( S ) Ξ VI ( C , A ) } <,

{ λ n } is a sequence in (0,2α) and { α n }, { μ n }, { ν n } are three sequences in [0,1] such that μ n + ν n 1 for all n1. Assume that the following conditions hold:

  1. (i)

    lim n α n =0;

  2. (ii)

    { λ n }[a,b] for some a,b(0,2α);

  3. (iii)

    κ μ n for all n1;

  4. (iv)

    0<σ ν n for all n1.

Then the sequences { x n }, { y n } and { z n } converge strongly to P Fix ( S ) Ξ VI ( C , A ) x.

Proof It is obvious that C n is closed and Q n is closed and convex for every n=1,2, . As the defining inequality in C n is equivalent to the inequality

2 ( x n z n ) , z x n 2 z n 2 + θ n ,

by Lemma 2.5 we also have that C n is convex for every n=1,2, . As Q n ={zC: x n z,x x n 0}, we have x n z,x x n 0 for all z Q n and, by Proposition 2.1(i), we get x n = P Q n x.

Next, we divide the rest of the proof into several steps.

Step 1. Fix(S)ΞVI(C,A) C n Q n for all n1.

Indeed, take x Fix(S)ΞVI(C,A) arbitrarily. Then S x = x , x = P C ( x λ n A x ) and

x = P C [ P C ( x μ 2 B 2 x ) μ 1 B 1 P C ( x μ 2 B 2 x ) ] .
(3.2)

Since A:CH is α-inverse strongly monotone and 0< λ n 2α, we have, for all n1,

y n x 2 = P C ( x n λ n A x n ) P C ( x λ n A x ) 2 ( x n λ n A x n ) ( x λ n A x ) 2 = ( x n x ) λ n ( A x n A x ) 2 x n x 2 λ n ( 2 α λ n ) A x n A x 2 x n x 2 .
(3.3)

For simplicity, we write y = P C ( x μ 2 B 2 x ), u n = P C ( y n μ 2 B 2 y n ) and

v n := P C ( u n μ 1 B 1 u n )= P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ]

for all n1. Since B i :CH is β i -inverse strongly monotone and 0< μ i <2 β i for i=1,2, we know that for all n1,

v n x = P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] x 2 = P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] P C [ P C ( x μ 2 B 2 x ) μ 1 B 1 P C ( x μ 2 B 2 x ) ] 2 [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] [ P C ( x μ 2 B 2 x ) μ 1 B 1 P C ( x μ 2 B 2 x ) ] 2 = [ P C ( y n μ 2 B 2 y n ) P C ( x μ 2 B 2 x ) ] μ 1 [ B 1 P C ( y n μ 2 B 2 y n ) B 1 P C ( x μ 2 B 2 x ) ] 2 P C ( y n μ 2 B 2 y n ) P C ( x μ 2 B 2 x ) 2 μ 1 ( 2 β 1 μ 1 ) B 1 P C ( y n μ 2 B 2 y n ) B 1 P C ( x μ 2 B 2 x ) 2 ( y n μ 2 B 2 y n ) ( x μ 2 B 2 x ) 2 μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 = ( y n x ) μ 2 ( B 2 y n B 2 x ) 2 μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 y n x 2 μ 2 ( 2 β 2 μ 2 ) B 2 y n B 2 x 2 μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 x n x 2 λ n ( 2 α λ n ) A x n A x 2 μ 2 ( 2 β 2 μ 2 ) B 2 y n B 2 x 2 μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 x n x 2 .
(3.4)

Hence we get

t n x 2 = α n ( f ( x n ) x ) + ( 1 α n ) ( P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] x ) 2 [ α n f ( x n ) x + ( 1 α n ) P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] x ] 2 [ α n ( f ( x n ) f ( x ) + f ( x ) x ) + ( 1 α n ) x n x ] 2 [ α n ( ρ x n x + f ( x ) x ) + ( 1 α n ) x n x ] 2 = [ ( 1 ( 1 ρ ) α n ) x n x + ( 1 ρ ) α n f ( x ) x 1 ρ ] 2 ( 1 ( 1 ρ ) α n ) x n x 2 + α n f ( x ) x 2 1 ρ x n x 2 + α n f ( x ) x 2 1 ρ .
(3.5)

Therefore, from (3.5), z n =(1 μ n ν n ) x n + μ n t n + ν n S n t n , and x =S x , we have

z n x 2 = ( 1 μ n ν n ) x n + μ n t n + ν n S n t n x 2 = ( 1 μ n ν n ) ( x n x ) + μ n ( t n x ) + ν n ( S n t n x ) 2 ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) μ n μ n + ν n ( t n x ) + ν n μ n + ν n ( S n t n x ) 2 = ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { μ n μ n + ν n t n x 2 + ν n μ n + ν n S n t n x 2 μ n ν n ( μ n + ν n ) 2 t n S n t n 2 } ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { μ n μ n + ν n t n x 2 + ν n μ n + ν n [ ( 1 + γ n ) t n x 2 + κ t n S n t n 2 + c n ] μ n ν n ( μ n + ν n ) 2 t n S n t n 2 } ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { ( 1 + γ n ) t n x 2 + ν n μ n + ν n ( κ μ n μ n + ν n ) t n S n t n 2 + ν n c n μ n + ν n } ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { ( 1 + γ n ) t n x 2 + ν n c n μ n + ν n } ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { ( 1 + γ n ) [ x n x 2 + α n f ( x ) x 2 1 ρ ] + ν n c n μ n + ν n } x n x 2 + γ n x n x 2 + α n ( 1 + γ n ) f ( x ) x 2 1 ρ + c n x n x 2 + ( γ n + α n ) ( x n x 2 + 1 + γ n 1 ρ ( I f ) x 2 ) + c n x n x 2 + c n + ( α n + γ n ) Δ n
(3.6)

for every n=1,2, , and hence x C n . So, Fix(S)ΞVI(C,A) C n for every n=1,2, . Now, let us show by mathematical induction that { x n } is well defined and Fix(S)ΞVI(C,A) C n Q n for every n=1,2, . For n=1, we have Q 1 =C. Hence we obtain Fix(S)ΞVI(C,A) C 1 Q 1 . Suppose that x k is given and Fix(S)ΞVI(C,A) C k Q k for some integer k1. Since Fix(S)ΞVI(C,A) is nonempty, C k Q k is a nonempty closed convex subset of C. So, there exists a unique element x k + 1 C k Q k such that x k + 1 = P C k Q k x. It is also obvious that there holds x k + 1 z,x x k + 1 0 for every z C k Q k . Since Fix(S)ΞVI(C,A) C k Q k , we have x k + 1 z,x x k + 1 0 for every zFix(S)ΞVI(C,A), and hence Fix(S)ΞVI(C,A) Q k + 1 . Therefore, we obtain Fix(S)ΞVI(C,A) C k + 1 Q k + 1 .

Step 2. { x n } is bounded and lim n x n x n + 1 = lim n x n z n =0.

Indeed, let q= P Fix ( S ) Ξ VI ( C , A ) x. From x n + 1 = P C n Q n x and qFix(S)ΞVI(C,A) C n Q n , we have

x n + 1 xqx
(3.7)

for every n=1,2, . Therefore, { x n } is bounded. From (3.3)-(3.6) we also obtain that { u n }, { v n }, { y n }, { z n } and { t n } are bounded. Since x n + 1 C n Q n Q n and x n = P Q n x, we have

x n x x n + 1 x

for every n=1,2, . Therefore, there exists lim n x n x. Since x n = P Q n x and x n + 1 Q n , using Proposition 2.1(ii), we have

x n + 1 x n 2 x n + 1 x 2 x n x 2

for every n=1,2, . This implies that

lim n x n + 1 x n =0.

Since x n + 1 C n , we have

z n x n + 1 2 x n x n + 1 2 + θ n ,

which implies that

z n x n + 1 x n x n + 1 + θ n .

Hence we get

x n z n x n x n + 1 + x n + 1 z n 2 x n + 1 x n + θ n

for every n=1,2, . From x n + 1 x n 0 and θ n 0, we have x n z n 0.

Step 3. lim n A x n A x = lim n B 2 y n B 2 x = lim n B 1 u n B 1 y =0.

Indeed, from (3.1), (3.4) and (3.6) it follows that

z n x 2 ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { ( 1 + γ n ) t n x 2 + ν n c n μ n + ν n } ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { ( 1 + γ n ) [ α n f ( x n ) x 2 + ( 1 α n ) P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] x 2 ] + ν n c n μ n + ν n } ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { ( 1 + γ n ) [ α n f ( x n ) x 2 + P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] x 2 ] + ν n c n μ n + ν n } ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { ( 1 + γ n ) [ α n f ( x n ) x 2 + x n x 2 λ n ( 2 α λ n ) A x n A x 2 μ 2 ( 2 β 2 μ 2 ) B 2 y n B 2 x 2 μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 ] + ν n c n μ n + ν n } x n x 2 + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 ( μ n + ν n ) ( 1 + γ n ) [ λ n ( 2 α λ n ) A x n A x 2 + μ 2 ( 2 β 2 μ 2 ) B 2 y n B 2 x 2 + μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 ] ,
(3.8)

which hence implies that

( κ + σ ) ( 1 + γ n ) [ a ( 2 α b ) A x n A x 2 + μ 2 ( 2 β 2 μ 2 ) B 2 y n B 2 x 2 + μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 ] ( μ n + ν n ) ( 1 + γ n ) [ λ n ( 2 α λ n ) A x n A x 2 + μ 2 ( 2 β 2 μ 2 ) B 2 y n B 2 x 2 + μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 ] x n x 2 z n x 2 + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 ( x n x + z n x ) x n z n + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 .

Since α n 0, γ n 0, c n 0 and x n z n 0, from the boundedness of { x n } and { z n } we obtain that

lim n A x n A x = lim n B 2 y n B 2 x = lim n B 1 u n B 1 y =0.
(3.9)

Step 4. lim n x n y n =0.

Indeed, utilizing Proposition 2.1(iii), we deduce from (3.1) that

y n x 2 = P C ( x n λ n A x n ) P C ( x λ n A x ) 2 ( x n λ n A x n ) ( x λ n A x ) , y n x = 1 2 [ x n x λ n ( A x n A x ) 2 + y n x 2 ( x n x ) λ n ( A x n A x ) ( y n x ) 2 ] 1 2 [ x n x 2 + y n x 2 ( x n y n ) λ n ( A x n A x ) 2 ] = 1 2 [ x n x 2 + y n x 2 x n y n 2 + 2 λ n x n y n , A x n A x λ n 2 A x n A x 2 ] 1 2 [ x n x 2 + y n x 2 x n y n 2 + 2 λ n x n y n A x n A x ] .

Thus,

y n x 2 x n x 2 x n y n 2 +2 λ n x n y n A x n A x .
(3.10)

Similarly to the above argument, utilizing Proposition 2.1(iii), we conclude from u n = P C ( y n μ 2 B 2 y n ) that

u n y 2 = P C ( y n μ 2 B 2 y n ) P C ( x μ 2 B 2 x ) 2 ( y n μ 2 B 2 y n ) ( x μ 2 B 2 x ) , u n y = 1 2 [ y n x μ 2 ( B 2 y n B 2 x ) 2 + u n y 2 ( y n x ) μ 2 ( B 2 y n B 2 x ) ( u n y ) 2 ] 1 2 [ y n x 2 + u n y 2 ( y n u n ) μ 2 ( B 2 y n B 2 x ) ( x y ) 2 ] = 1 2 [ y n x 2 + u n y 2 y n u n ( x y ) 2 + 2 μ 2 y n u n ( x y ) , B 2 y n B 2 x μ 2 2 B 2 y n B 2 x 2 ] ,

that is,

u n y 2 y n x 2 y n u n ( x y ) 2 + 2 μ 2 y n u n ( x y ) B 2 y n B 2 x .
(3.11)

Substituting (3.10) in (3.11), we have

u n y 2 x n x 2 x n y n 2 + 2 λ n x n y n A x n A x y n u n ( x y ) 2 + 2 μ 2 y n u n ( x y ) B 2 y n B 2 x .
(3.12)

Similarly to the above argument, utilizing Proposition 2.1(iii), we conclude from v n = P C ( u n μ 1 B 1 u n ) that

v n x 2 = P C ( u n μ 1 B 1 u n ) P C ( y μ 1 B 1 y ) 2 ( u n μ 1 B 1 u n ) ( y μ 1 B 1 y ) , v n x = 1 2 [ u n y μ 1 ( B 1 u n B 1 y ) 2 + v n x 2 ( u n y ) μ 1 ( B 1 u n B 1 y ) ( v n x ) 2 ] 1 2 [ u n y 2 + v n x 2 ( u n v n ) μ 1 ( B 1 u n B 1 y ) ( y x ) 2 ] = 1 2 [ u n y 2 + v n x 2 u n v n ( y x ) 2 + 2 μ 1 u n v n ( y x ) , B 1 u n B 1 y μ 1 2 B 1 u n B 1 y 2 ] ,

that is,

v n x 2 u n y 2 u n v n ( y x ) 2 + 2 μ 1 u n v n ( y x ) B 1 u n B 1 y .
(3.13)

Substituting (3.12) in (3.13), we have

v n x 2 x n x 2 x n y n 2 + 2 λ n x n y n A x n A x y n u n ( x y ) 2 + 2 μ 2 y n u n ( x y ) B 2 y n B 2 x u n v n + ( x y ) 2 + 2 μ 1 u n v n + ( x y ) B 1 u n B 1 y .

This together with (3.4) and (3.8) implies that

z n x 2 ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { ( 1 + γ n ) [ α n f ( x n ) x 2 + P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] x 2 ] + ν n c n μ n + ν n } ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) { ( 1 + γ n ) [ α n f ( x n ) x 2 + x n x 2 x n y n 2 + 2 λ n x n y n A x n A x y n u n ( x y ) 2 + 2 μ 2 y n u n ( x y ) B 2 y n B 2 x u n v n + ( x y ) 2 + 2 μ 1 u n v n + ( x y ) B 1 u n B 1 y ] + ν n c n μ n + ν n } x n x 2 + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 + 2 ( 1 + γ n ) [ λ n x n y n A x n A x + μ 2 y n u n ( x y ) B 2 y n B 2 x + μ 1 u n v n + ( x y ) B 1 u n B 1 y ] ( μ n + ν n ) ( 1 + γ n ) [ x n y n 2 + y n u n ( x y ) 2 + u n v n + ( x y ) 2 ] .
(3.14)

So, we have

( κ + σ ) ( 1 + γ n ) [ x n y n 2 + y n u n ( x y ) 2 + u n v n + ( x y ) 2 ] ( μ n + ν n ) ( 1 + γ n ) [ x n y n 2 + y n u n ( x y ) 2 + u n v n + ( x y ) 2 ] x n x 2 z n x 2 + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 + 2 ( 1 + γ n ) [ λ n x n y n A x n A x + μ 2 y n u n ( x y ) B 2 y n B 2 x + μ 1 u n v n + ( x y ) B 1 u n B 1 y ] ( x n x + z n x ) x n z n + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 + 2 ( 1 + γ n ) [ λ n x n y n A x n A x + μ 2 y n u n ( x y ) B 2 y n B 2 x + μ 1 u n v n + ( x y ) B 1 u n B 1 y ] .

Since α n 0, γ n 0, c n 0, x n z n 0, A x n A x 0, B 2 y n B 2 x 0 and B 1 u n B 1 y 0, from the boundedness of { x n }, { y n } and { z n } we obtain that

lim n x n y n = lim n y n u n ( x y ) = lim n u n v n + ( x y ) =0,

and hence

lim n y n v n = lim n x n v n =0.
(3.15)

Step 5. lim n x n t n = lim n x n S x n =0.

Indeed, it follows from (3.1) that

t n y n α n f ( x n ) y n +(1 α n ) v n y n α n f ( x n ) y n + v n y n .

Since α n 0 and v n y n 0, from the boundedness of { x n } and { y n } we know that t n y n 0 as n. Also, from x n t n x n y n + y n t n we also have x n t n 0. Since z n =(1 μ n ν n ) x n + μ n t n + ν n S n t n , we have ν n ( S n t n t n )=(1 μ n ν n )( t n x n )+( z n t n ). Then

σ S n t n t n ν n S n t n t n ( 1 μ n ν n ) t n x n + z n t n ( 1 μ n ν n ) t n x n + z n x n + x n t n 2 t n x n + z n x n ,

and hence t n S n t n 0. Furthermore, observe that

x n S n x n x n t n + t n S n t n + S n t n S n x n .
(3.16)

Utilizing Lemma 2.6, we have

S n t n S n x n 1 1 κ ( κ t n x n + ( 1 + ( 1 κ ) γ n ) t n x n 2 + ( 1 κ ) c n )

for every n=1,2, . Hence it follows from x n t n 0 that S n t n S n x n 0. Thus from (3.16) and t n S n t n 0 we get x n S n x n 0. Since x n + 1 x n 0, x n S n x n 0 as n and S is uniformly continuous, we obtain from Lemma 2.7 that x n S x n 0 as n.

Step 6. ω w ({ x n })Fix(S)ΞVI(C,A).

Indeed, by the boundedness of { x n }, we know that ω w ({ x n }). Take x ˆ ω w ({ x n }) arbitrarily. Then there exists a subsequence { x n i } of { x n } such that { x n i } converges weakly to x ˆ . We can assert that x ˆ Fix(S)ΞVI(C,A). First, note that S is uniformly continuous and x n S x n 0. Hence it is easy to see that x n S m x n 0 for all m1. By Lemma 2.8, we obtain x ˆ Fix(S). Now let us show that x ˆ Ξ. We note that

t n G ( t n ) α n f ( x n ) G ( t n ) + ( 1 α n ) P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] G ( t n ) = α n f ( x n ) G ( t n ) + ( 1 α n ) G ( y n ) G ( t n ) α n f ( x n ) G ( t n ) + ( 1 α n ) y n t n 0 .
(3.17)

Since x n i x ˆ and x n t n 0, it follows that t n i x ˆ . Thus, according to Lemma 2.1 we get x ˆ Ξ. Furthermore, we show x ˆ VI(C,A). Since x n y n 0 and x n t n 0, we have y n i x ˆ and t n i x ˆ . Let

Tv={ A v + N C v if  v C , if  v C ,

where N C v is the normal cone to C at vC. We have already mentioned that in this case the mapping T is maximal monotone, and 0Tv if and only if vVI(C,A); see [36] for more details. Let Gph(T) be the graph of T, and let (v,w)Gph(T). Then we have wTv=Av+ N C v, and hence wAv N C v. So, we have vt,wAv0 for all tC. On the other hand, from y n = P C ( x n λ n A x n ) and vC we have

x n λ n A x n y n , y n v0,

and hence

v y n , y n x n λ n + A x n 0.

Therefore, from vt,wAv0 for all tC and y n i C, we have

v y n i , w v y n i , A v v y n i , A v v y n i , y n i x n i λ n i + A x n i = v y n i , A v A y n i + v y n i , A y n i A x n i v y n i , y n i x n i λ n i v y n i , A y n i A x n i v y n i , y n i x n i λ n i .

Thus, we obtain v x ˆ ,w0 as i. Since T is maximal monotone, we have x ˆ T 1 0 and hence x ˆ VI(C,A). Consequently, x ˆ Fix(S)ΞVI(C,A). This implies that ω w ({ x n })Fix(S)ΞVI(C,A).

Step 7. x n q= P Fix ( S ) Ξ VI ( C , A ) x.

Indeed, from q= P Fix ( S ) Ξ VI ( C , A ) x, x ˆ Fix(S)ΞVI(C,A) and (3.7), we have

qx x ˆ x lim inf i x n i x lim sup i x n i xqx.

So, we obtain

lim i x n i x= x ˆ x.

From x n i x x ˆ x we have x n i x x ˆ x due to the Kadec-Klee property of a real Hilbert space [29]. So, it is clear that x n i x ˆ . Since x n = P Q n x and qFix(S)ΞVI(C,A) C n Q n Q n , we have

q x n i 2 =q x n i , x n i x+q x n i ,xqq x n i ,xq.

As i, we obtain q x ˆ 2 q x ˆ ,xq0 by q= P Fix ( S ) Ξ VI ( C , A ) x and x ˆ Fix(S)ΞVI(C,A). Hence we have x ˆ =q. This implies that x n q. It is easy to see that y n q and z n q. This completes the proof. □

4 Weak convergence theorem

In this section, we prove a new weak convergence theorem by the hybrid extragradient-like method for finding a common element of the solution set of VIP (1.1), the solution set of GSVI (1.8) and the fixed point set of a uniformly continuous asymptotically κ-strictly pseudocontractive mapping S:CC in the intermediate sense.

Theorem 4.1 Let C be a nonempty closed convex subset of a real Hilbert space H. Let A:CH be α-inverse strongly monotone, let B i :CH be β i -inverse strongly monotone for i=1,2, let f:CC be a ρ-contraction with ρ[0,1), and let S:CC be a uniformly continuous asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n } such that Fix(S)ΞVI(C,A) is nonempty and bounded. Let { γ n } and { c n } be defined as in (1.6). Let { x n } and { y n } be the sequences generated by

{ x 1 = x C chosen arbitrarily , y n = P C ( x n λ n A x n ) , t n = α n f ( x n ) + ( 1 α n ) P C [ P C ( y n μ 2 B 2 y n ) μ 1 B 1 P C ( y n μ 2 B 2 y n ) ] , x n + 1 = ( 1 μ n ν n ) x n + μ n t n + ν n S n t n ,
(4.1)

where μ i (0,2 β i ) for i=1,2, { λ n } is a sequence in (0,2α) and { α n }, { μ n }, { ν n } are three sequences in [0,1] such that μ n + ν n 1 for all n1. Assume that the following conditions hold:

  1. (i)

    n = 1 α n <;

  2. (ii)

    { λ n }[a,b] for some a,b(0,2α);

  3. (iii)

    n = 1 c n < and n = 1 γ n <;

  4. (iv)

    and for all n1, κ μ n , σ ν n and μ n + ν n c for some c,σ(0,1).

Then the sequences { x n } and { y n } converge weakly to an element of Fix(S)ΞVI(C,A).

Proof First of all, take x Fix(S)ΞVI(C,A) arbitrarily. Then, repeating the same arguments as in (3.3) and (3.5), we deduce from (4.1) that

y n x x n x ,
(4.2)

and

t n x 2 x n x 2 + α n f ( x ) x 2 1 ρ .
(4.3)

Repeating the same arguments as in (3.6), we can obtain that

x n + 1 x 2 x n x 2 + γ n x n x 2 + α n ( 1 + γ n ) f ( x ) x 2 1 ρ + c n = ( 1 + γ n ) x n x 2 + α n ( 1 + γ n ) f ( x ) x 2 1 ρ + c n .
(4.4)

Since n = 1 α n <, n = 1 c n < and n = 1 γ n < it follows that

n = 1 { α n ( 1 + γ n ) f ( x ) x 2 1 ρ + c n } <.

So, by Lemma 2.10 we know that

lim n x n x exists for all  x Fix(S)ΞVI(C,A).

This implies that { x n } is bounded and hence { t n }, { y n } are bounded due to (4.2) and (4.3).

Repeating the same arguments as in (3.8), we can conclude that

x n + 1 x 2 x n x 2 + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 ( μ n + ν n ) ( 1 + γ n ) [ λ n ( 2 α λ n ) A x n A x 2 + μ 2 ( 2 β 2 μ 2 ) B 2 y n B 2 x 2 + μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 ] ,
(4.5)

which hence implies that

( κ + σ ) ( 1 + γ n ) [ a ( 2 α b ) A x n A x 2 + μ 2 ( 2 β 2 μ 2 ) B 2 y n B 2 x 2 + μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 ] ( μ n + ν n ) ( 1 + γ n ) [ λ n ( 2 α λ n ) A x n A x 2 + μ 2 ( 2 β 2 μ 2 ) B 2 y n B 2 x 2 + μ 1 ( 2 β 1 μ 1 ) B 1 u n B 1 y 2 ] x n x 2 x n + 1 x 2 + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 .

Since α n 0, γ n 0, c n 0 and lim n x n x exists, from the boundedness of { x n } we conclude that

lim n A x n A x = lim n B 2 y n B 2 x = lim n B 1 u n B 1 y =0.
(4.6)

Repeating the same arguments as in (3.14), we can conclude that

x n + 1 x 2 x n x 2 + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 + 2 ( 1 + γ n ) [ λ n x n y n A x n A x + μ 2 y n u n ( x y ) B 2 y n B 2 x + μ 1 u n v n + ( x y ) B 1 u n B 1 y ] ( μ n + ν n ) ( 1 + γ n ) [ x n y n 2 + y n u n ( x y ) 2 + u n v n + ( x y ) 2 ] ,

which hence implies that

( κ + σ ) ( 1 + γ n ) [ x n y n 2 + y n u n ( x y ) 2 + u n v n + ( x y ) 2 ] ( μ n + ν n ) ( 1 + γ n ) [ x n y n 2 + y n u n ( x y ) 2 + u n v n + ( x y ) 2 ] x n x 2 x n + 1 x 2 + γ n x n x 2 + c n + α n ( 1 + γ n ) f ( x n ) x 2 + 2 ( 1 + γ n ) [ λ n x n y n A x n A x + μ 2 y n u n ( x y ) B 2 y n B 2 x + μ 1 u n v n + ( x y ) B 1 u n B 1 y ] .

Since α n 0, γ n 0, c n 0, A x n A x 0, B 2 y n B 2 x 0, B 1 u n B 1 y 0 and lim n x n x exists, from the boundedness of { x n } and { y n } we obtain that

lim n x n y n = lim n y n u n ( x y ) = lim n u n v n + ( x y ) =0,

and hence

lim n y n v n = lim n x n v n =0.
(4.7)

On the other hand, it follows from (4.1) that

t n y n α n f ( x n ) y n +(1 α n ) v n y n α n f ( x n ) y n + v n y n .

Since α n 0 and v n y n 0, from the boundedness of { x n } and { y n } we know that t n y n 0 as n. Also, from x n t n x n y n + y n t n we also have x n t n 0. Repeating the same arguments as in (3.6), we have

x n + 1 x 2 = ( 1 μ n ν n ) ( x n x ) + μ n ( t n x ) + ν n ( S n t n x ) 2 = ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) μ n μ n + ν n ( t n x ) + ν n μ n + ν n ( S n t n x ) 2 ( 1 μ n ν n ) ( μ n + ν n ) μ n μ n + ν n ( t n x n ) + ν n μ n + ν n ( S n t n x n ) 2 = ( 1 μ n ν n ) x n x 2 + ( μ n + ν n ) μ n μ n + ν n ( t n x ) + ν n μ n + ν n ( S n t n x ) 2 ( 1 μ n ν n ) ( μ n + ν n ) 1 μ n + ν n ( x n + 1 x n ) 2 x n x 2 + γ n x n x 2 + α n ( 1 + γ n ) f ( x ) x 2 1 ρ + c n ( 1 μ n ν n ) μ n + ν n x n + 1 x n 2 ,

which hence implies that

( 1 c ) c x n + 1 x n 2 ( 1 μ n ν n ) μ n + ν n x n + 1 x n 2 x n x 2 x n + 1 x 2 + γ n x n x 2 + α n ( 1 + γ n ) f ( x ) x 2 1 ρ + c n .

Since lim n x n x exists, α n 0, γ n 0, c n 0 and the sequence { x n } is bounded, we obtain that

lim n x n + 1 x n =0.

Also, since x n + 1 =(1 μ n ν n ) x n + μ n t n + ν n S n t n , we have ν n ( S n t n t n )=(1 μ n ν n )( t n x n )+( x n + 1 t n ). Then

σ S n t n t n ν n S n t n t n ( 1 μ n ν n ) t n x n + x n + 1 t n ( 1 μ n ν n ) t n x n + x n + 1 x n + x n t n 2 t n x n + x n + 1 x n ,

and hence t n S n t n 0. Furthermore, observe that

x n S n x n x n t n + t n S n t n + S n t n S n x n .
(4.8)

Utilizing Lemma 2.6, we have

S n t n S n x n 1 1 κ ( κ t n x n + ( 1 + ( 1 κ ) γ n ) t n x n 2 + ( 1 κ ) c n )

for every n=1,2, . Hence it follows from x n t n 0 that S n t n S n x n 0. Thus from (4.8) and t n S n t n 0 we get x n S n x n 0. Since x n + 1 x n 0, x n S n x n 0 as n and S is uniformly continuous, we obtain from Lemma 2.7 that x n S x n 0 as n.

Further, repeating the same arguments as in the proof of Theorem 3.1, we can derive that ω w ({ x n })Fix(S)ΞVI(C,A). Utilizing Lemma 2.11, from the existence of lim n x n x for each x Fix(S)ΞVI(C,A), we infer that { x n } converges weakly to an element x ˆ Fix(S)ΞVI(C,A). Since x n y n 0 as n, it is clear that { y n } converges weakly to x ˆ Fix(S)ΞVI(C,A). □

In the following, we present a numerical example to illustrate how Theorem 4.1 works.

Example 4.1 Let H= R 2 with the inner product , and the norm which are defined by

x,y=ac+bdandx= a 2 + b 2

for all x,y R 2 with x=(a,b) and y=(c,d). Let C={(a,a):aR}. Clearly, C is a nonempty closed convex subset of a real Hilbert space H= R 2 . Let A:CH be α-inverse strongly monotone, let B i :CH be β i -inverse strongly monotone for i=1,2, let f:CC be a ρ-contraction with ρ[0,1), and let S:CC be a uniformly continuous asymptotically κ-strictly pseudocontractive mapping in the intermediate sense with sequence { γ n } such that Fix(S)ΞVI(C,A) is nonempty bounded; for instance, putting A= [ 3 5 2 5 2 5 3 5 ] , S= [ 2 3 1 3 1 3 2 3 ] , B 1 =IA= [ 2 5 2 5 2 5 2 5 ] , B 2 =IS= [ 1 3 1 3 1 3 1 3 ] and f= 1 2 S= [ 2 6 1 6 1 6 2 6 ] . It is easy to see that A=S=1, f= 1 2 S= 1 2 , and that A is α-inverse strongly monotone with α= 1 2 , that B 1 and B 2 are 1 2 -inverse strongly monotone, f is a 1 2 -contraction, S is a nonexpansive mapping, i.e., a uniformly continuous asymptotically 0-strictly pseudocontractive mapping in the intermediate sense with sequences { γ n } ( γ n 0) and { c n } ( c n 0). Moreover, it is clear that Fix(S)=C, VI(C,A)={0} and Ξ=C. Hence, Fix(S)ΞVI(C,A)={0}. In this case, from iterative scheme (4.1) in Theorem 4.1, we obtain that for any given x 1 C,

{ y n = P C ( x n λ n A x n ) = ( 1 λ n ) x n , t n = α n f ( x n ) + ( 1 α n ) P C ( I μ 1 B 1 ) P C ( I μ 2 B 2 ) y n t n = 1 2 α n S x n + ( 1 α n ) P C ( I μ 1 B 1 ) P C ( I μ 2 B 2 ) ( 1 λ n ) x n t n = 1 2 α n x n + ( 1 α n ) P C ( I μ 1 B 1 ) ( 1 λ n ) x n t n = 1 2 α n x n + ( 1 α n ) ( 1 λ n ) x n t n = [ 1 2 α n + ( 1 α n ) ( 1 λ n ) ] x n , x n + 1 = ( 1 μ n ν n ) x n + μ n t n + ν n S n t n x n + 1 = ( 1 μ n ν n ) x n + μ n [ 1 2 α n + ( 1 α n ) ( 1 λ n ) ] x n x n + 1 = + ν n S n [ 1 2 α n + ( 1 α n ) ( 1 λ n ) ] x n x n + 1 = { ( 1 μ n ν n ) + ( μ n + ν n ) [ 1 2 α n + ( 1 α n ) ( 1 λ n ) ] } x n x n + 1 = [ 1 ( μ n + ν n ) ( 1 2 α n + λ n ( 1 α n ) ) ] x n .

Whenever n = 1 α n <, { λ n }[a,b](0,1), and { μ n + ν n }[σ,c](0,1), we have

x n + 1 = [ 1 ( μ n + ν n ) ( 1 2 α n + λ n ( 1 α n ) ) ] x n [ 1 ( μ n + ν n ) ( 1 2 λ n α n + λ n ( 1 α n ) ) ] x n = [ 1 ( μ n + ν n ) λ n ( 1 1 2 α n ) ] x n [ 1 σ a ( 1 1 2 α n ) ] x n x n exp { σ a ( 1 1 2 α n ) } x n exp { n σ a + 1 2 σ a i = 1 n α i } 0 as  n .

This shows that { x n } converges to the unique element 0 of Fix(S)ΞVI(C,A). Note that as n,

x n y n = λ n x n x n 0.

Hence, { y n } also converges to the unique element 0 of Fix(S)ΞVI(C,A).