1 Introduction and formulations

Let H be a real Hilbert space whose inner product and norm are denoted by , and , respectively. Let C be a nonempty, closed and convex subset of H and A:CH be a nonlinear mapping. The variational inequality problem (VIP) associated with the set C and the mapping A is stated as follows:

find  x C such that  A x , x x 0,xC.
(1.1)

In particular, if C is the set of fixed points of a nonexpansive mapping T, denoted by Fix(T), and if S is another nonexpansive mapping (not necessarily with fixed points), then VIP (1.1) becomes the following problem:

find  x Fix(T) such that  ( I S ) x , x x 0,xFix(T).
(1.2)

It is called a hierarchical variational inequality problem, also known as a hierarchical fixed point problem, and it is studied in [1, 2]. Observe that if S has fixed points, then they are the solutions of VIP (1.2). It is worth mentioning that many practical problems can be written in the form of a hierarchical variational inequality problem; see for example [35] and the references therein. Such a problem is also a bilevel problem, in which we find a solution of the first problem subject to the condition that its solution is also a fixed point of a mapping. For further details on hierarchical fixed point problems and their applications, we refer to [13, 618] and the references therein. The solution methods presented in [1, 12] may not be unique. Therefore, it would be reasonable to identify the unique minimizer of an appropriate objective function over the hierarchical fixed point constraint.

Mainge and Moudafi [2] introduced a hierarchical fixed point approach to finding a solution of VIP (1.2). Subsequently, Moudafi and Mainge [1] studied the explicit scheme for computing a solution of VIP (1.2) by introducing the following iterative algorithm:

x n + 1 = λ n f( x n )+(1 λ n ) ( α n S x n + ( 1 α n ) T x n ) ,
(1.3)

where f:CC and { α n }, { λ n }(0,1). They also proved the strong convergence of the sequence { x n } generalized by (1.3) to a solution of VIP (1.2).

Yao et al. [19] introduced and analyzed the following two-step iterative algorithm that generates a sequence { x n } by the following explicit scheme:

{ y n = β n S x n + ( 1 β n ) x n , x n + 1 = α n f ( x n ) + ( 1 α n ) T y n , n 1 .
(1.4)

It is easy to see that if C=Fix(T) and Θ(x,y)=(IS)x,yx, VIP (1.2) can be reformulated as follows:

find  x C such that Θ ( x , y ) 0,yC.
(1.5)

It is known as an equilibrium problem. In [20, 21], it is shown that the formulation (1.5) covers monotone inclusion problems, saddle point problems, variational inequality problems, minimization problems, Nash equilibria in noncooperative games, vector equilibrium problems and certain fixed point problems.

Recently, many authors have generalized the classical equilibrium problem introduced in [22] by introducing ‘perturbation’ to the function Θ. For example, Moudafi [23] studied the following equilibrium problem:

find  x C such that Θ ( x , y ) + A x , y x 0,yC,

where A is an α-inverse strongly monotone operator. In [2426], the following mixed equilibrium problem is studied:

find  x C such that Θ ( x , y ) +φ ( x ) φ(y)0,yC,

where φ:CR is a functional on C. Very recently, Marino et al. [27] studied the following equilibrium problem:

find  x C such that Θ ( x , y ) +h ( x , y ) 0,yC.
(1.6)

It includes all previous equilibrium problems as special cases. The set of solutions of (1.6) is denoted by EP(Θ,h).

Lemma 1.1 ([[27], Lemma 2.2])

Let C be a nonempty, closed and convex subset of a Hilbert space H. Let Θ:C×CR be a bifunction such that

(Θ 1) Θ(x,x)=0, xC;

(Θ 2) Θ is monotone (that is, Θ(x,y)+Θ(y,x)0, (x,y)C×C) and upper hemicontinuous in the first variable (that is, lim sup t 0 Θ(tz+(1t)x,y)Θ(x,y), x,y,zC);

(Θ 3) Θ is lower semicontinuous and convex in the second variable.

Let h:C×CR be a bifunction such that

(h 1) h(x,x)=0, xC;

(h 2) h is monotone and weakly upper semicontinuous in the first variable;

(h 3) h is convex in the second variable.

Moreover, suppose that

(H) for fixed r>0 and xC, there exists a bounded KC and aK such that for all zCK, Θ(a,z)+h(z,a)+ 1 r az,zx<0.

For r>0 and xH, let T r :H 2 C be a mapping defined by

T r x= { z C : Θ ( z , y ) + h ( z , y ) + 1 r y z , z x 0 , y C }
(1.7)

(is called the resolvent of Θ and h). Then

  1. (i)

    T r x;

  2. (ii)

    T r x is a singleton;

  3. (iii)

    T r is firmly nonexpansive;

  4. (iv)

    EP(Θ,h)=Fix( T r ) and it is closed and convex;

  5. (v)

    (see [28])

    T r 2 y T r 1 xyx+ | r 2 r 1 r 2 | T r 2 yy,x,yH, r 1 , r 2 >0.
    (1.8)

Marino et al. [27] introduced a multi-step iterative method that generalizes the two-step method studied in [19] from two nonexpansive mappings to a finite family of nonexpansive mappings, and proved that the sequence generated by this method converges strongly to a common fixed point of the mappings which is also a solution of the equilibrium problem (1.6). The multi-step iterative method in [27] involves the Ishikawa-type iterative method and the viscosity approximation method.

On the other hand, by combining the regularization method, the hybrid steepest-descent method, and the projection method, Ceng et al. [29] proposed an iterative algorithm that generates a sequence via the explicit scheme and proved that this sequence converges strongly to a unique solution of the following problem.

Problem 1.1 Let F:CH be κ-Lipschitzian and η-strongly monotone on the nonempty, closed and convex subset C of H, where κ and η are positive constants, that is,

FxFyκxyandFxFy,xyη x y 2 ,x,yC.
(1.9)

Let f:CH be a ρ-contraction with a coefficient ρ[0,1), and S,T:CC be two nonexpansive mappings with Fix(T). Let 0<μ<2η/ κ 2 and 0<γτ, where τ=1 1 μ ( 2 η μ κ 2 ) . Then the objective is to find x Ξ such that

( μ F γ f ) x , x x 0,xΞ,
(1.10)

where Ξ denotes the solution set of the following hierarchical variational inequality problem (HVIP): find z Fix(T) such that

( μ F γ S ) z , z z 0,zFix(T).
(1.11)

Since Problem 1.1 has a triple hierarchical structure in contrast with bilevel programming problems (see [30, 31]), that is, a variational inequality problem with a variational inequality constraint over the fixed point set Fix(T), we also call it a triple hierarchical variational inequality problem, which is a generalization of the triple hierarchical constrained optimization problem (THCOP) considered by Iiduka [32, 33].

In this paper, we consider the following system of variational inequalities defined over the set consisting of the set of solutions of an equilibrium problem, the set of common fixed points of nonexpansive mappings, and the set of fixed points of a mapping.

Problem 1.2 Let F:CH be κ-Lipschitzian and η-strongly monotone on the nonempty, closed and convex subset C of H, f:CH be a ρ-contraction with a coefficient ρ[0,1) and S i ,S,T:CC be nonexpansive mappings for all i{1,,N}. Assume that Θ,h:C×CR are two bifunctions. Let 0<μ<2η/ κ 2 and 0<γτ, where τ=1 1 μ ( 2 η μ κ 2 ) . Then the objective is to find x Ω such that

{ ( μ F γ f ) x , x x 0 , x Ω , ( μ F γ S ) x , y x 0 , y Ω ,
(1.12)

where Ω=Fix(T)( i Fix( S i ))EP(Θ,h).

We propose the following multi-step hybrid viscosity method for solving Problem 1.2.

Algorithm 1.1 Let F:CH be κ-Lipschitzian and η-strongly monotone on the nonempty, closed and convex subset C of H, f:CH be a ρ-contraction with a coefficient ρ[0,1) and S i ,S,T:CC be nonexpansive mappings for all i{1,,N}. Assume that Θ,h:C×CR are two bifunctions satisfying the hypotheses of Lemma 1.1. Let { λ n }, { α n }, { β n , i }, i=1,,N be sequences in (0,1) and { r n } be a sequence in (0,) with lim inf n r n >0. Let 0<μ<2η/ κ 2 and 0<γτ, where τ=1 1 μ ( 2 η μ κ 2 ) . Then the sequence { x n } is generated from an arbitrary initial point x 1 C by the following iterative scheme:

{ Θ ( u n , y ) + h ( u n , y ) + 1 r n y u n , u n x n 0 , y C , y n , 1 = β n , 1 S 1 u n + ( 1 β n , 1 ) u n , y n , i = β n , i S i u n + ( 1 β n , i ) y n , i 1 , i = 2 , , N , x n + 1 = P C [ λ n γ ( α n f ( x n ) + ( 1 α n ) S x n ) + ( I λ n μ F ) T y n , N ] , n 1 .
(1.13)

In particular, if f0, then (1.13) reduces to the following iterative scheme:

{ Θ ( u n , y ) + h ( u n , y ) + 1 r n y u n , u n x n 0 , y C , y n , 1 = β n , 1 S 1 u n + ( 1 β n , 1 ) u n , y n , i = β n , i S i u n + ( 1 β n , i ) y n , i 1 , i = 2 , , N , x n + 1 = P C [ λ n ( 1 α n ) γ S x n + ( I λ n μ F ) T y n , N ] , n 1 .
(1.14)

We prove that, under appropriate conditions, the sequence { x n } generated by Algorithm 1.1 converges strongly to a unique solution of Problem 1.2. In addition, we also consider and study the application of Algorithm 1.1 to solve the following triple hierarchical variational inequality problem (THVIP):

Problem 1.3 Let F:CH be κ-Lipschitzian and η-strongly monotone on the nonempty, closed and convex subset C of H, f:CH be a ρ-contraction with a coefficient ρ[0,1) and S i ,S,T:CC be nonexpansive mappings for all i{1,,N}. Assume that Θ,h:C×CR are two bifunctions. Let 0<μ<2η/ κ 2 and 0<γτ, where τ=1 1 μ ( 2 η μ κ 2 ) . Then the objective is to find x Ξ such that

( μ F γ f ) x , x x 0,xΞ,
(1.15)

where Ξ denotes the solution set of the following hierarchical variational inequality problem (HVIP) of finding z Ω such that

( μ F γ S ) z , z z 0,zΩ,
(1.16)

where Ω=Fix(T)( i Fix( S i ))EP(Θ,h).

Moreover, we prove that, under very mild conditions, the sequence { x n } generated by Algorithm 1.1 converges strongly to a unique solution of Problem 1.3. It is worth pointing out that Problem 1.1 is a special case of Problem 1.3 whenever Θh0 and S i I for all i{1,,N}.

2 Some basic results

We present here some basic facts and results that are needed in the sequel.

Lemma 2.1 ([[34], Lemma 2.1])

Let { s n } be a sequence of nonnegative numbers satisfying the condition

s n + 1 (1 γ n ) s n + γ n δ n ,n1,

where { γ n }, { δ n } are the sequences of real numbers such that

  1. (i)

    { γ n }[0,1] and n = 1 γ n =, or equivalently,

    n = 1 (1 γ n ):= lim n k = 1 n (1 γ k )=0;
  2. (ii)

    lim sup n δ n 0, or

(ii)′ n = 1 γ n δ n is convergent.

Then lim n s n =0.

Lemma 2.2 ([[34], Lemma 3.1])

Let λ be a number in (0,1], and let μ>0. Let F:CH be an operator on C such that for some constants κ,η>0, F is κ-Lipschitzian and η-strongly monotone. Associating with a nonexpansive mapping T:CC, we define the mapping T λ :CH by

T λ x:=TxλμF(Tx),xC.

Then T λ is a contraction provided μ<2η/ κ 2 , that is,

T λ x T λ y (1λτ)xy,x,yC,

where τ=1 1 μ ( 2 η μ κ 2 ) (0,1].

In the sequel, given a sequence { z n }, we will denote with ω w ( z n ) the set of cluster points of { z n } with respect to the weak topology, that is,

ω w ( z n )={zH:there exists  n k  for which  z n k z}.

Analogously, we denote by ω s ( z n ) the set of cluster points of { z n } with respect to the norm topology, that is,

ω s ( z n )={zH:there exists  n k  for which  z n k z}.

Lemma 2.3 ([[27], Lemma 2.5])

Suppose that the hypotheses of Lemma  1.1 are satisfied. Let { r n } be a sequence in (0,) with lim inf n r n >0. Suppose that { x n } is a bounded sequence. Then the following equivalent statements hold:

  1. (a)

    If x n T r n x n 0, as n, every weak cluster point of { x n } solves the problem

    Θ(x,y)+h(x,y)0,yC,

that is, ω w ( x n )EP(Θ,h).

  1. (b)

    (Demiclosedness principle) If x n x and x n T r n x n 0, as n, then (I T r k ) x =0 for all k1.

Lemma 2.4 ([35])

Let { α n } be a sequence of nonnegative real numbers with lim sup n α n < and { β n } be a sequence of real numbers with lim sup n β n 0. Then lim sup n α n β n 0.

3 Main results

Now we present the convergence analysis of Algorithm 1.1 for solving Problem 1.2.

Theorem 3.1 Assume that Problem 1.2 has a solution. Let { λ n }, { α n }, { β n , i }, i=1,,N be sequences in (0,1) such that β n , i β i (0,1) as n for all i{1,,N}. Suppose that the following conditions hold:

(C1) 0< lim inf n α n lim sup n α n <1;

(C2) lim n λ n =0 and n = 1 λ n =;

(C3) n = 2 | α n λ n α n 1 λ n 1 |< or lim n | α n λ n α n 1 λ n 1 | λ n =0;

(C4) n = 2 | λ n λ n 1 |< or lim n | λ n λ n 1 | λ n =0;

(C5) n = 2 | β n , i β n 1 , i |< or lim n | β n , i β n 1 , i | λ n =0 for all i{1,,N};

(C6) n = 2 | r n r n 1 |< or lim n | r n r n 1 | λ n =0.

Then the following assertions hold.

  1. (a)

    Let { x n } be a sequence generated by the scheme (1.13), then { x n } converges strongly to a unique solution x Ω of Problem 1.2.

  2. (b)

    Let { x n } be a sequence generated by the scheme (1.14), then { x n } converges strongly to a unique solution x Ω of the following system of variational inequalities:

    { F x , x x 0 , x Ω , ( μ F γ S ) x , y x 0 , y Ω .

Proof We prove only part (a) since part (b) is a straightforward consequence of part (a). Let { x n } be a sequence generated by the scheme (1.13). First of all, note that 0<γτ and

μ η τ μ η 1 1 μ ( 2 η μ κ 2 ) 1 μ ( 2 η μ κ 2 ) 1 μ η 1 2 μ η + μ 2 κ 2 1 2 μ η + μ 2 η 2 κ 2 η 2 κ η .

Then it follows from the ρ-contractiveness of f that

( μ F γ f ) x ( μ F γ f ) y , x y (μηγρ) x y 2 ,x,yC.

Hence, from γρ<γτμη we deduce that μFγf is (μηγρ)-strongly monotone. Since it is clear that μFγf is Lipschitz continuous, there exists a unique solution of the following VIP:

find  x Ω such that  ( μ F γ f ) x , x x 0,xΩ.

Also, since Problem 1.2 has a solution, it is easy to see that Problem 1.2 has a unique solution. In addition, taking into account condition (C1), without loss of generality, we may assume that { α n }[a,b] for some a,b(0,1).

The rest of the proof is divided into several steps.

Step 1. The sequences { x n }, { y n , i } for all i, { u n } are bounded.

Indeed, take a point vΩ arbitrarily. Then by Lemma 1.1, we have from (1.13)

y n , 1 v u n v= T r n x n T r n v x n v.

For all from i=2 to i=N, by induction, one proves that

y n , i v β n , i u n v+(1 β n , i ) y n , i 1 v u n v x n v.

Hence, we obtain that for all i{1,,N}

y n , i v u n v x n v.
(3.1)

Also, utilizing Lemma 2.2 and (1.13), we have

due to 0<γτ. So, calling

M=max { x 1 v , γ f ( v ) μ F v γ a ( 1 ρ ) , γ S v μ F v γ a ( 1 ρ ) } ,

by induction we derive x n vM for all n1. We obtain the claim.

Step 2. lim n x n + 1 x n =0, that is, { x n } is asymptotically regular.

Indeed, for each n1, we set

z n = λ n γ ( α n f ( x n ) + ( 1 α n ) S x n ) +(I λ n μF)T y n , N .

Then we observe that

z n z n 1 = α n λ n γ [ f ( x n ) f ( x n 1 ) ] + λ n ( 1 α n ) γ ( S x n S x n 1 ) + [ ( I λ n μ F ) T y n , N ( I λ n μ F ) T y n 1 , N ] + ( α n λ n α n 1 λ n 1 ) γ [ f ( x n 1 ) S x n 1 ] + ( λ n λ n 1 ) ( γ S x n 1 μ F T y n 1 , N ) .
(3.2)

Let M 0 >0 be a constant such that

sup n 1 { γ f ( x n ) S x n + γ S x n μ F T y n , N } M 0 .

It follows from (1.13) and (3.2) that

(3.3)

By the definition of y n , i , we obtain that for all i=N,,2

y n , i y n 1 , i β n , i u n u n 1 + S i u n 1 y n 1 , i 1 | β n , i β n 1 , i | + ( 1 β n , i ) y n , i 1 y n 1 , i 1 .
(3.4)

In the case i=1, we have

y n , 1 y n 1 , 1 β n , 1 u n u n 1 + S 1 u n 1 u n 1 | β n , 1 β n 1 , 1 | + ( 1 β n , 1 ) u n u n 1 = u n u n 1 + S 1 u n 1 u n 1 | β n , 1 β n 1 , 1 | .
(3.5)

Substituting (3.5) in all (3.4)-type inequalities, we obtain that for i=2,,N

y n , i y n 1 , i u n u n 1 + k = 2 i S k u n 1 y n 1 , k 1 | β n , k β n 1 , k | + S 1 u n 1 u n 1 | β n , 1 β n 1 , 1 | .

So, we conclude that

By Lemma 1.1(v), we know that

u n u n 1 x n x n 1 +L|1 r n 1 r n |,
(3.6)

where L= sup n 1 u n x n . So, substituting (3.6) in the last inequality, we obtain

If we call

M 1 :=max { M 0 , L , sup n 2 , i = 2 , , N S i u n 1 y n 1 , i 1 , sup n 2 S 1 u n 1 u n 1 } ,

and c>0 a minorant for { r n }, we have

x n + 1 x n ( 1 λ n γ a ( 1 ρ ) ) x n x n 1 + M 1 [ | α n λ n α n 1 λ n 1 | + | λ n λ n 1 | + | r n r n 1 | c + k = 1 N | β n , k β n 1 , k | ] ,
(3.7)

due to 0<γτ. By conditions (C2)-(C6) and Lemma 2.1, we obtain the claim.

Step 3. x n u n = x n T r n x n 0 as n.

Indeed, by the firm nonexpansivity of T r n , a standard calculation (see [36]) shows that for all pEP(Θ,h)

u n p 2 x n p 2 x n u n 2 .

So, take a point vΩ arbitrarily; then utilizing Lemma 2.2 and (1.13), we have

This implies that

Since x n + 1 x n 0 and λ n 0 as n, by the boundedness of { x n } we conclude that lim n x n u n =0.

Step 4. For all i{1,,N}, S i u n u n 0 as n.

Indeed, let us show that for every i{1,,N} one has S i u n y n , i 1 0 as n. Take a point vΩ arbitrarily. When i=N, utilizing Lemmas 2.3 and 2.4, and (1.13), we have

So, we have

Since β n , N β N (0,1), x n + 1 x n 0 and λ n 0 as n, by the boundedness of { x n } we conclude that lim n S N u n y n , N 1 =0.

Take i{1,,N1} arbitrarily. Then, we have

and so, after (Ni+1)-iterations,

Again, we obtain

Since for all k{1,,N}, β n , k β k (0,1), x n + 1 x n 0 and λ n 0 as n, by the boundedness of { x n } we conclude that

lim n S i u n y n , i 1 =0.
(3.8)

Obviously, for i=1 we have lim n S 1 u n u n =0. To conclude, we have that

S 2 u n u n S 2 u n y n , 1 + y n , 1 u n = S 2 u n y n , 1 + β n , 1 S 1 u n u n ,

which hence implies that lim n S 2 u n u n =0. Consequently, by induction, we get lim n S i u n u n =0 for all i=2,,N since it is enough to observe that

S i u n u n S i u n y n , i 1 + y n , i 1 S i 1 u n + S i 1 u n u n S i u n y n , i 1 + ( 1 β n , i 1 ) S i 1 u n y n , i 2 + S i 1 u n u n .

Step 5. lim n y n , N x n = lim n x n T x n =0 and ω w ( x n )Ω.

Indeed, since x n u n 0 as n, we have ω w ( x n )= ω w ( u n ) and ω s ( x n )= ω s ( u n ).

Now, we observe that

x n y n , 1 x n u n + y n , 1 u n = x n u n + β n , 1 S 1 u n u n .

By Step 4, S 1 u n u n 0 as n. Hence, we get

lim n x n y n , 1 =0.
(3.9)

This implies that ω w ( x n )= ω w ( y n , 1 ) and ω s ( x n )= ω s ( y n , 1 ).

Take a point q ω w ( x n ) arbitrarily. Since q ω w ( u n ), by Step 4 and the demiclosedness principle, we have qFix( S i ) for all i{1,,N}, that is, q i Fix( S i ). Moreover, note that

y n , N x n k = 2 N y n , k y n , k 1 + y n , 1 x n = k = 2 N β n , k S k u n y n , k 1 + y n , 1 x n ,

and hence,

So, it is easy to see that lim n y n , N x n =0 and lim n x n T x n =0 since x n + 1 x n 0, λ n 0, y n , 1 x n 0, β n , k β k and S k u n y n , k 1 0 for all k{1,,N}. Thus, by the demiclosedness principle, we have qFix(T). Since { x n } is bounded and lim n x n T r n x n =0 (due to Step 3), by Lemma 2.3, we derive qEP(Θ,h). This shows that qΩ. Therefore, we obtain the claim.

Step 6. { x n } converges strongly to a unique solution x of Problem 1.2.

Indeed, according to x n + 1 x n 0, we can take a subsequence { x n j } of { x n } satisfying

lim sup n ( γ f μ F ) x , x n + 1 x = lim sup n ( γ f μ F ) x , x n x = lim j ( γ f μ F ) x , x n j x .

Without loss of generality, we may further assume that x n j x ˜ ; then x ˜ Ω as we just proved. Since x is a solution of Problem 1.2, we get

lim sup n ( γ f μ F ) x , x n + 1 x = ( γ f μ F ) x , x ˜ x 0.
(3.10)

Repeating the same argument as that of (3.10), we have

lim sup n ( γ S μ F ) x , x n + 1 x 0.
(3.11)

From (1.13) and (3.1), it follows that (noticing that x n + 1 = P C z n and 0<γτ)

It turns out that

(3.12)

Put s n = x n x 2 , γ n = α n λ n γ(1ρ) and

δ n = 2 γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] ( γ f μ F ) x , x n + 1 x + 2 ( 1 α n ) α n γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] ( γ S μ F ) x , x n + 1 x .

Then (3.12) can be rewritten as

s n + 1 (1 γ n ) s n + γ n δ n .

From conditions (C1) and (C2), we conclude from 0<1ρ1 that

{ γ n }[0,1]and n = 1 γ n =.

Note that

2 γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] 2 γ ( 1 ρ )

and

2 ( 1 α n ) α n γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] 2 a γ ( 1 ρ ) .

Consequently, utilizing Lemma 2.1, we obtain that

lim sup n δ n lim sup n 2 γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] ( γ f μ F ) x , x n + 1 x + lim sup n 2 ( 1 α n ) α n γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] ( γ S μ F ) x , x n + 1 x 0 .

So, this together with Lemma 2.1 leads to lim n x n x =0. The proof is complete. □

We now derive the following strong convergence result for a sequence generated by Algorithm 1.1 to a unique solution of Problem 1.3.

Theorem 3.2 Let { λ n }, { α n }, { β n , i }, i=1,,N be sequences in (0,1) such that β n , i β i (0,1) as n for all i{1,,N}. Assume that the solution set Ξ of HVIP (1.16) is nonempty and that the following conditions hold:

(C1) 0< lim inf n α n lim sup n α n <1;

(C2) lim n λ n =0 and n = 1 λ n =;

(C3) n = 2 | α n λ n α n 1 λ n 1 |< or lim n | α n λ n α n 1 λ n 1 | λ n =0;

(C4) n = 2 | λ n λ n 1 |< or lim n | λ n λ n 1 | λ n =0;

(C5) n = 2 | β n , i β n 1 , i |< or lim n | β n , i β n 1 , i | λ n =0 for all i{1,,N};

(C6) n = 2 | r n r n 1 |< or lim n | r n r n 1 | λ n =0;

(C7) there are constants k ¯ ,θ>0 satisfying xTx k ¯ [ d ( x , Ω ) ] θ for all xC.

Then the following assertions hold.

  1. (a)

    Let { x n } be a sequence generated by the scheme (1.13), then { x n } converges strongly to a unique solution x Ω of Problem 1.3 provided ω w ( x n )Ξ.

  2. (b)

    Let { x n } be a sequence generated by the scheme (1.14), then { x n } converges strongly to a unique solution x of the following VIP provided ω w ( x n )Ξ:

    find x Ξ such that F x , x x 0,xΞ.

Proof For part (a), suppose that the sequence { x n } is generated by the scheme (1.13). First of all, from the condition Ξ it follows that Ω=Fix(T)( i Fix( S i ))EP(Θ,h). Note that 0<γτ and κημητ. Hence, it follows from the ρ-contractiveness of f and γρ<γτμη that μFγf is (μηγρ)-strongly monotone and Lipschitz continuous. So, there exists a unique solution x of the following VIP:

find  x Ξ such that  ( μ F γ f ) x , x x 0,xΞ.

Consequently, it is easy to see that Problem 1.3 has a unique solution x Ξ. In addition, taking into account condition (C1), without loss of generality, we may assume that { α n }[a,b] for some a,b(0,1).

The rest of the proof is divided into several steps.

Step 1. The sequences { x n }, { y n , i } for all i, { u n } are bounded.

Indeed, repeating the same argument as in Step 1 of the proof of Theorem 3.1, we can derive the claim.

Step 2. lim n x n + 1 x n =0, that is, { x n } is asymptotically regular.

Indeed, repeating the same argument as in Step 2 of the proof of Theorem 3.1, we can derive the claim.

Step 3. x n u n = x n T r n x n 0 as n.

Indeed, repeating the same argument as in Step 3 of the proof of Theorem 3.1, we can derive the claim.

Step 4. For all i{1,,N}, S i u n u n 0 as n.

Indeed, repeating the same argument as in Step 4 of the proof of Theorem 3.1, we can derive the claim.

Step 5. lim n y n , N x n = lim n x n T x n =0 and ω w ( x n )Ω.

Indeed, repeating the same argument as in Step 5 of the proof of Theorem 3.1, we can derive the claim.

Step 6. { x n } converges strongly to a unique solution x of Problem 1.3.

Indeed, we now take a subsequence { x n j } of { x n } satisfying

lim sup n ( μ F γ f ) x , x n x = lim j ( μ F γ f ) x , x n j x .

Without loss of generality, we may further assume that x n j x ˜ ; then x ˜ Ξ according to the assumption ω w ( x n )Ξ. Since x is a solution of THVIP (1.15), we get

lim sup n ( μ F γ f ) x , x n x = ( μ F γ f ) x , x ˜ x 0.
(3.13)

From (1.13) and (3.1), it follows that (noticing that x n + 1 = P C z n and 0<γτ)

It turns out that

(3.14)

However, from x Ξ and condition (C7), we obtain

(3.15)

On the other hand, we also have

(3.16)

Hence, for a big enough constant k ¯ 1 >0, we have

( γ S μ F ) x , x n + 1 x k ¯ 1 ( x n x n + 1 + y n , N x n + λ n M 0 ) 1 / θ .
(3.17)

Combining (3.14)-(3.17), we get

(3.18)

where γ n = α n λ n γ(1ρ) and

δ n = 2 γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] ( γ f μ F ) x , x n + 1 x + 2 ( 1 α n ) α n γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] k ¯ 1 ( x n x n + 1 + y n , N x n + λ n M 0 ) 1 / θ .

Now, conditions (C1) and (C2) imply that n = 1 γ n =. Moreover, since x n + 1 x n 0 (due to Step 2), y n , N x n 0 (due to Step 5) and λ n 0, we obtain from (3.13) that

δ n = 2 γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] [ ( γ f μ F ) x , x n + 1 x n + ( γ f μ F ) x , x n x ] + 2 ( 1 α n ) α n γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] k ¯ 1 ( x n x n + 1 + y n , N x n + λ n M 0 ) 1 / θ 2 γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] [ ( γ f μ F ) x x n + 1 x n + ( γ f μ F ) x , x n x ] + 2 ( 1 a ) a γ ( 1 ρ ) [ 1 + α n λ n γ ( 1 ρ ) ] k ¯ 1 ( x n x n + 1 + y n , N x n + λ n M 0 ) 1 / θ ,

which together with Lemma 2.4 leads to

lim sup n δ n 0.

Therefore, we can apply Lemma 2.1 to (3.18) to conclude that x n x . The proof of part (a) is complete. It is easy to see that part (b) now becomes a straightforward consequence of part (a) since, if f=0, THVIP (1.15) reduces to the VIP in part (b). This completes the proof. □

Utilizing Theorem 3.2, we immediately derive the following result.

Corollary 3.1 Let F:CH be a κ-Lipschitzian and η-strongly monotone operator with constants κ,η>0, respectively, f:CH be a ρ-contraction with a coefficient ρ[0,1) and S,T:CC be nonexpansive mappings with Fix(T). Let 0<μ<2η/ κ 2 and 0<γτ, where τ=1 1 μ ( 2 η μ κ 2 ) . Assume that the solution set Ξ of HVIP (1.11) is nonempty and the following conditions hold for two sequences { λ n },{ α n }(0,1):

  1. (i)

    0< lim inf n α n lim sup n α n <1;

  2. (ii)

    lim n λ n =0 and n = 1 λ n =;

  3. (iii)

    n = 2 | α n λ n α n 1 λ n 1 |< or lim n | α n λ n α n 1 λ n 1 | λ n =0;

  4. (iv)

    n = 2 | λ n λ n 1 |< or lim n | λ n λ n 1 | λ n =0;

  5. (v)

    there are constants k ¯ ,θ>0 satisfying xTx k ¯ [ d ( x , Ω ) ] θ for all xC.

Then the following assertions hold.

  1. (a)

    Let { x n } be a sequence generated from an arbitrary initial x 1 C by the iterative scheme

    x n + 1 = P C [ λ n γ ( α n f ( x n ) + ( 1 α n ) S x n ) + ( I λ n μ F ) T x n ] ,n1,
    (3.19)

such that ω w ( x n )Ξ, then { x n } converges in norm to the point x Fix(T) which is a unique solution of Problem 1.1.

  1. (b)

    Let { x n } be a sequence generated from an arbitrary initial x 1 C by the iterative scheme

    x n + 1 = P C [ λ n ( 1 α n ) γ S x n + ( I λ n μ F ) T x n ] ,n1,

such that ω w ( x n )Ξ, then { x n } converges in norm to a unique solution x of the VIP of finding x Ξ such that

F x , x x 0,xΞ.

Proof In Theorem 3.2, putting Θ=h=0, S i =I, i=1,,N, from (1.13) we obtain that x n = u n = y n , i , i=1,,N. In this case, Ω=Fix(T) and (1.13) reduces to (3.19). Moreover, it is easy to see that Problem 1.3 reduces to Problem 1.1. Thus, by Theorem 3.2 we obtain the desired results. □

Remark 3.1 Corollary 3.1 improves and extends [[29], Theorem 4.1] in the following aspects:

  1. (a)

    The restriction lim n 0 α n =0 in [[29], Theorem 4.1] is replaced by

    0< lim inf n α n lim sup n α n <1;
  2. (b)

    The condition lim n 0 λ n 1 / θ / α n =0 is not assumed in Corollary 3.1;

  3. (c)

    The boundedness of the sequence { x n } is not assumed in Corollary 3.1.

Very recently, Yao et al. [18] considered the following HVIP of finding x Fix(T) such that

( I S ) x , x x 0,xFix(T),
(3.20)

where T,S:CC are two nonexpansive mappings and Fix(T) is the fixed point set of T. Let Ω denote the solution set of HVIP (3.20) and assume that Ω is nonempty; consequently, the metric projection P Ω is well defined. It is interesting to find the minimum-norm solution x of HVIP (3.20) which exists uniquely and is exactly the nearest point projection of the origin to Ω, that is, x = P Ω (0). Alternatively, x is the unique solution of the quadratic minimization problem:

x 2 =min { x 2 : x Ω } .
(3.21)

They used the contractions to regularize the nonexpansive mapping S to introduce an explicit scheme that generates a sequence { x n } via an iterative algorithm and proved that this sequence converges strongly to the minimum-norm solution x of HVIP (3.20).

In Corollary 3.1, if we put μ=2, F= 1 2 I and γ=τ=1, then HVIP (1.11) reduces to HVIP (3.20) and Ξ=Ω. In this case, THVIP (1.10) reduces to the quadratic minimization problem (3.21). In terms of Corollary 3.1(a), { x n } converges in norm to the point x Fix(T) which is a unique solution of VIP (1.2); see (3.22). Also, by Corollary 3.1(b), { x n } converges in norm to the minimum-norm solution of HVIP (3.20). Therefore, we get the following conclusions.

Corollary 3.2 Let f:CH be a ρ-contraction with a coefficient ρ[0,1) and S,T:CC be two nonexpansive mappings with Fix(T). Assume that the solution set Ω of HVIP (3.20) is nonempty and that the following conditions hold for two sequences { λ n },{ α n }(0,1):

  1. (i)

    0< lim inf n α n lim sup n α n <1;

  2. (ii)

    lim n λ n =0 and n = 1 λ n =;

  3. (iii)

    n = 2 | α n λ n α n 1 λ n 1 |< or lim n | α n λ n α n 1 λ n 1 | λ n =0;

  4. (iv)

    n = 2 | λ n λ n 1 |< or lim n | λ n λ n 1 | λ n =0;

  5. (v)

    there are constants k ¯ ,θ>0 satisfying xTx k ¯ [ d ( x , Ω ) ] θ for all xC.

Then the following assertions hold.

  1. (a)

    Let { x n } be a sequence generated from an arbitrary initial x 1 C by the iterative scheme

    x n + 1 = P C [ λ n ( α n f ( x n ) + ( 1 α n ) S x n ) + ( 1 λ n ) T x n ] ,n1,

such that ω w ( x n )Ω, then { x n } converges in norm to the point x Fix(T) which is a unique solution of the VIP of finding x Ω such that

( I f ) x , x x 0,xΩ.
(3.22)
  1. (b)

    Let { x n } be a sequence generated from an arbitrary initial x 1 C by the iterative scheme

    x n + 1 = P C [ λ n ( 1 α n ) S x n + ( 1 λ n ) T x n ] ,n1,

such that ω w ( x n )Ω, then { x n } converges in norm to a minimum-norm solution of HVIP (3.20).

4 Applications

Let C be a nonempty, closed and convex subset of a real Hilbert space H. Recall that a point uC is a solution to VIP (1.1) if and only if

u= P C (IλA)u,λ>0.
(4.1)

Definition 4.1 An operator A:CH is said to be an α-inverse strongly monotone operator if there exists a constant α>0 such that

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

As an example, we recall that the α-inverse strongly monotone operators are firmly nonexpansive mappings if α1 and that every α-inverse strongly monotone operator is also 1 α -Lipschitz continuous (see [37]).

Let us observe also that, if A is α-inverse strongly monotone, the mappings P C (IλA) are nonexpansive for all λ(0,2α] since they are compositions of nonexpansive mappings (see [[37], pp.419]).

Let us consider S ˜ 1 ,, S ˜ M to be a finite number of nonexpansive self-mappings on C and A 1 ,, A N to be a finite number of α-inverse strongly monotone operators. Let T be a nonexpansive self-mapping on C. Very recently, Marino, Muglia and Yao [27] considered an application of Theorem 3.12 of [27], to solve the following mixed problem.

To find x Fix(T)EP(Θ,h) such that

{ ( I S ˜ 1 ) x , y x 0 , y Fix ( T ) EP ( Θ , h ) , ( I S ˜ 2 ) x , y x 0 , y Fix ( T ) EP ( Θ , h ) , ( I S ˜ M ) x , y x 0 , y Fix ( T ) EP ( Θ , h ) , A 1 x , y x 0 , y C , A 2 x , y x 0 , y C , A N x , y x 0 , y C .
(4.2)

Let us call (SVIP) the set of solutions of the (N+M)-system. This problem is equivalent to finding a common fixed point of T, { P Fix ( T ) EP ( Θ , h ) S ˜ i } i = 1 M , { P C ( I λ A i ) } i = 1 N .

Based on the above mixed problem, in this section we first consider the following more general mixed problem.

Problem 4.1 Let F:CH be κ-Lipschitzian and η-strongly monotone on C, f:CH be a ρ-contraction with a coefficient ρ[0,1) and S, T be nonexpansive self-mappings on C. Let 0<μ<2η/ κ 2 and 0<γτ, where τ=1 1 μ ( 2 η μ κ 2 ) . Assume that Θ,h:C×CR are two bifunctions. Then the objective is to find x Ω such that

{ ( μ F γ f ) x , x x 0 , x Ω , ( μ F γ S ) x , y x 0 , y Ω ,
(4.3)

where Ω=Fix(T)(SVIP)EP(Θ,h).

Utilizing Theorem 3.1 we obtain the following result.

Theorem 4.1 Assume that Problem 4.1 has a solution. Let 0<λ2α. Let { λ n }, { α n }, { β n , i }, i=1,,(N+M) be sequences in (0,1) such that β n , i β i (0,1) as n for all i{1,,(N+M)}. Suppose that the conditions (C1)-(C6) in Theorem  3.1 hold and that the sequence { x n } is defined explicitly by the following iterative scheme:

{ Θ ( u n , y ) + h ( u n , y ) + 1 r n y u n , u n x n 0 , y C , y n , 1 = β n , 1 P Fix ( T ) EP ( Θ , h ) S ˜ 1 u n + ( 1 β n , 1 ) u n , y n , i = β n , i P Fix ( T ) EP ( Θ , h ) S ˜ i u n + ( 1 β n , i ) y n , i 1 , i = 2 , , M , y ¯ n , j = β ¯ n , j P C ( I λ A j ) u n + ( 1 β ¯ n , j ) y ¯ n , j 1 , j = 1 , , N , x n + 1 = P C [ λ n γ ( α n f ( x n ) + ( 1 α n ) S x n ) + ( I λ n μ F ) T y ¯ n , N ] , n 1 ,
(4.4)

where y ¯ n , 0 = y n , M and β ¯ n , j = β n , M + j , j=1,,N. In particular, if f0, then (4.4) reduces to the following iterative scheme:

{ Θ ( u n , y ) + h ( u n , y ) + 1 r n y u n , u n x n 0 , y C , y n , 1 = β n , 1 P Fix ( T ) EP ( Θ , h ) S ˜ 1 u n + ( 1 β n , 1 ) u n , y n , i = β n , i P Fix ( T ) EP ( Θ , h ) S ˜ i u n + ( 1 β n , i ) y n , i 1 , i = 2 , , M , y ¯ n , j = β ¯ n , j P C ( I λ A j ) u n + ( 1 β ¯ n , j ) y ¯ n , j 1 , j = 1 , , N , x n + 1 = P C [ λ n ( 1 α n ) γ S x n + ( I λ n μ F ) T y ¯ n , N ] , n 1 .
(4.5)

Then the following assertions hold.

  1. (a)

    Let { x n } be a sequence generated by the scheme (4.4), then { x n } converges strongly to the point x Ω which is a unique solution of Problem 4.1.

  2. (b)

    Let { x n } be a sequence generated by the scheme (4.5), then { x n } converges strongly to a unique solution x Ω of the following system of variational inequalities:

    { F x , x x 0 , x Ω , ( μ F γ S ) x , y x 0 , y Ω .
    (4.6)

Now, we consider another more general mixed problem.

Problem 4.2 Let F:CH be κ-Lipschitzian and η-strongly monotone on C, f:CH be a ρ-contraction with a coefficient ρ[0,1) and S, T be nonexpansive self-mappings on C. Let 0<μ<2η/ κ 2 and 0<γτ, where τ=1 1 μ ( 2 η μ κ 2 ) . Assume that are two bifunctions. Then the objective is to find x Ξ such that

( μ F γ f ) x , x x 0,xΞ,
(4.7)

where Ξ denotes the solution set of the following hierarchical variational inequality problem (HVIP) of finding z Ω such that

( μ F γ S ) z , z z 0,zΩ,
(4.8)

with Ω=Fix(T)(SVIP)EP(Θ,h).

Utilizing Theorem 3.2, we get the following result.

Theorem 4.2 Let 0<λ2α. Let { λ n }, { α n }, { β n , i }, i=1,,(N+M) be sequences in (0,1) such that β n , i β i (0,1) as n for all i{1,,(N+M)}. Assume that the solution set Ξ of HVIP (4.8) is nonempty and that the conditions (C1)-(C7) in Theorem  3.2 hold. Then the following assertions hold.

  1. (a)

    Let { x n } be a sequence generated by the scheme (4.4) such that ω w ( x n )Ξ, then { x n } converges strongly to the point x Ω which is a unique solution of Problem 4.2.

  2. (b)

    Let { x n } be a sequence generated by the scheme (4.5) such that ω w ( x n )Ξ, then { x n } converges strongly to a unique solution x of the following VIP:

    find x Ξ such that F x , x x 0,xΞ.
    (4.9)

5 Concluding remarks

We considered a system of variational inequalities defined over the intersection of the set of solutions of an equilibrium problem, the set of common fixed points of a finite family of nonexpansive mappings, and the solution set of a nonexpansive mapping (Problem 1.2). We also considered a triple hierarchical variational inequality problem, that is, a variational inequality problem defined over a set of solutions of another variational inequality problem which is defined over the intersection of the set of solutions of an equilibrium problem, the set of common fixed points of a finite family of nonexpansive mappings, and the solution set of a nonexpansive mapping (Problem 1.3). The nontrivial examples of Problems 1.2 and 1.3 are also given in Section 4. We combined the one-step iterative method proposed in [29] and the multi-step iterative method given in [27] to propose a multi-step hybrid viscosity method that generates a sequence via an explicit iterative algorithm. It is worth pointing out that the one-step iterative method given in [29] combines the regularization method, the hybrid steepest-descent method and the projection method, and that the multi-step iterative method given in [27] involves the Ishikawa-type iterative method and the viscosity approximation method. Moreover, it is also proven that under two different pools of suitable conditions such a sequence converges strongly to a unique solution of Problem 1.2 and to a unique solution of Problem 1.3, respectively.