1 Introduction

In nonlinear analysis, a common approach to solving a problem with multiple solutions is to replace it by a family of perturbed problems admitting a unique solution and to obtain a particular solution as the limit of these perturbed solutions when the perturbation vanishes.

In this paper, we introduce a more general approach which consists in finding a particular part of the solution set of a given fixed point problem, i.e., fixed points which solve a variational inequality. More precisely, the goal of this paper is to present a method for finding hierarchically a fixed point of a nonexpansive semigroup S = {T(s)}s ≥ 0with respect to another monotone operator A, namely,

Find x* ∈ Fix(S) such that

A x * , x - x * 0 , x F i x ( S ) .
(1.1)

This is an interesting topic due to the fact that it is closely related to convex programming problems. For the related works, refer to [119].

This paper is devoted to solve the problem (1.1). For this purpose, we propose a double-net algorithm which generates a net {x s ,t} and prove that the net {x s ,t} hierarchically converges to the solution of the problem (1.1), that is, for each fixed t ∈ (0, 1), the net {x s ,t} converges in norm as s → 0 to a common fixed point x t Fix(S) of the nonexpansive semigroup {T(s)}s ≥ 0and, as t → 0, the net {x t } converges in norm to the unique solution x* of the problem (1.1).

2 Preliminaries

Let H be a real Hilbert space with inner product 〈·, ·〉 and norm ||·||, respectively. Recall a mapping f : H → H is called a contraction if there exists ρ ∈ [0, 1) such that

| | f ( x ) - f ( y ) | | ρ | | x - y | | , x , y H .

A mapping T : C → C is said to be nonexpansive if

| | T x - T y | | | | x - y | | , x , y H .

Denote the set of fixed points of the mapping T by Fix(T).

Recall also that a family S : = {T(s)}s ≥ 0of mappings of H into itself is called a nonexpansive semigroup if it satisfies the following conditions:

(S1) T(0)x = x for all xH;

(S2) T(s + t) = T(s)T(t) for all s, t ≥ 0;

(S3) ||T(s)x - T(s)y|| ≤ ||x - y|| for all x, yH and s ≥ 0;

(S4) for all xH, s → T(s)x is continuous.

We denote by Fix(T(s)) the set of fixed points of T(s) and by Fix(S) the set of all common fixed points of S, i.e., Fix(S) = ⋂s ≥ 0Fix(T(s)). It is known that Fix(S) is closed and convex ([20], Lemma 1).

A mapping A of H into itself is said to be monotone if

A u - A v , u - v 0 , u , v H ,

and A : C → H is said to be α-inverse strongly monotone if there exists a positive real number α such that

A u - A v , u - v α | | A u - A v | | 2 , u , v H .

It is obvious that any α-inverse strongly monotone mapping A is monotone and 1 α -Lipschitz continuous.

Now, we introduce some lemmas for our main results in this paper.

Lemma 2.1. [21] Let H be a real Hilbert space. Let the mapping A : H → H be α-inverse strongly monotone and μ > 0 be a constant. Then, we have

| | ( I - μ A ) x - ( I - μ A ) y | | 2 | | x - y | | 2 + μ ( μ - 2 α ) | | A x - A y | | 2 , x , y H .

In particular, if 0 ≤ μ ≤ 2α, then I - μA is nonexpansive.

Lemma 2.2. [22] Let C be a nonempty bounded closed convex subset of a Hilbert space H and {T(s)}s ≥ 0be a nonexpansive semigroup on C. Then, for all h ≥ 0,

lim t sup x C 1 t 0 t T ( s ) x d s - T ( h ) 1 t 0 t T ( s ) x d s = 0 .

Lemma 2.3. [23] (Demiclosedness Principle for Nonexpansive Mappings) Let C be a nonempty closed convex subset of a real Hilbert space H and T : C → C be a nonexpansive mapping with Fix(T) ≠ ∅. If {x n } is a sequence in C converging weakly to a point xC and {(I - T)x n } converges strongly to a point yC, then (I - T)x = y. In particular, if y = 0, then xFix(T).

Lemma 2.4. Let H be a real Hilbert space. Let f : H → H be a ρ-contraction with coefficient ρ ∈ [0, 1) and A : H → H be an α-inverse strongly monotone mapping. Let μ ∈ (0, 2α) and t ∈ (0, 1). Then, the variational inequality

x * F i x ( S ) ; t f ( z ) + ( 1 - t ) ( I - μ A ) z - z , x * - z 0 , z F i x ( S ) ,
(2.1)

is equivalent to its dual variational inequality

x * F i x ( S ) ; t f ( x * ) + ( 1 - t ) ( I - μ A ) x * - x * , x * - z 0 , z F i x ( S ) .
(2.2)

Proof. Assume that x* ∈ Fix(S) solves the problem (2.1). For all yFix(S), set

x = x * + s ( y - x * ) F i x ( S ) , s ( 0 , 1 ) .

We note that

t f ( x ) + ( 1 - t ) ( I - μ A ) x - x , x * - x 0 .

Hence, we have

t f ( x * + s ( y - x * ) ) + ( 1 - t ) ( I - μ A ) ( x * + s ( y - x * ) ) - x * - s ( y - x * ) , s ( x * - y ) 0 ,

which implies that

t f ( x * + s ( y - x * ) ) + ( 1 - t ) ( I - μ A ) ( x * + s ( y - x * ) ) - x * - s ( y - x * ) , x * - y 0 .

Letting s → 0, we have

t f ( x * ) + ( 1 - t ) ( I - μ A ) ( x * ) - x * , x * - y 0 ,

which implies the point x* ∈ Fix(S) is a solution of the problem (2.2).

Conversely, assume that the point x* ∈ Fix(S) solves the problem (2.2). Then, we have

t f ( x * ) + ( 1 - t ) ( I - μ A ) x * - x * , x * - z 0 .

Noting that I - f and A are monotone, we have

( I - f ) z - ( I - f ) x * , z - x * 0

and

A z - A x * , z - x * 0 .

Thus, it follows that

t ( I - f ) z - ( I - f ) x * , z - x * + ( 1 - t ) μ A z - A x * , z - x * 0 ,

which implies that

t f ( z ) + ( 1 - t ) ( I - μ A ) z - z , x * - z t f ( x * ) + ( 1 - t ) ( I - μ A ) x * - x * , x * - z 0 .

This implies that the point x* ∈ Fix(S) solves the problem (2.1). This completes the proof. □

3 Main results

In this section, we first introduce our double-net algorithm and then prove a strong convergence theorem for this algorithm.

Throughout, we assume that

(C1) H is a real Hilbert space;

(C2) f : H → H is a ρ-contraction with coefficient ρ ∈ [0, 1), A : H → H is an α-inverse strongly monotone mapping, and S = {T(s)}s ≥ 0: H → H is a nonexpansive semigroup with Fix(S) ≠ ∅;

(C3) the solution set Ω of the problem (1.1) is nonempty;

(C4) μ ∈ (0, 2α) is a constant, and {λ s }0 < s < 1is a continuous net of positive real numbers satisfying lims→ 0λ s = +∞.

For any s, t ∈ (0, 1), we define the following mapping

x W s , t x : = s [ t f ( x ) + ( 1 - t ) ( x - μ A x ) ] + ( 1 - s ) 1 λ s 0 λ s T ( ν ) x d ν .

We note that the mapping W s, t is a contraction. In fact, we have

W s , t x - W s , t y = s [ t f ( x ) + ( 1 - t ) ( x - μ A x ) ] + ( 1 - s ) 1 λ s 0 λ s T ( ν ) x d ν - s [ t f ( y ) + ( 1 - t ) ( y - μ A y ) ] - ( 1 - s ) 1 λ s 0 λ s T ( ν ) y d ν s t f ( x ) - f ( y ) | | + s ( 1 - t ) | | ( x - μ A x ) - ( y - μ A y ) | | + ( 1 - s ) | | 1 λ s 0 λ s ( T ( ν ) x - T ( ν ) y ) d ν s t ρ | | x - y | | + s ( 1 - t ) | | x - y | | + ( 1 - s ) | | x - y | | = [ 1 - ( 1 - ρ ) s t ] | | x - y | | ,

which implies that W s, t is a contraction. Hence, by Banach's Contraction Principle, W s, t has a unique fixed point, which is denoted x s, t H, that is, x s, t is the unique solution in H of the fixed point equation

x s , t = s [ t f ( x s , t ) + ( 1 - t ) ( x s , t - μ A x s , t ) ] + ( 1 - s ) 1 λ s 0 λ s T ( ν ) x s , t d ν , s , t ( 0 , 1 ) .
(3.1)

Now, we give some lemmas for our main result.

Lemma 3.1. For each fixed t ∈ (0, 1), the net {x s, t } defined by (3.1) is bounded.

Proof. Taking any zFix(S), since I - μA is nonexpansive (by Lemma 2.1), it follows from (3.1) that

| | x s , t - z | | = s [ t f ( x s , t ) + ( 1 - t ) ( I - μ A ) x s , t ] + ( 1 - s ) 1 λ s 0 λ s T ( ν ) x s , t d ν - z s | | t f ( x s , t ) + ( 1 - t ) ( I - μ A ) x s , t - z | | + ( 1 - s ) 1 λ s 0 λ s T ( ν ) x s , t d ν - z s t | | f ( x s , t ) - f ( z ) | | + t | | f ( z ) - z | | + ( 1 - t ) | | ( I - μ A ) x s , t - ( I - μ A ) z | | + ( 1 - t ) | | ( I - μ A ) z - z | | + ( 1 - s ) | | x s , t - z | | s [ t ρ | | x s , t - z | | + t | | f ( z ) - z | | + ( 1 - t ) | | x s , t - z | | + ( 1 - t ) μ | | A z | | ] + ( 1 - s ) | | x s , t - z | | = [ 1 - ( 1 - ρ ) s t ] | | x s , t - z | | + s t | | f ( z ) - z | | + s ( 1 - t ) μ | | A z | | .

This implies that

x s , t - z 1 ( 1 - ρ ) t ( t | | f ( z ) - z | | + ( 1 - t ) μ | | A z | | ) 1 ( 1 - ρ ) t max { | | f ( z ) - z | | , μ | | A z | | } .

Thus, it follows that, for each fixed t ∈ (0, 1), {x s, t } is bounded and so are the nets {f(x s, t )} and {(I - μA)x s, t }. This completes the proof. □

Lemma 3.2. x s, t → x t Fix(S) as s → 0.

Proof. For each fixed t ∈ (0, 1), we set R t := 1 ( 1 - ρ ) t max { | | f ( z ) - z | | , μ | | A z | | } . It is clear that, for each fixed t ∈ (0, 1), {x s, t } ⊂ B(p, R t ), where B(p, R t ) denotes a closed ball with the center p and radius R t . Notice that

1 λ s 0 λ s T ( ν ) x s , t d ν - p | | x s , t - p | | R t .

Moreover, we observe that if xB(p, R t ), then

| | T ( s ) x - p | | | | T ( s ) x - T ( s ) p | | | | x - p | | R t ,

that is, B(p, R t ) is T(s)-invariant for all s ∈ (0, 1). From (3.1), it follows that

T ( τ ) x s , t - x s , t T ( τ ) x s , t - T ( τ ) 1 λ s 0 λ s T ( ν ) x s , t d ν + T ( τ ) 1 λ s 0 λ s T ( ν ) x s , t d ν - 1 λ s 0 λ s T ( ν ) x s , t d ν + 1 λ s 0 λ s T ( ν ) X s , t d ν - x s , t T ( τ ) 1 λ s 0 λ s T ( ν ) x s , t d ν - 1 λ s 0 λ s T ( ν ) x s , t d ν + 2 x s , t - 1 λ s 0 λ s T ( ν ) X s , t d ν 2 S t f ( x s , t ) + ( 1 - t ) ( x s , t - μ A x s , t ) - 1 λ s 0 λ s T ( ν ) x s , t d ν + T ( τ ) 1 λ s 0 λ s T ( ν ) x s , t d ν - 1 λ s 0 λ s T ( ν ) x s , t d ν .

By Lemma 2.2, for all 0 ≤ τ < ∞ and fixed t ∈ (0, 1), we deduce

lim s 0 | | T ( τ ) x s , t - x s , t | | = 0 .
(3.2)

Next, we show that, for each fixed t ∈ (0, 1), the net {x s, t } is relatively norm-compact as s → 0. In fact, from Lemma 2.1, it follows that

| | x s , t - μ A x s , t - ( z - μ A z ) | | 2 | | x s , t - z | | 2 + μ ( μ - 2 α ) | | A x s , t - A z | | 2 .
(3.3)

By (3.1), we have

| | x s , t - z | | 2 = s t f ( x s , t ) - f ( z ) , x s , t - z + s t f ( z ) - z , x s , t - z + s ( 1 - t ) ( I - μ A ) x s , t - ( I - μ A ) z , x s , t - z + s ( 1 - t ) ( I - μ A ) z - z , x s , t - z + ( 1 - s ) 1 λ s 0 λ s T ( ν ) X s , t d ν - z , x s , t - z s t | | f ( x s , t ) - f ( z ) | | | | x s , t - z | | + s t f ( z ) - z , x s , t - z + s ( 1 - t ) | | ( I - μ A ) x s , t - ( I - μ A ) z | | | | x s , t - z | | - s ( 1 - t ) μ A z , x s , t - z + ( 1 - s ) 1 λ s 0 λ s T ( ν ) X s , t d ν - z | | | | x s , t - z s t ρ | | x s , t - z | | 2 + s t f ( z ) - z , x s , t - z - s ( 1 - t ) μ A z , x s , t - z + s ( 1 - t ) | | ( I - μ A ) x s , t - ( I - μ A ) z | | | | x s , t - z | | + ( 1 - s ) | | x s , t - z | | 2 s t ρ | | x s , t - z | | 2 + s t f ( z ) - z , x s , t - z - s ( 1 - t ) μ A z , x s , t - z + s ( 1 - t ) 2 ( | | ( I - μ A ) x s , t - ( I - μ A ) z | | 2 + | | x s , t - z | | 2 ) + ( 1 - s ) | | x s , t - z | | 2 .

This together with (3.3) imply that

| | x s , t - z | | 2 s t ρ | | x s , t - z | | 2 + s t f ( z ) - z , x s , t - z - s ( 1 - t ) μ A z , x s , t - z + s ( 1 - t ) 2 ( | | x s , t - z | | 2 + μ ( μ - 2 α ) | | A x s , t - A z | | 2 + | | x s , t - z | | 2 ) + ( 1 - s ) | | x s , t - z | | 2 [ 1 - ( 1 - ρ ) s t ] | | x s , t - z | | 2 + s t f ( z ) - z , x s , t - z - s ( 1 - t ) μ A z , x s , t - z ,

which implies that

| | x s , t - z | | 2 1 ( 1 - ρ ) t t f ( z ) + ( 1 - t ) ( I - μ A ) z - z , x s , t - z , z F i x ( S ) .
(3.4)

Assume that {s n } ⊂ (0, 1) is such that s n 0 as n → ∞. By (3.4), we obtain immediately that

| | x s n , t - z | | 2 1 ( 1 - ρ ) t t f ( z ) + ( 1 - t ) ( I - μ A ) z - z , x s n , t - z , z F i x ( S ) .
(3.5)

Since { x s n , t } is bounded, without loss of generality, we may assume that, as s n 0, { x s n , t } converges weakly to a point x t . From (3.2) and Lemma 2.3, we get x t Fix(S).

Further, if we substitute x t for z in (3.5), then it follows that

| | x s n , t - x t | | 2 1 ( 1 - ρ ) t t f ( x t ) + ( 1 - t ) ( I - μ A ) x t - x t , x s n , t - x t .

Therefore, the weak convergence of { x s n , t } to x t actually implies that x s n , t x t strongly. This has proved the relative norm-compactness of the net {x s, t } as s → 0.

Now, if we take the limit as n → ∞ in (3.5), we have

x t - z 2 1 ( 1 - ρ ) t t f ( z ) + ( 1 - t ) ( I - μ A ) z - z , x t - z , z F i x ( S ) .

In particular, x t solves the following variational inequality:

x t F i x ( S ) ; t f ( z ) + ( 1 - t ) ( I - μ A ) z - z , x t - z 0 , z F i x ( S ) ,

or the equivalent dual variational inequality (see Lemma 2.4):

x t F i x ( S ) ; t f ( x t ) + ( 1 - t ) ( I - μ A ) x t - x t , x t - z 0 , z F i x ( S ) .
(3.6)

Notice that (3.6) is equivalent to the fact that x t = PFix(S)(tf + (1-t)(I - μA))x t , that is, x t is the unique element in Fix(S) of the contraction PFix(S)(tf +(1-t)(I -μA)). Clearly, it is sufficient to conclude that the entire net {x s, t } converges in norm to x t Fix(S) as s → 0. This completes the proof. □

Lemma 3.3. The net {x t } is bounded.

Proof. In (3.6), if we take any y ∈ Ω, then we have

t f ( x t ) + ( 1 - t ) ( I - μ A ) x t - x t , x t - y 0 .
(3.7)

By virtue of the monotonicity of A and the fact that y ∈ Ω, we have

( I - μ A ) x t - x t , x t - y ( I - μ A ) y - y , x t - y 0 .
(3.8)

Thus, it follows from (3.7) and (3.8) that

f ( x t ) - x t , x t - y 0 , y Ω
(3.9)

and hence

x t - y 2 x t - y , x t - y + f ( x t ) - x t , x t - y = f ( x t ) - f ( y ) , x t - y + f ( y ) - y , x t - y ρ x t - y 2 + f ( y ) - y , x t - y .

Therefore, we have

| | x t - y | | 2 1 1 - ρ f ( y ) - y , x t - y , y Ω .
(3.10)

In particular,

| | x t - y | | 1 1 - ρ | | f ( y ) - y | | , t ( 0 , 1 ) ,

which implies that {x t } is bounded. This completes the proof. □

Lemma 3.4. If the net {x t } converges in norm to a point x* ∈ Ω, then the point solves the variational inequality

( I - f ) x * , x - x * 0 , x Ω .
(3.11)

Proof. First, we note that the solution of the variational inequality (3.11) is unique.

Next, we prove that ω w (x t ) ⊂ Ω, that is, if (t n ) is a null sequence in (0, 1) such that x t n x weakly as n → ∞, then x' ∈ Ω. To see this, we use (3.6) to get

μ A x t , z - x t t 1 - t ( I - f ) x t , x t - z , z F i x ( S ) .

However, since A is monotone, we have

A z , z - x t A x t , z - x t .

Combining the last two relations yields that

μ A z , z - x t t 1 - t ( I - f ) x t , x t - z , z F i x ( S ) .
(3.12)

Letting t = t n 0 as n → ∞ in (3.12), we get

A z , z - x 0 , z F i x ( S ) ,

which is equivalent to its dual variational inequality

A x , z - x 0 , z F i x ( S ) .

That is, x' is a solution of the problem (1.1) and hence x' ∈ Ω.

Finally, we prove that x' = x*, the unique solution of the variational inequality (3.11). In fact, by (3.10), we have

| | x t n - x | | 2 1 1 - ρ f ( x ) - x , x t n - x , x Ω .

Therefore, the weak convergence to x' of { x t n } implies that x t n x in norm. Thus, if we let t = t n 0 in (3.10), then we have

f ( x ) - x , y - x 0 , y Ω ,

which implies that x' ∈ Ω solves the problem (3.11). By the uniqueness of the solution, we have x' = x* and it is sufficient to guarantee that x t → x* in norm as t → 0. This completes the proof. □

Thus, by the above lemmas, we can obtain immediately the following theorem.

Theorem 3.5. For each (s, t) ∈ (0, 1) × (0, 1), let {x s, t } be a double-net algorithm defined implicitly by (3.1). Then, the net {x s, t } hierarchically converges to the unique solution x* of the hierarchical fixed point problem and the variational inequality problem (1.1), that is, for each fixed t ∈ (0, 1), the net {x s, t } converges in norm as s → 0 to a common fixed point x t Fix(S) of the nonexpansive semigroup {T(s)}s ≥ 0. Moreover, as t → 0, the net {x t } converges in norm to the unique solution x* ∈ Ω and the point x* also solves the following variational inequality.

x * Ω ; ( I - f ) x * , x - x * 0 , x Ω .