1 Introduction

Variational inclusion problems, which are generalizations of variational inequalities introduced by Stampacchia [1] in the early sixties, are among the most interesting and intensively studied classes of mathematics problems and have wide applications in the fields of optimization and control, economics, electrical networks, game theory, engineering science, and transportation equilibria. For the past decades, many existence results and iterative algorithms for variational inequality and variational inclusion problems have been studied (see, for example, [213]) and the references cited therein). Recently, some new and interesting problems, which are called to be system of variational inequality problems, were introduced and investigated. Verma [6], and Kim and Kim [7] considered a system of nonlinear variational inequalities, and Pang [14] showed that the traffic equilibrium problem, the spatial equilibrium problem, the Nash equilibrium, and the general equilibrium programming problem can be modeled as a system of variational inequalities. Ansari et al. [2] considered a system of vector variational inequalities and obtained its existence results. Cho et al. [8] introduced and studied a new system of nonlinear variational inequalities in Hilbert spaces. Moreover, they obtained the existence and uniqueness properties of solutions for the system of nonlinear variational inequalities. Peng and Zhu [9] introduced a new system of generalized mixed quasivariational inclusions involving (H, η)-monotone operators. Very recently, Qin et al. [15] studied the approximation of solutions to a system of variational inclusions in Banach spaces and established a strong convergence theorem in uniformly convex and 2-uniformly smooth Banach spaces. Kamraksa and Wangkeeree [16] introduced a general iterative method for a general system of variational inclusions and proved a strong convergence theorem in strictly convex and 2-uniformly smooth Banach spaces. Wangkeeree and Kamraksa [17] introduced an iterative algorithm for finding a common element of the set of solutions of a mixed equilibrium problem, the set of fixed points of an infinite family of nonexpansive mappings, and the set of solutions of a general system of variational inequalities, and then proved the strong convergence of the iterative in Hilbert spaces. Petrot [18] applied the resolvent operator technique to find the common solutions for a generalized system of relaxed cocoercive mixed variational inequality problems and fixed point problems for Lipschitz mappings in Hilbert spaces. Zhao et al. [19] obtained some existence results for a system of variational inequalities by Brouwer fixed point theory and proved the convergence of an iterative algorithm infinite Euclidean spaces.

Inspired and motivated by the works mentioned above, the purpose of this paper is to introduce and investigate a new system of generalized quasivariational inclusions (for short, (SGQVI)) in q-uniformly smooth Banach spaces, and then establish the existence and uniqueness theorems of solutions for the problem (SGQVI) by using Banach contraction principle. We also propose two iterative algorithms to find the common element of the solutions set for (SGQVI) and the fixed points set for Lipschitz mappings. Convergence theorems with estimates of convergence rates are established under suitable conditions. The results presented in this paper unifies, generalizes, and improves some results of [6, 1520].

2 Preliminaries

Throughout this paper, without other specifications, we denote by Z+ and R the set of non-negative integers and real numbers, respectively. Let E be a real q-uniformly Banach space with its dual E*, q > 1, denote the duality between E and E* by 〈·, ·〉 and the norm of E by || · ||, and T: EE be a nonlinear mapping. When {x n } is a sequence in E, we denote strong convergence of {x n } to xE by x n x. A Banach space E is said to be smooth if lim t 0 | | x + t y | | - | | x | | t exists for all x, yE with ||x|| = ||y|| = 1. It is said to be uniformly smooth if the limit is attained uniformly for ||x|| = ||y|| = 1. The function

ρ E ( t ) = sup | | x + y | | + | | x - y | | 2 - 1 : | | x | | = 1 , | | y | | t

is called the modulus of smoothness of E. E is called q-uniformly smooth if there exists a constant c > 0 such that ρ E (t) ≤ ctq.

Example 2.1.[20] All Hilbert spaces, Lp(or lp) and the Sobolev spaces W m p , (p ≥ 2) are 2-uniformly smooth, while Lp(or lp) and W m p spaces (1 < p ≤ 2) are p-uniformly smooth.

The generalized duality mapping J q : E → 2E* is defined as

J q ( x ) = { f * E * : f * , x = | | f * | | | | x | | = | | x | | q , | | f * | | = | | x | | q - 1 }

for all xE. Particularly, J = J2 is the usual normalized duality mapping. It is well-known that J q (x) = ||x||q-2J(x) for x ≠ 0, J q (tx) = tq-1J q (x), and J q (-x) = -J q (x) for all xE and t ∈ [0, +∞), and J q is single-valued if E is smooth. If E is a Hilbert space, then J = I, where I is the identity mapping. Many properties of the normalized duality mapping J q can be found in (see, for example, [21]). Let ρ1, ρ2 be two positive constants, A1, A2 : E × EE be two single-valued mappings, M1, M2 : E → 2E be two set-valued mappings. The (SGQVI) problem is to find (x*, y*) ∈ E × E such that

{ 0 x * y * + ρ 1 ( A 1 ( y * , x * ) + M 1 ( x * ) ) , 0 y * x * + ρ 2 ( A 2 ( x * , y * ) + M 2 ( y * ) ) .
(2.1)

The set of solutions to (SGQVI) is denoted by Ω.

Special examples are as follows:

  1. (I)

    If A1 = A2 = A, E = H is a Hilbert space, and M1(x) = M2(x) = ∂ϕ (x) for all xE, where ϕ: ER ∪ {+∞} is a proper, convex, and lower semicontinuous functional, and ∂ϕ denotes the subdifferential operator of ϕ, then the problem (SGQVI) is equivalent to find (x*, y*) ∈ E × E such that

    ρ 1 A ( y * , x * ) + x * - y * , x - x * + ϕ ( x ) - ϕ ( x * ) 0 , x E , ρ 2 A ( x * , y * ) + y * - x * , x - y * + ϕ ( x ) - ϕ ( y * ) 0 , x E ,
    (2.2)

where ρ1, ρ2 are two positive constants, which is called the generalized system of relaxed cocoercive mixed variational inequality problem [22].

  1. (II)

    If A1 = A2 = A, E = H is a Hilbert space, and K is a closed convex subset of E, M1(x) = M2(x) = ∂ϕ (x) and ϕ (x) = δ K (x) for all xE, where δ K is the indicator function of K defined by

    ϕ ( x ) = δ K ( x ) = 0 if x K , + otherwise ,

then the problem (SGQVI) is equivalent to find (x*, y*) ∈ K × K such that

ρ 1 A ( y * , x * ) + x * - y * , x - x * 0 , x K , ρ 2 A ( x * , y * ) + y * - x * , x - y * 0 , x K ,
(2.3)

where ρ1, ρ2 are two positive constants, which is called the generalized system of relaxed cocoercive variational inequality problem [23].

  1. (III)

    If for each i ∈ {1, 2}, zE, A i (x, z) = Ψ i (x), for all xE, where Ψ i : EE, then the problem (SGQVI) is equivalent to find (x*, y*) ∈ E × E such that

    0 x * - y * + ρ 1 ( Ψ 1 ( y * ) + M 1 ( x * ) ) , 0 y * - x * + ρ 2 ( Ψ 2 ( x * ) + M 2 ( y * ) ) ,
    (2.4)

where ρ1, ρ2 are two positive constants, which is called the system of quasivariational inclusion [15, 16].

  1. (IV)

    If A1 = A2 = A and M1 = M2 = M then the problem (SGQVI) is reduced to the following problem: find (x*, y*) ∈ E × E such that

    0 x * - y * + ρ 1 ( A ( y * , x * ) + M ( x * ) ) , 0 y * - x * + ρ 2 ( A ( x * , y * ) + M ( y * ) ) ,
    (2.5)

where ρ1, ρ2 are two positive constants.

  1. (V)

    If for each i ∈ {1, 2}, zE, A i (x, z) = Ψ (x), and M1(x) = M2(x) = M, for all xE, where Ψ: EE, then the problem (SGQVI) is equivalent to find (x*, y*) ∈ E × E such that

    0 x * - y * + ρ 1 ( Ψ ( y * ) + M ( x * ) ) , 0 y * - x * + ρ 2 ( Ψ ( x * ) + M ( y * ) ) ,

where ρ1, ρ2 are two positive constants, which is called the system of quasivariational inclusion [16].

We first recall some definitions and lemmas that are needed in the main results of this work.

Definition 2.1.[21] Let M: dom(M) ⊂ E → 2E be a set-valued mapping, where dom(M) is effective domain of the mapping M. M is said to be

  1. (i)

    accretive if, for any x, y ∈ dom(M), uM(x) and vM(y), there exists j q (x - y) ∈ J q (x - y) such that

    u - v , j q ( x - y ) 0 .
  2. (ii)

    m-accretive (maximal-accretive) if M is accretive and (I + ρM)dom(M) = E holds for every ρ > 0, where I is the identity operator on E.

Remark 2.1. If E is a Hilbert space, then accretive operator and m-accretive operator are reduced to monotone operator and maximal monotone operator, respectively.

Definition 2.2. Let T: EE be a single-valued mapping. T is said to be a γ-Lipschitz continuous mapping if there exists a constant γ > 0 such that

| | T x - T y | | γ | | x - y | | , x , y E .
(2.7)

We denote by F(T) the set of fixed points of T, that is, F(T) = {xE: Tx = x}. For any nonempty set Ξ ⊂ E × E, the symbol Ξ ∩ F(T) ≠ ∅ means that there exist x*, y* ∈ E such that (x*, y*) ∈ Ξ and {x*, y*} ⊂ F(T).

Remark 2.2. (1) If γ = 1, then a γ-Lipschitz continuous mapping reduces to a nonexpansive mapping.

  1. (2)

    If γ ∈ (0, 1), then a γ-Lipschitz continuous mapping reduces to a contractive mapping.

Definition 2.3. Let A: E × EE be a mapping. A is said to be

  1. (i)

    τ-Lipschitz continuous in the first variable if there exists a constant τ > 0 such that, for x, x ̃ E,

    | | A ( x , y ) - A ( x ̃ , ) | | τ | | x - x ̃ | | , y , E .
  2. (ii)

    α-strongly accretive if there exists a constant α > 0 such that

    A ( x , y ) - A ( x ̃ , ) , J q ( x - x ̃ ) α | | x - x ̃ | | q , ( x , y ) , ( x ̃ , ) E × E ,

or equivalently,

A ( x , y ) - A ( x ̃ , ) , J ( x - x ̃ ) α | | x - x ̃ | | , ( x , y ) , ( x ̃ , ) E × E .
  1. (iii)

    α-inverse strongly accretive or α-cocoercive if there exists a constant α > 0 such that

    A ( x , y ) - A ( x ̃ , ) , J q ( x - x ̃ ) α | | A ( x , y ) - A ( x ̃ , ) | | q , ( x , y ) , ( x ̃ , ) E × E ,

or equivalently,

A ( x , y ) - A ( x ̃ , ) , J ( x - x ̃ ) α | | A ( x , y ) - A ( x ̃ , ) | | , ( x , y ) , ( x ̃ , ) E × E .
  1. (iv)

    (μ, ν)-relaxed cocoercive if there exist two constants μ ≤ 0 and ν > 0 such that

    A ( x , y ) - A ( x ̃ , ) , J q ( x - x ̃ ) ( - μ ) | | A ( x , y ) - A ( x ̃ , ) | | q + ν | | x - x ̃ | | q , ( x , y ) , ( x ̃ , ) E × E .

Remark 2.3. (1) Every α-strongly accretive mapping is a (μ, α)-relaxed cocoercive for any positive constant μ. But the converse is not true in general.

  1. (2)

    The conception of the cocoercivity is applied in several directions, especially for solving variational inequality problems by using the auxiliary problem principle and projection methods [24]. Several classes of relaxed cocoercive variational inequalities have been investigated in [18, 23, 25, 26].

Definition 2.4. Let the set-valued mapping M: dom(M) ⊂ E → 2E be m-accretive. For any positive number ρ > 0, the mapping R(ρ, M): E → dom(M ) defined by

R ( ρ , M ) ( x ) = ( I + ρ M ) - 1 ( x ) , x E ,

is called the resolvent operator associated with M and ρ, where I is the identity operator on E.

Remark 2.4. Let CE be a nonempty closed convex set. If E is a Hilbert space, and M = ∂ϕ, the subdifferential of the indicator function ϕ, that is,

ϕ ( x ) = δ C ( x ) = 0 if x C , + otherwise ,

then R(ρ, M)= P C , the metric projection operator from E onto C.

In order to estimate of convergence rates for sequence, we need the following definition.

Definition 2.5. Let a sequence {x n } converge strongly to x*. The sequence {x n } is said to be at least linear convergence if there exists a constant ϱ ∈ (0, 1) such that

| | x n + 1 - x * | | ϱ | | x n - x * | | .

Lemma 2.1.[27] Let the set-valued mapping M: dom(M) ⊂ E → 2E be m-accretive. Then the resolvent operator R(ρ, M)is single valued and nonexpansive for all ρ > 0:

Lemma 2.2.[28] Let {a n } and {b n } be two nonnegative real sequences satisfying the following conditions:

a n + 1 ( 1 - λ n ) a n + b n , n n 0 ,

for some n0N, {λ n } ⊂ (0, 1) with n = 0 λ n = and b n = 0(λ n ). Then limn → ∞a n = 0.

Lemma 2.3.[29] Let E be a real q-uniformly Banach space. Then there exists a constant c q > 0 such that

| | x + y | | q | | x | | q + q y , J q ( x ) + c q | | y | | q , x , y E .

3 Existence and uniqueness of solutions for (SGQVI)

In this section, we shall investigate the existence and uniqueness of solutions for (SGQVI) in q-uniformly smooth Banach space under some suitable conditions.

Theorem 3.1. Let ρ1, ρ2 be two positive constants, and (x*, y*) ∈ E × E. Then (x*, y*) is a solution of the problem (2.1) if and only if

x * = R ( ρ 1 , M 1 ) ( y * - ρ 1 A 1 ( y * , x * ) ) , y * = R ( ρ 2 , M 2 ) ( x * - ρ 2 A 2 ( x * , y * ) ) ,
(3.1)

Proof. It directly follows from Definition 2.4. This completes the proof. □

Theorem 3.2. Let E be a real q-uniformly smooth Banach space. Let M2 : E → 2E be m-accretive mapping, A2 : E × EE be (μ2, ν2)-relaxed cocoercive and Lipschitz continuous in the first variable with constant τ2. Then, for each xE, the mapping R ( ρ 2 , M 2 ) ( x - ρ 2 A 2 ( x , ) ) :EE has at most one fixed point. If

1 - q ρ 2 ν 2 + q ρ 2 μ 2 τ 2 q + c q ρ 2 q τ 2 q 0 ,
(3.2)

then the implicit function y(x) determined by

y ( x ) = R ( ρ 2 , M 2 ) ( x - ρ 2 A 2 ( x , y ( x ) ) ) ,

is continuous on E.

Proof. Firstly, we show that, for each xE, the mapping R ( ρ 2 , M 2 ) ( x - ρ 2 A 2 ( x , ) ) :EE has at most one fixed point. Assume that y,E such that

y = R ( ρ 2 , M 2 ) ( x - ρ 2 A 2 ( x , y ) ) , = R ( ρ 2 , M 2 ) ( x - ρ 2 A 2 ( x , ) ) .

Since A2 is Lipschitz continuous in the first variable with constant τ2, then

| | y y ˜ | | = | | R ( ρ 2 , M 2 ) ( x ρ 2 A 2 ( x , y ) ) R ( ρ 2 , M 2 ) 2 , ( x ρ 2 A 2 ( x , y ˜ ) ) | | | | x ρ 2 A 2 ( x , y ) ( x ρ 2 A 2 ( x , y ˜ ) ) | | = ρ 2 | | A 2 ( x , y ) A 2 ( x , y ˜ ) ) | | ρ 2 τ 2 | | x x | | = 0.

Therefore, y=.

On the other hand, for any sequence {x n } ⊂ E, x0E, x n x0 as n → ∞: Since A2 : E × EE is (μ2, ν2)-relaxed cocoercive and Lipschitz continuous in the first variable with constant τ2, one has

L = | | A 2 ( x n , y ( x n ) ) - A 2 ( x 0 , y ( x 0 ) ) | | q (1) τ 2 q | | x n - x 0 | | q , (2) Q = A 2 ( x n , y ( x n ) ) - A 2 ( x 0 , y ( x 0 ) ) , J q ( x n - x 0 ) (3) ( - μ 2 ) | | A 2 ( x n , y ( x n ) ) - A 2 ( x 0 , y ( x 0 ) ) | | q + ν 2 | | x n - x 0 | | q (4) ( - μ 2 τ 2 q + ν 2 ) | | x n - x 0 | | q . (5) (6)

As a consequence, we have, by Lemma 2.1,

| | y ( x n ) - y ( x 0 ) | | = | | R ( ρ 2 , M 2 ) ( x n - ρ 2 A 2 ( x n , y ( x n ) ) ) - R ( ρ 2 , M 2 ) ( x 0 - ρ 2 A 2 ( x 0 , y ( x 0 ) ) ) | | (1) | | x n - ρ 2 A 2 ( x n , y ( x n ) ) - ( x 0 - ρ 2 A 2 ( x 0 , y ( x 0 ) ) ) | | (2) = | | ( x n - x 0 ) - ρ 2 ( A 2 ( x n , y ( x n ) ) - A 2 ( x 0 , y ( x 0 ) ) ) | | (3) | | x n - x 0 | | q - q ρ 2 Q + c q ρ 2 q L q (4) | | x n - x 0 | | q - q ρ 2 ( - μ 2 τ 2 q + ν 2 ) | | x n - x 0 | | q + c q ρ 2 q τ 2 q | | x n - x 0 | | q q (5) = 1 - q ρ 2 ν 2 + q ρ 2 μ 2 τ 2 q + c q ρ 2 q τ 2 q q | | x n - x 0 | | . (6) (7) 

Together with (3.2), it yields that the implicit function y(x) is continuous on E. This completes the proof. □

Theorem 3.3. Let E be a real q-uniformly smooth Banach space. Let M2 : E → 2E be m-accretive mapping, A2 : E × EE be α2-strong accretive and Lipschitz continuous in the first variable with constant τ2. Then, for each xE, the mapping R ( ρ 2 , M 2 ) ( x - ρ 2 A 2 ( x , ) ) :EE has at most one fixed point. If 1-q ρ 2 α 2 + c q ρ 2 q τ 2 q 0, then the implicit function y(x) determined by

y ( x ) = R ( ρ 2 , M 2 ) ( x - ρ 2 A 2 ( x , y ( x ) ) ) ,

is continuous on E.

Proof. The proof is similar to Theorem 3.2 and so the proof is omitted. This completes the proof. □

Theorem 3.4. Let E be a real q-uniformly smooth Banach space. Let M i : E → 2E be m- accretive mapping, A i : E × EE be (μ i , ν i )-relaxed cocoercive and Lipschitz continuous in the first variable with constant τ i for i ∈ {1, 2}. If 1-q ρ 2 ν 2 +q ρ 2 μ 2 τ 2 q + c q ρ 2 q τ 2 q 0, and

0 i = 1 2 ( 1 - q ρ i ν i + q ρ i μ i τ i q + c q ρ i q τ i q ) < 1 .
(3.3)

Then the solutions set Ω of (SGQVI) is nonempty. Moreover, Ω is a singleton.

Proof. By Theorem 3.2, we define a mapping P: EE by

P ( x ) = R ( ρ 1 , M 1 ) ( y ( x ) - ρ 1 A 1 ( y ( x ) , x ) ) , y ( x ) = R ( ρ 2 , M 2 ) ( x - ρ 2 A 2 ( x , y ( x ) ) ) , x E .

Since A i : E × EE are (μ i , ν i )-relaxed cocoercive and Lipschitz continuous in the first variable with constant τ i for i ∈ {1, 2}, one has, for any x, x ̃ E,

L 1 = | | A 1 ( y ( x ) , x ) - A 1 ( y ( x ̃ ) , x ̃ ) | | q (1) τ 1 q | | y ( x ) - y ( x ̃ ) | | q , (2) Q 1 = A 1 ( y ( x ) , x ) - A 1 ( y ( x ̃ ) , x ̃ ) , J q ( y ( x ) - y ( x ̃ ) ) (3) ( - μ 1 ) | | A 1 ( y ( x ) , x ) - A 1 ( y ( x ̃ ) , x ̃ ) | | q + ν 1 | | y ( x ) - y ( x ̃ ) | | q (4) ( - μ 1 τ 1 q + ν 1 ) | | y ( x ) - y ( x ̃ ) | | q , (5) L 2 = | | A 2 ( x , y ( x ) ) - A 2 ( x ̃ , y ( x ̃ ) ) | | q (6) τ 2 q | | x - x ̃ | | q , (7) (8)

and

Q 2 = A 2 ( x , y ( x ) ) - A 2 ( x ̃ , y ( x ̃ ) ) , J q ( x - x ̃ ) (1) ( - μ 2 ) | | A 2 ( x , y ( x ) ) - A 2 ( x ̃ , y ( x ̃ ) ) | | q + ν 2 | | x - x ̃ | | q (2) ( - μ 2 τ 2 q + ν 2 ) | | x - x ̃ | | q . (3) (4)

From both Lemma 2.1 and Theorem 3.1, we get

| | P ( x ) P ( x ˜ ) | | = | | R ( ρ 1 , M 1 ) ( y ( x ) ρ 1 A 1 ( y ( x ) , x ) ) R ( ρ 1 , M 1 ) ( y ( x ˜ ) ρ 1 A 1 ( y ( x ˜ ) , x ˜ ) ) | | | | ( y ( x ) ρ 1 A 1 ( y ( x ) , x ) ) ( y ( x ˜ ) ρ 1 A 1 ( y ( x ˜ ) , x ˜ ) ) | | = | | ( y ( x ) y ( x ˜ ) ) ρ 1 ( A 1 ( y ( x ) , x ) ) A 1 ( y ( x ˜ ) , x ˜ ) ) ) | | | | y ( x ) y ( x ˜ ) | | q q ρ 1 Q 1 + c q ρ 1 q L 1 q 1 q ρ 1 ( μ 1 τ 1 q + ν 1 ) + c q ρ 1 q τ 1 q q | | y ( x ) y ( x ˜ ) | | .

Note that

| | y ( x ) y ( x ˜ ) | | = | | R ( ρ 2 , M 2 ) ( x ρ 2 A 2 ( x , y ( x ) ) ) R ( ρ 2 , M 2 ) ( x ˜ ρ 2 A 2 ( x ˜ , y ( x ˜ ) ) ) | | | | ( x ρ 2 A 2 ( x , y ( x ) ) ) ( x ˜ ρ 2 A 2 ( x ˜ , y ( x ˜ ) ) ) | | = | | ( x x ˜ ) ρ 2 ( A 2 ( x , y ( x ) ) ) A 2 ( x ˜ , y ( x ˜ ) ) ) | | | | x x ˜ | | q q ρ 2 Q 2 + c q ρ 2 q L 2 q 1 q ρ 2 ( μ 2 τ 2 q + ν 2 ) + c q ρ 2 q τ 2 q q | | x x ˜ | | .

Therefore, we obtain

| | P ( x ) - P ( x ̃ ) | | i = 1 2 1 - q ρ i ( - μ i τ i q + ν i ) + c q ρ i q τ i q q | | x - x ̃ | | (1) = i = 1 2 1 - q ρ i ν i + q ρ i μ i τ i q + c q ρ i q τ i q q | | x - x ̃ | | . (2) (3)

From (3.3), this yields that the mapping P is contractive. By Banach contraction principle, there exists a unique x* ∈ E such that P(x*) = x*. Therefore, from Theorem 3.2, there exists an unique (x*, y*) ∈ Ω, where y* = y(x*). This completes the proof. □

Theorem 3.5. Let E be a real q-uniformly smooth Banach space. Let M i : E → 2E be m- accretive mapping, A i : E × EE be α i -strong accretive and Lipschitz continuous in the first variable with constant τ i for i ∈ {1, 2}. If 1-q ρ 2 α 2 + c q ρ 2 q τ 2 q 0, and

0 i = 1 2 ( 1 - q ρ i α i + c q ρ i q τ i q ) < 1 .
(3.4)

Then the solutions set Ω of (SGQVI) is nonempty. Moreover, Ω is a singleton.

Proof. It is easy to know that Theorem 3.5 follows from Remark 2.3 and Theorem 3.4 and so the proof is omitted. This completes the proof. □

In order to show the existence of ρ i , i = 1, 2, we give the following examples.

Example 3.1. Let E be a 2-uniformly smooth space, and let M1, M2, A1 and A2 be the same as Theorem 3.4. Then there exist ρ1, ρ2 > 0 such that (3.3), where

ρ i 0 , 2 ν i - 2 μ i τ i 2 c 2 τ i 2 , ν i > μ i τ i 2 , ( μ i τ i 2 - ν i ) 2 < c 2 τ i 2 , i = 1 , 2 ,

or

ρ i 0 , ν i - μ i τ i 2 - ( ν i - μ i τ i 2 ) 2 - c 2 τ i 2 c 2 τ i 2 ν i - μ i τ i 2 + ( ν i - μ i τ i 2 ) 2 - c 2 τ i 2 c 2 τ i 2 , 2 ν i - 2 μ i τ i 2 c 2 τ i 2 , ν i > μ i τ i 2 , ( μ i τ i 2 - ν i ) 2 c 2 τ i 2 , i = 1 , 2 .

Example 3.2. Let E be a 2-uniformly smooth space, and let M1, M2, A1 and A2 be the same as Theorem 3.5. Then there exist ρ1, ρ2 > 0 such that (3.4), where

ρ i 0 , 2 α i c 2 τ i 2 , α i < τ i c 2 , i = 1 , 2 ,

or

ρ i 0 , α i - α i 2 - c 2 τ i 2 c 2 τ i 2 α i - α i 2 + c 2 τ i 2 c 2 τ i 2 , 2 α i c 2 τ i 2 , α i τ i c 2 , i = 1 , 2 .

4 Algorithms and convergence analysis

In this section, we introduce two-step iterative sequences for the problem (SGQVI) and a non-linear mapping, and then explore the convergence analysis of the iterative sequences generated by the algorithms.

Let T: EE be a nonlinear mapping and the fixed points set F(T) of T be a nonempty set. In order to introduce the iterative algorithm, we also need the following lemma.

Lemma 4.1. Let E be a real q-uniformly smooth Banach space, ρ1, ρ2 be two positive constants. If (x*, y*) ∈ Ω and {x*, y*} ⊂ F(T), then

x * = T R ( ρ 1 , M 1 ) ( y * - ρ 1 A 1 ( y * , x * ) ) , y * = T R ( ρ 2 , M 2 ) ( x * - ρ 2 A 2 ( x * , y * ) ) .
(4.1)

Proof. It directly follows from Theorem 3.1. This completes the proof. □

Now we introduce the following iterative algorithms for finding a common element of the set of solutions to a (SGQVI) problem (2.1) and the set of fixed points of a Lipschtiz mapping.

Algorithm 4.1. Let E be a real q-uniformly smooth Banach space, ρ1, ρ2 > 0, and let T: EE be a nonlinear mapping. For any given points x0, y0E, define sequences {x n } and {y n } in E by the following algorithm:

y n = ( 1 - β n ) x n + β n T R ( ρ 2 M 2 ) , ( x n - ρ 2 A 2 ( x n , y n ) ) , x n + 1 = ( 1 - α n ) x n + α n T R ( ρ 1 M 1 ) ( y n - ρ 1 A 1 ( y n , x n ) ) , n = 0 , 1 , 2 , ,
(4.2)

where {α n } and {β n } are sequences in [0, 1].

Algorithm 4.2. Let E be a real q-uniformly smooth Banach space, ρ1, ρ2 > 0, and let T: EE be a nonlinear mapping. For any given points x0, y0E, define sequences {x n } and {y n } in E by the following algorithm:

y n = T R ( ρ 2 , M 2 ) ( x n - ρ 2 A 2 ( x n , y n ) ) , x n + 1 = ( 1 - α n ) x n + α n T R ( ρ 1 , M 1 ) ( y n - ρ 1 A 1 ( y n , x n ) ) , n = 0 , 1 , 2 , ,

where {α n } is a sequence in [0, 1].

Remark 4.1. If A1 = A2 = A, E = H is a Hilbert space, and M1(x) = M2(x) = ∂ϕ(x) for all xE, where ϕ: ER ∪ {+∞} is a proper, convex and lower semicontinuous functional, and ∂ϕ denotes the subdifferential operator of ϕ, then Algorithm 4.1 is reduced to the Algorithm (I) of [18].

Theorem 4.1. Let E be a real q-uniformly smooth Banach space, and A1, A2, M1 and M2 be the same as in Theorem 3.4, and let T be a κ-Lipschitz continuous mapping. Assume that Ω ∩ F(T) ≠ ∅, {α n } and {β n } are sequences in [0, 1] and satisfy the following conditions:

  1. (i)

    i = 0 α n =;

  2. (ii)

    limn→ ∞β n = 1;

  3. (iii)

    0<κ 1 - q ρ i ν i + q ρ i μ i τ i q + c q ρ i q τ i q q <1,i=1,2.

Then the sequences {x n } and {y n } generated by Algorithm 4.1 converge strongly to x* and y*, respectively, such that (x*, y*) ∈ and {x*, y*} ⊂ F(T).

Proof. Let (x*, y*) ∈ Ω and {x*, y*} ⊂ F(T). Then, from (4.1), one has

x * = T R ( ρ 1 , M 1 ) ( y * - ρ 1 A 1 ( y * , x * ) ) , y * = T R ( ρ 2 , M 2 ) ( x * - ρ 2 A 2 ( x * , y * ) ) .
(4.3)

Since T is a κ-Lipschitz continuous mapping, and from both (4.2) and (4.3), we have

| | x n + 1 - x * | | = | | α n ( T R ( ρ 1 , M 1 ) ( y n - ρ 1 A 1 ( y n , x n ) ) - x * ) + ( 1 - α n ) ( x n - x * ) | | (1) = | | α n ( T R ( ρ 1 , M 1 ) ( y n - ρ 1 A 1 ( y n , x n ) ) - T R ( ρ 1 , M 1 ) ( y * - ρ 1 A 1 ( y * , x * ) ) ) (2) + ( 1 - α n ) ( x n - x * ) | | (3) α n | | T R ( ρ 1 , M 1 ) ( y n - ρ 1 A 1 ( y n , x n ) ) - T R ( ρ 1 , M 1 ) ( y * - ρ 1 A 1 ( y * , x * ) ) | | (4) + ( 1 - α n ) | | x n - x * | | (5) α n κ | | R ( ρ 1 , M 1 ) ( y n - ρ 1 A 1 ( y n , x n ) ) - R ( ρ 1 , M 1 ) ( y * - ρ 1 A 1 ( y * , x * ) ) | | (6) + ( 1 - α n ) | | x n - x * | | (7) α n κ | | ( y n - y * ) - ρ 1 ( A 1 ( y n , x n ) - A 1 ( y * , x * ) ) | | + ( 1 - α n ) | | x n - x * | | . (8) (9) 

For each i ∈ {1, 2}, A i : E × EE are (μ i , ν i )-relaxed cocoercive and Lipschitz continuous in the first variable with constant τ i , then

L ̃ 1 = | | A 1 ( y n , x n ) - A 1 ( y * , x * ) | | q (1) τ 1 q | | y n - y * | | q , (2) Q ̃ 1 = A 1 ( y n , x n ) - A 1 ( y * , x * ) , J q ( y n - y * ) (3) ( - μ 1 ) | | A 1 ( y n , x n ) - A 1 ( y * , x * ) | | q + ν 1 | | y n - y * | | q (4) - μ 1 τ 1 q | | y n - y * | | q + ν 1 | | y n - y * | | q (5) = ( - μ 1 τ 1 q + ν 1 ) | | y n - y * | | q , (6) L ̃ 2 = | | A 2 ( x n , y n ) - A 2 ( x * , y * ) | | q (7) τ 2 q | | x n - x * | | q , (8) (9)

and so

Q ̃ 2 = A 2 ( x n , y n ) - A 2 ( x * , y * ) , J q ( x n - x * ) (1) ( - μ 2 ) | | A 2 ( x n , y n ) - A 2 ( x * , y * ) | | q + ν 2 | | x n - x * | | q (2) - μ 2 τ 2 q | | x n - x * | | q + ν 2 | | x n - x * | | q (3) = ( - μ 2 τ 2 q + ν 2 ) | | x n - x * | | q . (4) (5)

Furthermore, by Lemma 2.1, one can obtain

| | ( y n - y * ) - ρ 1 ( A 1 ( y n , x n ) - A 1 ( y * , x * ) ) | | = | | y n - y * | | q - q ρ 1 Q ̃ 1 + c q ρ 1 q L ̃ 1 q (1) 1 - q ρ 1 ( - μ 1 τ 1 q + ν 1 ) + c q ρ 1 q τ 1 q q | | y n - y * | | (2) = 1 - q ρ 1 ν 1 + q ρ 1 μ 1 τ 1 q + c q ρ 1 q τ 1 q q | | y n - y * | | (3) (4) 

and consequently,

| | ( x n - x * ) - ρ 2 ( A 2 ( x n , y n ) - A 2 ( x * , y * ) ) | | = | | x n - x * | | q - q ρ 2 Q ̃ 2 + c q ρ 2 q L ̃ 2 q (1) 1 - q ρ 2 ν 2 + q ρ 2 μ 2 τ 2 q + c q ρ 2 q τ 2 q q | | x n - x * | | . (2) (3) 

Note that

| | y n - y * | | = | | ( 1 - β n ) ( x n - y * ) + β n ( T R ( ρ 2 , M 2 ) ( x n - ρ 2 A 2 ( x n , y n ) ) - T y * ) | | (1) ( 1 - β n ) | | x n - y * | | + β n | | T R ( ρ 2 , M 2 ) ( x n - ρ 2 A 2 ( x n , y n ) ) - T y * | | (2) ( 1 - β n ) | | x n - y * | | + β n κ | | R ( ρ 2 , M 2 ) ( x n - ρ 2 A 2 ( x n , y n ) ) - y * | | (3) = β n κ | | R ( ρ 2 , M 2 ) ( x n - ρ 2 A 2 ( x n , y n ) ) - R ( ρ 2 , M 2 ) ( x * - ρ 2 A 2 ( x * , y * ) ) | | (4) + ( 1 - β n ) | | x n - y * | | (5) β n κ | | ( x n - x * ) - ρ 2 ( A 2 ( x n , y n ) - A 2 ( x * , y * ) ) | | + ( 1 - β n ) | | x n - y * | | (6) β n κ 1 - q ρ 2 ν 2 + q ρ 2 μ 2 τ 2 q + c q ρ 2 q τ 2 q q | | x n - x * | | + ( 1 - β n ) | | x n - y * | | (7) ( β n κ 1 - q ρ 2 ν 2 + q ρ 2 μ 2 τ 2 q + c q ρ 2 q τ 2 q q + 1 - β n ) | | x n - x * | | + ( 1 - β n ) | | x * - y * | | . (8) (9) 

Therefore, we have

| | x n + 1 x * | | α n κ | | ( y n y * ) ρ 1 ( A 1 ( y n , x n ) A 1 ( y * , x * ) ) | | + ( 1 α n ) | | x n x * | | α n κ 1 q ρ 1 ν 1 + q ρ 1 μ 1 τ 1 q + c q ρ 1 q τ 1 q q | | y n y * | | + ( 1 α n ) | | x n x * | | [ α n κ 1 q ρ 1 ν 1 + q ρ 1 μ 1 τ 1 q + c q ρ 1 q τ 1 q q ( β n κ 1 q ρ 2 ν 2 + q ρ 2 μ 2 τ 2 q + c q ρ 2 q τ 2 q q + 1 β n ) + 1 α n ] | | x n x * | | + α n κ ( 1 β n ) 1 q ρ 1 ν 1 + q ρ 1 μ 1 τ 1 q + c q ρ 1 q τ 1 q q | | x * y * | | .

Set ι=max { 1 - q ρ i ν i + q ρ i μ i τ i q + c q ρ i q τ i q q : i = 1 , 2 } . So the above inequality can be written as follows:

| | x n + 1 - x * | | { 1 - α n [ 1 - κ ι ( 1 - β n ( 1 - κ ι ) ) ] } | | x n - x * | | + α n κ ι ( 1 - β n ) | | x * - y * | | .
(4.4)

Taking a n = ||x n - x*||, λ n = α n [1 - κι(1 - β n (1 - κι))] and b n = α n κι(1 n ) ||x* - y*||. By the condition (iii), we get

1 > κ ι , 1 > λ n > α n ( 1 - κ ι ) , n Z + .
(4.5)

In addition, from the conditions (i) and (ii), it yields that b n = 0(λ n ) and

n = 0 λ n = .

Therefore, by Lemma 2.2, we obtain

lim n a n = 0 ,
(4.6)

that is, x n x* as n → ∞. Again from limn → ∞β n = 1 and (4.6), one concludes

lim n | | y n - y * | | = 0 ,

i.e., y n y* as n → ∞. Thus (x n , y n ) converges strongly to (x*, y*). This completes the proof. □

Theorem 4.2. Let E be a real q-uniformly smooth Banach space, and A1, A2, M1 and M2 be the same as in Theorem 3.5, and let T be a κ-Lipschitz continuous mapping. Assume that Ω ∩ F(T) ≠ ∅, {α n } and {β n } are sequences in [0, 1] and satisfy the following conditions:

  1. (i)

    i = 0 α n =;

  2. (ii)

    limn→ ∞β n = 1;

  3. (iii)

    0<κ 1 - q ρ i α i + c q ρ i q τ i q q <1,i=1,2.

Then the sequences {x n } and {y n } generated by Algorithm 4.1 converge strongly to x* and y*, respectively, such that (x*, y*) ∈ Ω and {x*, y*} ⊂ F(T).

Proof. The proof is similar to the proof of Theorem 4.1 and so the proof is omitted. This completes the proof. □

Theorem 4.3. Let E be a real q-uniformly smooth Banach space, and A1, A2, M1 and M2 be the same as in Theorem 3.4, and let T be a κ-Lipschitz continuous mapping. Assume that Ω ∩ F(T) ≠ ∅, {α n } is a sequence in (0, 1] and satisfy the following conditions:

  1. (i)

    i = 0 α n =;

  2. (ii)

    0<κ 1 - q ρ i ν i + q ρ i μ i τ i q + c q ρ i q τ i q q <1,i=1,2.

Then the sequences {x n } and {y n } generated by Algorithm 4.2 converge strongly to x* and y*, respectively, such that (x*, y*) ∈ Ω and {x*, y*} ⊂ F(T). Furthermore, sequences {x n } and {y n } are at least linear convergence.

Proof. From the proof of Theorem 4.1, it is easy to know that the sequences {x n } and {y n } generated by Algorithm 4.2 converge strongly to x* and y*, respectively, such that (x*, y*) ∈ Ω and {x*, y*} ⊂ F(T), and so,

| | x n + 1 - x * | | [ 1 - α n ( 1 - ( κ ι ) 2 ) ] | | x n - x * | | ,
(4.7)
| | y n - y * | | κ 1 - q ρ 2 ν 2 + q ρ 2 μ 2 τ 2 q + c q ρ 2 q τ 2 q q | | x n - x * | | .
(4.8)

Since {α n } is a sequence in (0, 1], we obtain, from (4.5),

0 < 1 - α n ( 1 - ( κ ι ) 2 ) < 1
(4.9)

and so,

0 < κ 1 - q ρ 2 ν 2 + q ρ 2 μ 2 τ 2 q + c q ρ 2 q τ 2 q q < 1 .
(4.10)

Therefore, from (4.7)-(4.10), it implies that sequences {x n } and {y n } are at least linear convergence. This completes the proof. □

Theorem 4.4. Let E be a real q-uniformly smooth Banach space, and A1, A2, M1 and M2 be the same as in Theorem 3.5, and let T be a κ-Lipschitz continuous mapping. Assume that Ω ∩ F(T) ≠ ∅, {α n } is a sequence in (0, 1] and satisfy the following conditions:

  1. (i)

    i = 0 α n =;

  2. (ii)

    limn→∞β n = 1;

  3. (iii)

    0<κ 1 - q ρ i α i + c q ρ i q τ i q q <1,i=1,2.

Then the sequences {x n } and {y n } generated by Algorithm 4.2 converge strongly to x* and y*, respectively, such that (x*, y*) ∈ Ω and {x*, y*} ⊂ F(T). Furthermore, sequences {x n } and {y n } are at least linear convergence.

Proof. In a way similar to the proof of Theorem 4.2, with suitable modifications, we can obtain that the conclusion of Theorem 4.4 holds. This completes the proof. □

Remark 4.2. Theorem 4.1 generalizes and improves the main result in [18].