Skip to main content
Springer logoLink to Springer
. 2017 Apr 20;2017(1):81. doi: 10.1186/s13660-017-1351-x

Approximation solution for system of generalized ordered variational inclusions with ⊕ operator in ordered Banach space

Mohd Sarfaraz 1, MK Ahmad 1, A Kılıçman 2,✉
PMCID: PMC5397663  PMID: 28479833

Abstract

The resolvent operator approach is applied to address a system of generalized ordered variational inclusions with ⊕ operator in real ordered Banach space. With the help of the resolvent operator technique, Li et al. (J. Inequal. Appl. 2013:514, 2013; Fixed Point Theory Appl. 2014:122, 2014; Fixed Point Theory Appl. 2014:146, 2014; Appl. Math. Lett. 25:1384-1388, 2012; Fixed Point Theory Appl. 2013:241, 2013; Eur. J. Oper. Res. 16(1):1-8, 2011; Fixed Point Theory Appl. 2014:79, 2014; Nonlinear Anal. Forum 13(2):205-214, 2008; Nonlinear Anal. Forum 14: 89-97, 2009) derived an iterative algorithm for approximating a solution of the considered system. Here, we prove an existence result for the solution of the system of generalized ordered variational inclusions and deal with a convergence scheme for the algorithms under some appropriate conditions. Some special cases are also discussed.

Keywords: algorithm, convergence, resolvent, solution, system, ordered Banach space

Introduction

The theory of variational inequalities (inclusions) is quite application oriented and thus developed much in recent years in many different disciplines. This theory provides us with a framework to understand and solve many problems arising in the field of economics, optimization, transportation, elasticity and applied sciences. A lot of work considered with the ordered variational inequalities and ordered equations was done by Li et al.; see [4, 6, 8, 9].

The fundamental goal in the theory of variational inequality is to develop a streamline algorithm for solving a variational inequality and its various forms. These methods include the projection method and its novel forms, approximation techniques, Newton’s methods and the methods derived from the auxiliary principle techniques.

It is widely known that the projection technique cannot be applied to solve variational inclusion problems and thus one has to use resolvent operator techniques to solve them. The beauty of the iterative methods involving the resolvent operator is that the resolvent step involves the maximal monotone operator only, while other parts facilitate the problem’s decomposition. Most of the problems related to variational inclusions are solved by maximal monotone operators and their generalizations such as H-accretivity [10], H-monotonicity [11] and many more; see e.g., [12–17] and the references therein.

Essentially, using the resolvent technique, one can show that the variational inclusions are commensurate to the fixed point problems. This equivalent formation has played a great job in designing some exotic techniques for solving variational inclusions and related optimization problems.

We initiate a study of a system of generalized ordered variational inclusions in real ordered Banach space. We design an iterative algorithm based on the resolvent operator for solving system of generalized ordered variational inclusions. We prove an existence as well as a convergence result for our problem. For more details of related work, we refer to [2, 18] and the references therein.

Prelude

In the paper, assume that X be a real ordered Banach space endowed with norm ∥⋅∥, an inner product 〈⋅,⋅〉, a zero element θ and partial order ≤ defined by the normal cone C with a normal constant λC. The greatest lower bound and least upper bound for the set {p,q} with partial order relation ≤ are denoted by glb{p,q} and lub{p,q}, respectively. Assume that glb{p,q} and lub{p,q} both exist.

The following well-known definitions and results are essential to achieve the goal of this paper.

Definition 2.1

Let C (≠ϕ) be a closed, convex subset of X. C is said to be a cone if

  • (i)

    for p∈C and λ>0, λp∈C;

  • (ii)

    if p and −p∈C, then p=θ.

Definition 2.2

[19]

C is called a normal cone iff there exists a constant λC>0 such that 0≤p≤q implies ∥p∥≤λC∥q∥, where λC is called the normal constant of C.

Definition 2.3

For arbitrary elements p,q∈X, p≤q iff p−q∈C, then the relation ≤ is a partial ordered relation in X. The real Banach space X endowed with the ordered relation ≤ defined by C is called an ordered real Banach space.

Definition 2.4

[20]

For arbitrary elements p,q∈X, if p≤q (or q≤p) holds, then p and q are called comparable to each other and this is denoted by p∝q.

Definition 2.5

[18]

A map A:X→X is called a β-ordered comparison map, if it is a comparison mapping and

A(p)⊕A(q)≤β(p⊕q),for 0<β<1.

Lemma 2.1

[19]

If p and q are comparable to each other, then lub{p,q} and glb{p,q} exist, p−q∝q−p, and θ≤(p−q)∨(q−p).

Lemma 2.2

[19]

Let C be a normal cone with normal constant λC in X, then for each p,q∈X, we have the relations:

  • (i)

    ∥θ⊕θ∥=∥θ∥=θ;

  • (ii)

    ∥p∧q∥≤∥p∥∧∥q∥≤∥p∥+∥q∥;

  • (iii)

    ∥p⊕q∥≤∥p−q∥≤λC∥p⊕q∥;

  • (iv)

    if p∝q, then ∥p⊕q∥=∥p−q∥.

Lemma 2.3

[1, 4–6]

Let ≤ be a partial order relation defined by the cone C with a normal constant λC in X in Definition  2.3. Then hereinafter relations survive:

  1. p⊕q=q⊕p, p⊕p=θ;

  2. θ≤p⊕θ;

  3. allow λ to be real, then (λp)⊕(λq)=|λ|(p⊕q);

  4. if p, q and w can be comparative to each other, then (p⊕q)≤(p⊕w)+(w⊕q);

  5. presume (p+q)∨(s+t) exists, and if p∝s,t and q∝s,t, then (p+q)⊕(s+t)≤(p⊕s+q⊕t)∧(p⊕t+q⊕s);

  6. if p, q, r, w can be compared with each other, then (p∧q)⊕(r∧w)≤((p⊕r)∨(q⊕w))∧((p⊕w)∨(q⊕r));

  7. if p≤q and s≤t, then p+s≤q+t;

  8. if p∝θ, then −p⊕θ≤p≤p⊕θ;

  9. if p∝q, then (p⊕θ)⊕(q⊕θ)≤(p⊕q)⊕θ=p⊕q;

  10. (p⊕θ)−(q⊕θ)≤(p−q)⊕θ;

  11. if θ≤p and p≠θ, and α>0, then θ≤αp and αp≠θ, for all p,q,r,s,t,w∈X and α,λ∈R.

Definition 2.6

[4]

Allow A:X→X to be a single-valued map.

  1. A is called a γ-order non-extended mapping if there exists a constant γ>0 such that
    γ(p⊕q)≤A(p)⊕A(q),for all p,q∈X;
  2. A is called a strongly comparison map if it is a comparison mapping and A(p)∝A(q) iff p∝q, for all p,q∈X.

Definition 2.7

[7]

Allow A:X→X and M:X→2X to be single-valued and set-valued mappings, respectively.

  1. M is called a weak-comparison map, if for tp∈M(p), p∝tp, and if p∝q, then ∃tp∈M(p) and tq∈M(q) such that tp∝tq, for all p,q∈X;

  2. M is called an α-weak-non-ordinary difference map associated with A, if it is weak comparison and for each p,q∈X, ∃α>0 and tp∈M(A(p)) and tq∈M(A(q)) such that
    (tp⊕tq)⊕α(A(p)⊕A(q))=θ;
  3. M is called a λ-order different weak-comparison map associated with A if ∃ a λ>0, for all p,q∈X and there exist tp∈M(A(p)), tq∈M(A(q)) such that
    λ(tp−tq)∝p−q;
  4. M, a weak-comparison map, is called an ordered (αA,λ)-weak-ANODM map, if it is an α-weak-non-ordinary difference map and a λ-order different weak-comparison map associated with A, and (A+λM)(X)=X, for α,λ>0.

Definition 2.8

[7]

Let A:X→X and M:X→2X be a γ-order non-extended map and an α-non-ordinary difference mapping with respect to A, respectively. The resolvent operator RA,λM:X→X associated with both A and M is defined by

RA,λM(p)=(A+λM)−1(p),for all p∈X, 1

where γ,α,λ>0 are constants.

Definition 2.9

[8]

A map A:X×X→X is called (α1,α2)-restricted-accretive map, if it is comparison and ∃ constants 0≤α1,α2≤1 such that

(A(p,⋅)+I(p))⊕(A(q,⋅)+I(q))≤α1(A(p,⋅)⊕A(q,⋅))+α2(p⊕q),for all p,q∈X,

where I is the identity map on X.

Lemma 2.4

[7]

If M:X→2X and A:X→X are an α-weak-non-ordinary difference map associated with A and a γ-order non-extended map, respectively, with αλ≠1, then Mθ={θ⊕p∣p∈M} is an α-weak-non-ordinary difference map associated with A and the resolvent operator RA,λMθ=(A+λMθ)−1 of (A+λMθ) is a single-valued for α,λ>0, i.e., RA,λMθ:X→X of Mθ holds.

Lemma 2.5

[7]

Let M:X→2X and A:X→X be a (αA,λ)-weak-ANODD set-valued map and a strongly comparison map associated with RA,λM, respectively. Then the resolvent operator RA,λM:X→X is a comparison map.

Lemma 2.6

[7]

Let M:X→2X be an ordered (αA,λ)-weak-ANODD map and A:X→X be a γ-ordered non-extended map associated with RA,λM, for αA>1λ, respectively. Then the following relation holds:

RA,λM(p)⊕RA,λM(q)≤1γ(αAλ−1)(p⊕q),for all p,q∈X. 2

Formulation of the problem and existence results

Allow X to be a real ordered Banach space and C a normal cone having the normal constant λC. Let M,N:X×X→2X be set-valued mappings. Suppose fi,gi:X→X (i=1,2) and F1,F2:X×X→X are single-valued mappings. Now we look at the problem:

For some (w1,w2)∈X×X and ρ>0, find (p,q)∈X×X such that

{w1∈F1(f1(p),q)+ρM(g1(p),q),w2∈F2(p,f2(q))⊕N(p,g2(q)). 3

This problem is called a system of generalized implicit ordered variational inclusions (in short SGIOVI). Here, we discuss some special cases of SGIOVI (3).

  1. If ρ=1, g1=I (the identity mapping on X), f2=I and M and N are single-valued mappings and M(g1(p),q)=M(q,p), then problem (3) reduces to the problem as for w1,w2∈X, find p,q∈X such that
    {w1≤F1(f1(p),q)+M(q,p),w2≤F2(p,q)⊕N(p,g(q)). 4
    Problem (4) was initiated and studied by [1].
  2. If w1,w2=0, ρ=1, F2=f2=N=g2=0, g1=I, M is a single-valued mapping, then problem (3) is to find p,q∈X such that
    0≤F1(f1(p),q)+M(q,p). 5
    Problem (5) was initiated and studied by [21].
  3. If w2=0, F2=f2=N=g2=0, g1=I, F1(f1(p),q)=f1(p) and M(g1(p),q)=M(p), then problem (3) became the problem to find p∈X such that
    w1∈f(p)+ρM(p). 6
    Problem (6) was initiated and studied by [7].
  4. If ρ,w1=0, F1=f1=g1=M=0, f2=g2=I, F2(p,f2(q))=F2(p) and N(p,g2(q))=N(p), then problem (3) is converted to the problem of finding p∈X such that
    w2∈F2(p)⊕N(p). 7
    Problem (7) was initiated and studied by [5].
  5. If F1=f1=F2=f2=N=g2=0, w2=0, g1=I and M(g1(p),q)=M(p), then the problem (3) converted to the problem of finding p∈X such that
    w1∈ρM(p). 8
    Problem (8) was initiated and studied by [3].

Now, we mention the fixed point formulation of SGIOVI (3).

Lemma 3.1

The set of elements (p,q)∈X×X become a solution of SGIOVI (3) iff (p,q)∈X×X fulfill the relations:

p=RA,λM(g1(⋅),q)[A(p)+λρ(w1−F1(f1(p),q))],q=RA,λN0(p,g2(⋅))[A(q)+λ(w2⊕F2(p,f2(q)))].

Proof

The proof follows from the definition of the resolvent operator (1). □

Main results

In this section, we present an existence result for the system of generalized implicit ordered variational inclusions (in short SGIOVI), under some apt conditions.

Theorem 4.1

Let C be a normal cone having a normal constant λC in a real ordered Banach space X. Let A,f1,f2,g1,g2:X→X be single-valued mappings such that A is a λA-compression mapping, f1 is a λf1-compression and f2 is a λf2-compression and g1, g2 are comparison mappings, respectively. Let F1,F2:X×X→X be single-valued mappings such that F1 is an (α1,α2)-restricted-accretive mapping w.r.t. f1 and F2 is an (α1′,α2′)-restricted-accretive mapping w.r.t. f2, respectively. Suppose M,N0:X×X→2X are the set-valued mappings such that M is a (αA,λ)-weak-ANODD set-valued mapping and N0 is a (αA′,λ)-weak-ANODD set-valued mapping, respectively.

In addition, if pi∝qi, RA,λ1M(pi)∝RA,λ1M(qi), RA,λ2N0(pi)∝RA,λ2N0(qi) and for all λ1,λ2,δ1,δ2>0, the following conditions are satisfied:

RA,λ1N(p1,g2(⋅))(q1)⊕RA,λ2N(p2,g2(⋅))(q1)≤δ1(p1⊕p2),RA,λ1M(g1(⋅),q1)(p1)⊕RA,λ2M(g2(⋅),q2)(p1)≤δ2(q1⊕q2), 9

and

λC(λAμ1+λα1′μ2+δ2)<1−(λCμ1λα1λf1ρ),λC(λA′μ2+λα2λf2λα2′+δ1)<1−(λCμ1λα2ρ). 10

Then the SGIOVI (3) grants a solution (p,q)∈X×X.

Proof

By Lemma 2.6, we know that the resolvent operator RA,λM(⋅) and RA,λN0(⋅) are μ1-Lipschitz continuous and μ2-Lipschitz continuous, respectively.

Here μ1=1γ1(αAλ−1) and μ2=1γ2(αA′λ−1).

Now, define a map G:X×X→X×X by

G(p,q)=(T(p,q),S(p,q)),∀(p,q)∈X×X, 11

where T:X×X→X and S:X×X→X are the mappings defined as

T(p,q)=RA,λM(g1(⋅),q)[A+λρ(w1−F1(f1(⋅),q))](p), 12
S(p,q)=RA,λN0(p,g2(⋅))[A+λ(w2⊕F2(p,f2(⋅)))](q). 13

For any pi,qi∈X and pi∝qj (i,j=1,2). By using (12), Definition 2.5, Definition 2.9, Lemma 2.6 and Lemma 2.3, we have

0≤T(p1,q1)⊕T(p2,q2)=RA,λM(g1(⋅),q1)[A+λρ(w1−F1(f1(⋅),q1))](p1)⊕RA,λM(g1(⋅),q2)[A+λρ(w1−F1(f1(⋅),q2))](p2)≤RA,λM(g1(⋅),q1)[A+λρ(w1−F1(f1(⋅),q1))](p1)⊕RA,λM(g1(⋅),q1)[A+λρ(w1−F1(f1(⋅),q2))](p2)⊕RA,λM(g1(⋅),q1)[A+λρ(w1−F1(f1(⋅),q2))](p2)⊕RA,λM(g1(⋅),q2)[A+λρ(w1−F1(f1(⋅),q2))](p2)≤μ1[A(p1)⊕A(p2)+λρ(F1(f1(p1),q1)⊕F1(f1(p2),q2))]⊕δ2(q1⊕q2)≤μ1[λA(p1⊕q2)+λρ(α1(f1(p1)⊕f2(p2))+α2(q1⊕q2))]⊕δ2(q1⊕q2)≤μ1[λA(p1⊕p2)+λρ(α1λf1(p1⊕p2)+α2(q1⊕q2))]⊕δ2(q1⊕q2)=μ1[(λA+λα1λf1ρ)(p1⊕p2)+λα2ρ(q1⊕q2)]⊕δ2(q1⊕q2)≤[μ1(λAρ+λα1λf1ρ)(p1⊕p2)+(μ1λα1ρ)(q1⊕q2)]⊕δ2(q1⊕q2)=[μ1(λAρ+λα1λf1ρ)(p1⊕p2)+(μ1λα1ρ)(q1⊕q2)]⊕δ2(q1⊕q2). 14

By Definition 2.2 and Lemma 2.2, we have

∥T(p1,q1)⊕T(p2,q2)∥=∥T(p1,q1)−T(p2,q2)∥∥T(p1,q1)⊕T(p2,q2)∥≤λC∥[μ1(λAρ+λα1λf1ρ)(p1⊕p2)∥T(p1,q1)⊕T(p2,q2)∥=+(μ1λα1ρ)(q1⊕q2)]⊕δ1(q1⊕q2)∥∥T(p1,q1)⊕T(p2,q2)∥=λC∥[μ1(λAρ+λα1λf1ρ)(p1⊕p2)∥T(p1,q1)⊕T(p2,q2)∥=+(μ1λα1ρ)(q1⊕q2)]−δ1(q1⊕q2)∥,∥T(p1,q1)⊕T(p2,q2)∥≤λC∥[μ1(λAρ+λα1λf1ρ)(p1⊕p2)∥T(p1,q1)⊕T(p2,q2)∥≤+(μ1λα1ρ)(q1⊕q2)]∥+λCδ1(∥q1⊕q2∥)∥T(p1,q1)⊕T(p2,q2)∥≤λCμ1(λAρ+λα1λf1ρ)∥p1−p2∥∥T(p1,q1)⊕T(p2,q2)∥≤+λC(μ1λα2+δ1ρρ)∥q1−q2∥.

That is,

∥T(p1,q1)−T(p2,q2)∥≤λCμ1(λAρ+λα1λf1ρ)∥p1−p2∥+λC(μ1λα2+δ1ρρ)∥q1−q2∥. 15

For any pi,qj∈X, pi∝qj (i,j=1,2), and by using (13), Definition 2.5, Definition 2.6, Lemma 2.3 and Lemma 2.6, we have

0≤S(p1,q1)⊕S(p2,q2)=(RA,λN0(p1,g2(⋅))[A+λ(w2⊕F2(p1,f2(⋅)))](q1)⊕RA,λN0(p2,g2(⋅))[A+λ(w2⊕F2(p2,f2(⋅)))](q2))≤(RA,λN0(p1,g2(⋅))[A+λ(w2⊕F2(p1,f2(⋅)))](q1)⊕RA,λN0(p1,g2(⋅))[A+λ(w2⊕F2(p2,f2(⋅)))](q2))⊕(RA,λN0(p1,g2(⋅))[A+λ(w2⊕F2(p2,f2(⋅)))](q2)⊕RA,λN0(p2,g2(⋅))[A+λ(w2⊕F2(p2,f2(⋅)))](q2))≤μ2[(A(q1)+λ(w2⊕F2(p1,f2(q1))))⊕(A(q2)+λ(w2⊕F2(p2,f2(q2))))]⊕δ1(p1⊕p2)≤μ2[A(q1)⊕A(q2)+λ(F2(p1,f2(q1))⊕F2(p2,f2(q2)))]⊕δ1(p1⊕p2)≤μ2[λA(q1⊕q2)+λ(α1′(p1⊕p2)+α2′λf2(q1⊕q2))]⊕δ1(p1⊕p2)=μ2[(λA+λα2′λf2)(q1⊕q2)+λα1′(p1⊕p2)]⊕δ1(p1⊕p2). 16

By Definition 2.2 and Lemma 2.2, we have

∥S(p1,q1)⊕S(p2,q2)∥=∥S(p1,q1)−S(p2,q2)∥≤λC∥[μ2λA+λα2′λf2(q1⊕q2)+μ2λα1′(p1⊕p2)]⊕δ2(p1⊕p2)∥≤λC∥μ2λA+λα2′λf2(q1⊕q2)+μ2λα1′(p1⊕p2)∥+λCδ2∥p1−p2∥≤λCμ2(λA+λα2′λf2)∥q1−q2∥+λC(μ2λα1′+δ2)∥p1−p2∥.

That is,

∥S(p1,q1)−S(p2,q2)∥≤λCμ2(λA+λα2′λf2)∥q1−q2∥+λC(μ2λα1′+δ2)∥p1−p2∥. 17

From (15) and (17), we have

∥T(p1,q1)−T(p2,q2)∥+∥S(p1,q1)−S(p2,q2)∥≤λCμ1(λAρ+λα1λf1ρ)∥p1−p2∥+λC(μ1λα2+δ1ρρ)∥q1−q2∥+λCμ2(λA′+λα2′λf2)∥q1−q2∥+λC(μ2λα1′+δ2)∥p1−p2∥=[(λAρ+λα1λf1ρ)+λC(μ2λα1′+δ2)]∥p1−p2∥+[λC(μ1λα2+δ1ρρ)+λCμ2(λA′+λα2′λf2)]∥q1−q2∥=Ω1∥p1−p2∥+Ω2∥p1−p2∥≤max{Ω1,Ω2}(∥p1−p2∥+∥q1−q2∥), 18

where

Ω1=[λC(λAρ+λα1λf1ρ)+λC(μ2λα1′+δ2)]

and

Ω2=[λC(μ1λα2+δ1ρρ)+λCμ2(λA′+λα2′λf2)].

Now, we define ∥(p,q)∥∗ on X×X by

∥(p,q)∥∗=∥p∥+∥q∥,∀(p,q)∈X×X. 19

One can easily show that (X×X,∥⋅∥∗) is a Banach space. Hence from (11), (18) and (19), we have

∥G(p1,q1)−G(p2,q2)∥∗≤max{Ω1,Ω2}(∥p1−p2∥+∥q1−q2∥). 20

By (10), we know that max{Ω1,Ω2}<1. It follows from (20) that G is a contraction. Hence ∃ unique (p,q)∈X×X such that

G(p,q)=(p,q).

This leads to

p=RA,λM(g1(⋅),q)[A+λρ(w1−F1(f1(⋅),q))](p)

and

q=RA,λN0(p,g2(⋅))[A+λ(w2⊕F2(p,f2(⋅)))](q).

It is determined by Lemma 3.1 that (p,q) is a solution of SGIOVI (3). □

Convergence analysis and iterative algorithm

This part of the article is associated with the construction of an iterative scheme as well as the strong convergence of the sequences achieved by the said scheme to the exact solution of SGIOVI (3).

Allow C to be a normal cone with the normal constant λC in a real ordered Banach space X. Let M:X×X→2X and N:X×X→2X be set-valued maps. Assume that f1,f2,g1,g2:X→X and F1,F2:X×X→X are single-valued maps.

For the initial guess (p0,q0)∈X×X, assume that p0∝p1, q0∝q1. We define an iterative sequence {(pn,qn)} and let pn+1∝pn, qn+1∝qn such that

pn+1=αnpn+(1−αn)RA,λM(g1(⋅),qn)[A(⋅)+λρ(w1−F1(f1(⋅),qn))](pn), 21
qn+1=αnqn+(1−αn)RA,λN0(pn,g2(⋅))[A(⋅)+λ(w2⊕F2(pn,g2(⋅)))](qn). 22

For n=0,1,2,3,… , where 0≤αn<1 with lim supnαn<1.

Lemma 5.1

[17]

Allow {ϑn} and ςn to be sequences of nonnegative real numbers such that they satisfy

  • (i)

    0≤ςn<1, n=0,1,2,… and lim supnςn<1;

  • (ii)

    ϑn+1≤ςnϑn, n=0,1,2,… .

Then {ϑn} approaches zero as n moves to ∞.

Theorem 5.2

Allow X, C, M, N, N0, f1, f2, g1, g2, F1 and F2 to be as in Theorem  4.1 such that all the assertions of Theorem  4.1 are valid. Then the sequence {(pn,qn)} formulated by Algorithm (21) and (22) converges strongly to the unique solution {(p,q)} of SGIOVI (3).

Proof

By Theorem 4.1, the SGIOVI (3) admits a unique solution (p,q). It follows from Lemma 3.1 that

p=αnp+(1−αn)RA,λM(g1(⋅),q)[A(⋅)+λ(w1−F1(f1(⋅),q))](p) 23

and

q=αnq+(1−αn)RA,λN0(p,g2(⋅))[A(⋅)+λ(w2⊕F2(p,g2(⋅)))](q). 24

By (21), (23) and Lemma 2.3, we get

0≤pn+1⊕p=αnpn+(1−αn)RA,λM(g1(⋅),qn)[A(⋅)+λ(w1−F1(f1(⋅),qn))]pn⊕αnp+(1−αn)RA,λM(g1(⋅),q)[A(⋅)+λ(w1−F1(f1(⋅),q))](p)=αn(pn⊕p)+(1−αn)[RA,λM(g1(⋅),qn)[A(pn)+λ(w1−F1(f1(pn),qn))]⊕RA,λM(g1(⋅),q)[A(p)+λ(w1−F1(f1(p),q))]]. 25

By using the same argument as in Theorem 4.1, for (14), we have

∥pn+1⊕p∥=∥pn+1−p∥≤αn∥pn−p∥+(1−αn)[λCμ1(λAρ+λα1λf1)ρ∥pn−p∥+λC(μ1λα2+δ1ρ)ρ∥qn−q∥]=(αn+(1−αn)λCμ1(λAρ+λα1λf1)ρ)∥pn−p∥+(λC(1−αn)(μ1λα2+δ1ρ)ρ)∥qn−q∥. 26

Similarly, it follows from (22) and (24) that

0≤qn+1⊕qn=(αnqn+(1−αn)RA,λN0(pn,g2(⋅))[A(qn)+λ(w2⊕F2(pn,g2(qn)))]⊕αnq+(1−αn)RA,λN0(p,g2(⋅))[A(q)+λ(w2⊕F2(p,g2(q)))])≤αn(qn⊕q)+(1−αn)(RA,λN0(pn,g2(⋅))[A(qn)+λ(w2⊕F2(pn,g2(qn)))]⊕RA,λN0(p,g2(⋅))[A(q)+λ(w2⊕F2(p,g2(q)))]). 27

Importing the same logic as in Theorem 4.1 for (16), we have

∥qn+1⊕q∥=∥qn+1−q∥≤(αn+λCμ2(λA′+λα2′λf2)∥qn−q∥+λC(1−αn)((μ2λα1′+δ2))∥pn−p∥). 28

From (26) and (28) we have

∥pn+1−p∥+∥qn+1−q∥≤[(αn+(1−αn)λCμ1(λAρ+λα1λf2)ρ)∥pn−p∥]+(λC(1−αn)(μ1λα2+δ1ρ)ρ)∥qn−q∥+(αn+μ2λC(λA′+λα2′λf2))∥qn−q∥+λC(1−αn)(μ2λαn′+δ2)∥pn−p∥=αn(∥pn−p∥+∥qn−q∥)+(1−αn)[(λCμ1(λAρ+λα1λf1)ρ+λC(μ2+λα1′λ))]∥pn−p∥+(1−αn)[(λC(μ1λα2+δ1ρ)ρ+λCμ2(λA′+λα2′λf2))∥qn−q∥]=αn(∥pn−p∥+∥qn−q∥)+(1−αn)(Ω1∥pn−p∥+Ω2∥qn−q∥). 29

By (10), we know that max{Ω1,Ω2}<1. Then (29) becomes

∥pn+1−p∥+∥qn+1−q∥≤αn(∥pn−p∥+∥qn−q∥)+(1−αn)Ω(∥pn−p∥+∥qn−q∥), 30

where Ω=max{Ω1,Ω2} and Ω1=[λC(λAρ+λα1λf1ρ)+λC(μ2λα1′+δ2)], Ω2=[λC(μ1λα2+δ1ρρ)+λCμ2(λA′+λα2′λf2)]. Let ϑn=(∥pn−p∥+∥qn−q∥) and ςn=Ω+(1−Ω)αn, then (30) can be rewritten as

ϑn+1≤ςnϑn,n=0,1,2,….

Choosing ςn, we know that lim supnςn<1. It follows from Lemma 5.1 that 0≤ςn≤1. Therefore, {(pn,qn)} converge strongly to the unique solution {(p,q)} of the SGIOVI (3). □

Conclusion

System of generalized ordered variational inclusions can be viewed as natural and innovative generalizations of the system of generalized ordered variational inequalities. Two of the most difficult and important problems related to inclusions are the establishment of generalized inclusions and the development of an iterative algorithm. In this article, a system of generalized ordered variational inclusions is introduced and studied which is more general than many existing systems of ordered variational inclusions in the literature. An iterative algorithm is established with the ⊕ operator to approximate the solution of our system, and a convergence criterion is also discussed.

We remark that our results are new and useful for further research and one can extend these results in higher dimensional spaces. Much more work is needed in all these areas to develop a sound basis for applications of the system of general ordered variational inclusions in engineering and physical sciences.

Acknowledgements

The authors are very grateful to the University Putra Malaysia, 43400 Serdang, Selangor, Malaysia for providing partial support during the present study. The authors also express their sincere thanks to the referees for careful reading and suggestions that helped to improve the paper.

Footnotes

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

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

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Mohd. Sarfaraz, Email: sarfarazm820@gmail.com

MK Ahmad, Email: ahmad_kalimuddin@yahoo.co.in.

A Kılıçman, Email: akilic@upm.edu.my.

References

  • 1.Li HG, Qiu D, Jin MM. GNM ordered variational inequality system with ordered Lipschitz continuous mappings in an ordered Banach space. J. Inequal. Appl. 2013;2013 doi: 10.1186/1029-242X-2013-514. [DOI] [Google Scholar]
  • 2.Li HG, Li LP, Zheng JM, Jin MM. Sensitivity analysis for generalized set-valued parametric ordered variational inclusion with (α,λ)-nodsm mappings in ordered Banach spaces. Fixed Point Theory Appl. 2014;2014 doi: 10.1186/1687-1812-2014-122. [DOI] [Google Scholar]
  • 3.Li HG, Pan XB, Deng ZY, Wang CY. Solving GNOVI frameworks involving (γg,λ)-weak-GRD set-valued mappings in positive Hilbert spaces. Fixed Point Theory Appl. 2014;2014 doi: 10.1186/1687-1812-2014-146. [DOI] [Google Scholar]
  • 4.Li HG. A nonlinear inclusion problem involving (α,λ)-NODM set-valued mappings in ordered Hilbert space. Appl. Math. Lett. 2012;25:1384–1388. doi: 10.1016/j.aml.2011.12.007. [DOI] [Google Scholar]
  • 5.Li HG, Qui D, Zou Y. Characterization of weak-anodd set-valued mappings with applications to approximate solution of gnmoqv inclusions involving ⊕ operator in ordered Banach space. Fixed Point Theory Appl. 2013;2013 doi: 10.1186/1687-1812-2013-241. [DOI] [Google Scholar]
  • 6.Li HG. Nonlinear inclusion problems for ordered rme set-valued mappings in ordered Hilbert spaces. Eur. J. Oper. Res. 2011;16(1):1–8. [Google Scholar]
  • 7.Li HG, Li LP, Jin MM. A class of nonlinear mixed ordered inclusion problems for oredered (αa,λ)-ANODM set-valued mappings with strong comparison mapping A. Fixed Point Theory Appl. 2014;2014 doi: 10.1186/1687-1812-2014-79. [DOI] [Google Scholar]
  • 8.Li HG. Approximation solution for general nonlinear ordered variational inequalities and ordered equations in ordered Banach space. Nonlinear Anal. Forum. 2008;13(2):205–214. [Google Scholar]
  • 9.Li HG. Approximation solution for a new class general nonlinear ordered variational inequalities and ordered equations in ordered Banach space. Nonlinear Anal. Forum. 2009;14:89–97. [Google Scholar]
  • 10.Fang YP, Huang NJ. H-Accretive operator and resolvent operator technique for variational inclusions in Banach spaces. Appl. Math. Lett. 2004;17(6):647–653. doi: 10.1016/S0893-9659(04)90099-7. [DOI] [Google Scholar]
  • 11.Fang YP, Huang NJ. H-Monotone operator and resolvent operator technique for variational inclusions. Appl. Math. Comput. 2003;145(2-3):795–803. [Google Scholar]
  • 12.Ahmad I, Mishra VN, Ahmad R, Rahaman M. An iterative algorithm for a system of generalized implicit variational inclusions. SpringerPlus. 2016;5 doi: 10.1186/s40064-016-2916-8. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 13.Ahmad I, Rahaman M, Ahmad R. Relaxed resolvent operator for solving a variational inclusion problem. Stat. Optim. Inf. Comput. 2016;4(2):183–193. doi: 10.19139/soic.v4i2.166. [DOI] [Google Scholar]
  • 14.Chang S, Huang N. Generalized strongly nonlinear quasi-complementarity problems in Hilbert spaces. J. Math. Anal. Appl. 1991;158:194–202. doi: 10.1016/0022-247X(91)90276-6. [DOI] [Google Scholar]
  • 15. Fang, YP, Huang, NJ: Approximate solutions for non-linear variational inclusions with (H,η)-monotone operator. Research report, Sichuan University (2003)
  • 16. Fang, YP, Chu, YJ, Kim, JK: (H,η)-Accretive operator and approximating solutions for systems of variational inclusions in Banach spaces. Appl. Math. Lett. (to appear)
  • 17.Fang YP, Huang NJ, Thompson HB. A new system of variational inclusions with (H,η)-monotone operators in Hilbert spaces. Comput. Math. Appl. 2005;49(2-3):365–374. doi: 10.1016/j.camwa.2004.04.037. [DOI] [Google Scholar]
  • 18.Ahmad I, Ahmad R, Iqbal J. A resolvent approach for solving a set-valued variational inclusion problem using weak-RRD set-valued mapping. Korean J. Math. 2016;24(2):199–213. doi: 10.11568/kjm.2016.24.2.199. [DOI] [Google Scholar]
  • 19.Du YH. Fixed points of increasing operators in ordered Banach spaces and applications. Appl. Anal. 1990;38:1–20. doi: 10.1080/00036819008839957. [DOI] [Google Scholar]
  • 20.Schaefer HH. Banach Lattices and Positive Operators. Berlin: Springer; 1994. [Google Scholar]
  • 21.Verma RU. Projection methods, algorithms, and a new system of nonlinear variational inequalities. Comput. Math. Appl. 2001;41(7-8):1025–1031. doi: 10.1016/S0898-1221(00)00336-9. [DOI] [Google Scholar]

Articles from Journal of Inequalities and Applications are provided here courtesy of Springer

RESOURCES