1. Introduction
Lin [
1] introduced the system of generalized quasi-variational inclusion problems. This system includes the set of problems suggested on a product set. It includes several well-known problems such as variational inequalities, equilibrium problems, vector equilibrium problems, and variational inclusions/disclusion problems. The system of variational inequalities has concealed symmetries in both variational inequalities and fixed point theory. However, the appearance of scale symmetry in this system creates a void of symmetric hiddenness and has a correlation effect.
Undoubtedly, in the realm of engineering, sciences, technology, chemical processes, and economics, several challenging and complex problems frequently result in inequalities instead of straightforward equations. In this scenario, variational inequalities have become a formidable mathematical resource. Variational inequalities (VIs) essentially arise from applied models with an underlying convex foundation and have been the subject of extensive research since the 1960s, encompassing mathematical theories, numerical techniques, and practical applications (among other significant sources, see [
2,
3,
4,
5,
6,
7]).
It should be noted that the results mentioned earlier cannot be applied to coupled systems that consist of two elliptical mixed variational inequalities. System of VIs are a mathematical tool used to analyze mixed boundary value problems, control problems, and similar problems. More details can be found in [
8,
9,
10,
11,
12].
In this paper, we suggest SNMVIPs and using the K-Fan fixed point theorem, the Minty techniques, and inverse relaxed monotonicity to establish the existence, convergence, uniqueness, stability, and optimal control of the problems.
Before we proceed, let us define the problem that will be discussed in this article. Consider two reflexive Banach spaces,  and , with their dual spaces  and , respectively. We denote the duality pairing between  and X by  and between  and Y by . We use  and → to denote the weak and the strong convergence in X, and  denotes X with weak topology. The limits, lower limits, and upper limits are considered as n approaches infinity, even if not explicitly stated.
We can formulate SNMVIPs on Banach spaces:
Problem 1.  Determine  such thatand  We note that if 
 and 
, then Problem 1 reduces to the problem of [
13] for finding 
 such that
      
Definition 1. Let  be a subset of a Banach space X. Let  be a proper convex and lower semicontinuous function, and . Then  is called
- (i) 
- (ii) 
- (iii) 
- Inverse relaxed monotone with constant  if 
- (iv) 
- Lipschitz continuous with constant  if 
- (v) 
- (vi) 
- φ-stable-pseudomonotone with respect to the set , if  and  are φ-pseudomonotone for each  
 Let 
Z and 
Y be topological spaces and 
. We use the notation 
 to represent the set of all possible subsets of the set 
V. Let 
 be a set-valued map. 
 represents the graph of 
 and is defined as
      
The graph of 
 is sequentially closed in 
 if any sequence 
 converging to 
 as 
. Then,
      
Theorem 1.  [
14] 
Let  be a bounded, closed, and convex set of a subset of the reflexive Banach space Y. Let  be a nonempty, closed, and convex set-values map whose graph is sequentially closed in the topology . Then, Λ 
has a fixed point.   2. Main Results
In this section, we focus on the uniqueness of solutions and their existence to Problem 1. We use the Minty methodology, Theorem 1, and the K-Fan fixed point theorem to establish the existence theorem for the solutions to Problem 1 under given modest assumptions. Additionally, we deploy the inverse relaxed monotonicity and Lipschitz continuity to prove two uniqueness results for Problem 1.
Furthermore, we propose that 
 and 
 be the set-valued maps described by
      
      and
      
      respectively.
The following assumptions must be made to solve Problem 1:
- (A): 
          
-  and  are closed and convex. 
- (B): 
          
-  and . 
- (C): 
          
-  is such that - (i)
-  is a proper, convex and lower semicontinuous function; 
- (ii)
- There exists  -  such that
               
- (iii)
- For each  - , there exists  -  such that [ 15- ]
               
 
- (D): 
          
-  is such that - (i)
-  is  - -stable-pseudomonotone with  -  and fulfills
               
- (ii)
- It possesses
               - 
              when  -  are such that
               
- (iii)
-  is a function such that
               - 
              and 
- ♠ every bounded set  -  we have
               
- ♠ for any  it holds that  as  
- (iv)
- There exists  -  such that
               
 
- (E): 
          
-  is such that - (i)
-  is a proper, convex and lower semicontinuous function; 
- (ii)
- There exists  -  such that
               
- (iii)
- For each  - , there exists  -  such that [ 15- ]
               
 
- (F): 
          
-  is such that - (i)
-  is  - -stable-pseudomonotone with  -  and fulfills
               
- (ii)
- It possesses
               - 
              when  -  and  -  are such that
               
- (iii)
-  is a function such that
               - 
              and 
- ♠ every bounded set  - , we have
               
- ♠ any , it holds  as  
- (iv)
- ∃ a constant  -  such that
               
 
Remark 1.  When ♭ appears in  (D)(iii) (or ℓ appears in (F)(iii)) but has no effect on the second variable, the condition   (D)(iii) (or (F)(iii)) becomes a subsequent uniformly coercive condition: 
(D)(iii)′: ∃
 with  as  such that (respectively,(F)(iii)′: ∃
 with  as  such that  The accessibility of solutions for Problem 1 is the main theorem of this article.
Theorem 2.  Suppose that  
          (A), (B), (C), (D), (E), and  (F) are held. Then, the solution set denoted by  of Problem 1 corresponding to  is nonempty and weakly compact in .
 We require the following lemmas to prove this theorem:
Lemma 1.  Assume that  (A), (B), (C),  and  (D) are satisfied. Then, the following statements hold:
- (i) 
- For fixed ,  solves the-  ( 1- ) , if and only if u solves the Minty inequality for determining  such that
 
- (ii) 
- For fixed , the solution set  of - ( 1- ) is nonempty, bounded, closed and convex;
 
- (iii) 
- The graph of  is sequentially closed in  implying that  is sequentially closed from a waek topology Y into the subsets of a weak topology X; 
- (iv) 
- If the map  is strictly monotone for a fixed , then  is a weakly continuous point-to-point mapping. 
 Proof.  The assumptions (i) and (ii) are the straightforward consequences of ([
16], Theorem 3.3). Now, we present the conclusion (iii).
Let 
 be such that
        
Then, for each 
, we have 
 i.e.,
        
To establish the upper limit as 
, we use assumption 
(D)(ii) and the weak lower semicontinuity of 
 (because 
 is convex and lower semicontinuous) to determine
        
Using the assumption (i), we obtain
        
Consequently, , which is the the graph of the mapping , is sequentially closure in 
Additionally, assume that 
 is strictly monotone. Let us consider 
 be two solutions to (
1). Then, we have
        
        and
        
In putting 
 into (
7) and 
 in (
8), we have
        
        and
        
Adding (
9) and (
10), we have
        
Given the assumption 
(C) and the strict monotonicity of 
, we obtain
        
Therefore,  is a point-to-point mapping. However, assumption (iii) shows that  is weakly continuous.    □
 Similarly, Problem (
2) has the following lemma.
Lemma 2.  Assume that  (A), (B), (E), and (F) are satisfied. Then, the following statements hold:
- (i) 
- For each fixed ,  solves - ( 2- ) if and only if v solves the Minty inequality to determine  such that
 
- (ii) 
- For fixed , the solution set  namely, of (2) is nonempty, bounded, closed, and convex; 
- (iii) 
- The map  has a sequentially closed graph in ; 
- (iv) 
- If the map  is strictly monotone for a fixed , then  is a weakly continuous point-to-point mapping. 
 Furthermore, we provide an a priori appraisal of the solution to Problem 1.
Lemma 3.  Let us assume that (A), (B), (C), (D), (E), and  (F) have been fulfilled satisfactorily. If the solution set , namely, of Problem 1, is nonempty, then there exists  such that  Proof.  Suppose that 
. Let 
 be arbitrary and 
 By swapping 
 and 
 into (
1) and (
2), 
respectively, we obtain
        
        and
        
Taking account of (
14), we use hypotheses 
(C)(i), (iii), and 
(D)(iii)–(iv) to obtain
        
Similarly, taking account of (
15), we use hypotheses 
(E)(i), (iii) and 
(F)(iii)–(iv) to obtain
        
Contrarily, suppose 
 is unbounded. Then, taking a subsequence, if necessary, it is possible to suggest a sequence 
 so that
        
        or
        
Let us segregate the subsequent cases:
		
- a
- Assume ( 18- ) is satisfied and the sequence  -  is bounded in  Y- ; 
- b
- Assume ( 19- ) is fulfilled and the sequence  -  is bounded in  X- ; 
- c
- Assuming that both ( 18- ) and ( 19- ) are fulfilled. 
Assuming a is valid, substitute 
 and 
 into (
16) to obtain
        
When we let 
n approach infinity in the inequality (
20) and make use of (
18) along with property 
(D)(iii), we obtain the following:
        
Consequently, (
21) produces a contradiction. Similarly, for b, we could use (
17) to obtain a contradiction. However, we assume that c holds, and we will proceed to discuss two additional situations:
        
- (1)
- (2)
- There exist  -  and  -  such that
             
If item (1) is true, we enter 
 and 
 into (
17) to yield
        
Taking the limit as 
n approaches infinity for the inequality mentioned above yields
        
It is obviously impossible; however, for a situation (2), we can deduce from (
16) that
        
        where 
 is such that
        
This leads to a contradiction. Thus, 
 is bounded in 
, allowing us to determine 
 satisfying (
13).    □
 Consider the set-valued mapping 
 defined by
      
By invoking Lemma 1 and Lemma 2, it can be seen that  is well defined. In addition, ∃ a bounded, closed, and convex set  in  such that  maps  into itself.
Lemma 4.  Suppose (A), (B), (C), (D), (E), and  (F)  are met. Then, ∃ 
a constant  satisfy where  is defined as  Proof.  Our proof will be based on contradiction. Assume that
        
Then, for each 
, we may determine 
 and 
 (i.e., 
) and 
 so that
        
Thus, assuming 
 for each 
 (similarly for 
 for each 
). We employ (
16); one has
        
Therefore, passing to the limit as 
 for the inequality above, we have
        
This leads to a contradiction. Thus, ∃ a constant 
 satisfying
        
□
 Proof. (Proof of Theorem 2) Let us see that if 
 has a fixed point 
, then
        
By employing the concepts of 
 and 
, it offers
        
        and
        
Thus, it is clear that  solves Problem 1. We will apply Theorem 1, the K-Fan fixed point theorem, to determine the existence of a fixed point for .
Moreover, Lemmas 1, 2, and 4, in fact, infer that 
 has nonempty, closed, and convex values; the graph of 
 is sequentially closed in 
 The conditions stated in Theorem 1 have been verified. From this theorem, It can be shown that Problem 1 has a solution 
, such that
        
Lemma 3 clearly shows that 
 is bounded in 
. Therefore, we will demonstrate that 
 is weakly closed. Consider 
 such that
        
It is clear that for each natural number 
n, the pair 
 Since 
 is sequentially closed from 
 to 
 (
see Lemma 1 and Lemma 2), we can conclude that
        
Thus, due to the boundedness of , we can conclude that  is weakly compact.    □
 Theorem 2 shows that the solution set of Problem 1 is both nonempty and weakly compact. However, it raises the question of whether it is possible to prove the uniqueness of the solution under certain assumptions. Fortunately, the theorems below provide a positive solution to this problem.
Theorem 3.  Assume that  (A), (B), (C), (D), (E), and (F) are fulfilled. In addition, if the inequality below holds, Then Problem 1 has a unique solution.
 Proof.  We now demonstrate that Problem 1 has unique solution. Assume 
 are the two different solutions. Then,
        
        and
        
After setting 
 to correspond to 
 and 
 to correspond to 
 in Equation (
28), we add the two equations to obtain
        
Similarly, assigning 
 to correspond to 
 and 
 to correspond to 
 in Equation (
29), we add the two equations to obtain
        
By using (
30), (
31), and assertions 
(C) and 
(E), we have
        
This, combined with the condition (
27), implies that 
 and 
. Thus, Problem 1 has a unique solution.    □
 By adding an additional condition to (
27), the resulting theorem establishes a unique solution for Problem 1.
Theorem 4.  Assume that  (A), (B), (C), (D), (E),  and (F) are fulfilled. If the following assumptions are met:
- ➀
- The function  is inversely relaxed monotone and Lipschitz continuous for , with constants  and . Moreover, for each  the function  is Lipschitz continuous with ; 
- ➁
- The function  is inversely relaxed monotone and Lipschitz continuous for , with  and . Moreover, for every  the function  is Lipschitz continuous with ; 
- ➂
Then Problem 1 has a unique solution.
 Proof.  Let 
 and 
 be two solutions to Problem 1. Then, it has
        
        and
        
Again, from the inverse relaxed monotonicity and Lipschitz continuity of 
, we have
        
Thus, from (
32) and (
34), we have
        
Again, from (
33) and (
36), we have
        
Combining Equations (
35) and (
37) yields
        
However, the inequality  implies that  and 
Therefore, Problem 1 has a unique solution.    □
   3.  Stability Results
In this section, we delve into examining the stability of the system of nonlinear mixed variational inequality problems. Firstly, we present a set of regularized problems perturbed by duality mappings that correspond to Problem 1. Secondly, we arrive at a stability conclusion that demonstrates that every solution sequence to a regularized problem contains at least one subsequence that solves Problem 1.
Let 
X and 
Y be two reflexive Banach spaces, and let 
 and 
 be their dual spaces. We assume that 
X and 
Y are strictly convex without losing the generality. Let 
 and 
 be the duality mappings, so that
      
Let 
 and 
 be real sequences such that
      
Consider the following perturbated problem for every  which corresponds to Problem 1.
Problem 2. Determine  so that  We assume the following.
- (G): 
          
-  and  -  are monotone, and meet
           
- (H): 
          
-  is inverse relaxed monotone with  -  and Lipschitz continuous with  - ; similarly,  -  is inverse relaxed monotone with  -  and Lipschitz continuous with  - , and fulfil
           
The theory described below ensures that solutions to Problem 2 exist and converge.
Theorem 5.  Assume that  (A), (B), (C), (D) (ii)–(iv), (E), and (F) (ii)–(iv) are satisfied. Then the following assertions hold:
- (i) 
- If, in addition to assumption(G), Problem 2 has at least one solution  for every ; 
- (ii) 
- Furthermore, if(G)holds, there is a subsequence  for every solution of the sequence  to Problem 2, such that - where  solves the Problem 2; 
- (iii) 
- Under the conditions of(H), any sequence of solutions  of Problem 2 has a subsequence  such that - where  solves Problem 1. 
 Proof.  - (i)
- We shall confirm that  -  and  -  satisfy,  respectively- ,  (D)-  and  (F)- . Observe that  -  is demicontinuous and
             
- Using hypotheses  (G)- , we determine that  (D)- (i) is satisfied for each  - ,  - . Utilizing the information that  -  and
             
- It is easy to show that  satisfies (D)(ii)–(iv). Similarly,  satisfies (F). Consequently, by using Theorem 2, we can argue that Problem 2 has a solution. 
- (ii)
- Let  -  be any arbitrary sequence that solves Problem 2. Next, a meticulous calculation yields
             - 
            and
             
- The same argument that was employed in Lemma 3’s proof that  is bounded in . - If necessitated we can go to a relabeled subsequence and assume that
             
- By using the monotonicity of  -  and  - , we can make the following deduction:
             - 
            and
             
- By taking the upper limit as  -  and applying conditions  (D)- (ii) and  (F)- (ii), we infer that
             - 
            and
             
- Here, we utilized the boundedness of  - . Using the Minty approach, we find  -  to solve Problem 1,  i.e.,
- (iii)
- It can be deduced from (ii) that if we have a sequence of solutions denoted by  -  for Problem 2, there will always exist a subsequence of  -  that satisfies ( 42- ). We assert that the sequence  -  has a strong convergence to  - . It is simple to demonstrate that
             
- By using hypothesis  (D)- (ii) and taking the upper limit as  n-  approaches infinity on the above inequality, we obtain
             
On the other hand, it has
        
□
   4. Optimal Control
In this section, we explore optimal control for the SNMVIPs. Additionally, we examine and demonstrate the solveability of an optimal control problem that is influenced by the nonlinear mixed variational inequality system.
Consider two Banach spaces  and  with continuous embeddings from X to  and from Y to . Let  and  be two target profiles. We define subspaces  and  such that the embeddings from U to  and V to  are compact. We now examine the ensuing optimal control problem:
Problem 3. Find  such that in which  is defined as Here,  denotes the set of solution to Problem 1 for , where the regularized parameters are  and .
 We assume that the function  satisfies the following conditions:
(K): is such that
- (i)
-  is bounded from beneath; 
- (ii)
-  is coercive on  - , that is, it maintains
           
- (iii)
-  is weakly lower semicontinuous on  - ,  i.e.- ,
           - 
          whenever  -  and  -  are such that
           
In this context, we are exploring the existence result for Problem 3.
Theorem 6. Assume that  (A), (B), (C), (D)  (ii)–(iv), (E), and  (F) (ii)–(iv) hold. If (K) and  (G) are also satisfied, then Problem 3 has an optimal control pair.
 Proof.  For each fix 
, the closedness of 
 ensures that 
 such that
        
        is attainable.
According to 
ℸ and 
(K)(i), there exists a minimizing sequence 
 such that
        
We assume that the sequence 
 is bounded in 
. To arrive at a contradiction, we suppose that
        
Using the latter with 
(K)(ii), we can conclude that
        
The result is a contradiction, which means that 
 is bounded in 
. Passing to a relabeled subsequence if necessary, we may assume that
        
Let 
 satisfy (
53) by letting 
, 
, and 
. We will now prove that 
 is uniformly bounded in 
. A simple computation reveals that
        
        and
        
Since there is continuity in the embeddings from U to  and from V to , we use the same approach as in the proof of Lemma 3 to show that the sequence  is uniformly bounded in . Without loss of generality, we can assume that
Using the Minty approach yields
        
        and
        
The embedding from 
 into 
 is compact, and (
56) implies that
        
Taking the upper limit as 
 for (
60) and (
61), we obtain
        
        and
        
        where we used 
(F)(ii) and 
(D)(ii). Using the Minty trick once more, we accomplish
        
The weaker lower semicontinuity of 
 and 
, however, suggests that
        
Note that 
 is weakly lower semicontinuous on 
; it implies
        
Referring to Equations (
62) and (
63), we have
We can use Equation (
64) along with (
54) to arrive at the following conclusion:
        
        namely, 
 is an optimal control pair of Problem 3.    □