1. Introduction
Variational inequalities theory, introduced and improved by Stampacchia [
1], has a tremendous potential in theoretical research and applied fields. For 
, given the operator 
 and 
 nonempty, closed, convex subsets of the Hilbert spaces 
, the variational inequality problem stated in [
1] (in short, VIP) is to find 
 such that
      
      which helps us to understand a simple, unified, and efficient framework to research the actual problems arising in optimization, engineering, economy, and so on. More specifically, variational inequalities are an important tool for studying some equilibrium problems [
2] and convex minimization problems [
3]. Various types of equilibrium problems (e.g., Nash and dynamic traffic) can be modeled as VIP. Pang [
4] showed that the VIP related to the equilibrium problem can be decomposed into a system of variational inequalities and discussed the convergence of the method of decomposition for a system of variational inequalities.
More specifically, let 
 and 
 be nonlinear bifunctions. The system of variational inequalities (SVI) (please, see [
4,
5]) is to find 
 such that
      
Using essentially the fixed point formulation and projection technique, many researchers [
5,
6,
7,
8,
9,
10,
11] studied related iterative schemes for approximating the solutions to systems of variational inequalities. On the other hand, over the past three decades, there has been quite an activity in the development of powerful and highly efficient numerical methods to solve the VIP and its applications [
12,
13,
14,
15,
16,
17,
18]. There is a substantial number of methods, including the linear approximation method [
19,
20], the auxiliary principle [
21,
22], the projection technique [
9,
11], and the descent framework [
23]. For applications, numerical techniques and other aspects of variational inequalities and split problems, please see [
19,
20,
24,
25,
26,
27,
28].
In 2012, Censor et al. [
29] introduced the so called split variational inequality problem (SVIP), as follows. Let 
 and 
 be nonlinear operators and 
A be a bounded linear operator. Find 
 such that
      
      and such that 
 solves
      
They also suggested some iterative algorithms for approximating the solutions to the SVIP. This problem is an important improvement of the VIP (
1).
In 2016, Kazmi  [
30] proposed a system of split variational inequalities (SSVI), which is a generalization of the SVIP and the SVI, as follows. Let 
, 
, 
, 
 be nonlinear bifunctions and 
 and 
 be bounded linear operators. The SSVI is to find 
 such that
      
      and 
, 
 solve
      
He proposed an iteration method for solving SSVI and proved that the sequence produced by the algorithm converges strongly to a solution of SSVI.
It is worth noticing that the results in [
29,
30] regarding the iterative schemes for approximating the solutions to variational inequalities are considered in underlying convex sets. In many practical cases, the existing results may not be applicable if the convexity assumption is not fulfilled. Thus, in this paper, we extend their results to split systems of nonconvex variational inequalities (SSNVI) in the context of uniformly prox-regular sets, which include the convex sets as special cases.
  2. Preliminaries
Let 
 be a Hilbert space equipped with its inner product 
 and the norm 
, please, see [
9]. Assume that 
C is a nonempty, closed subset of 
. Recall that the projection 
 from 
 onto 
C is defined by
      
      where 
 is the usual distance related to 2-norm from the point 
u to the set 
C.
Definition 1. [31] Given , the proximal normal cone of C at v is given by  Proposition 1. [31] Let C be a nonempty, closed subset of . Then  if and only if there exists a constant  such that  We now give the definition of a uniformly l-prox-regular set.
Definition 2. [32,33] A subset  of , , is said to be uniformly l-prox-regular if every nonzero proximal normal to  can be realized by a l-ball, that is, for all  and all , one has  Obviously, the convex sets, 
p-convex sets [
34], 
 submanifolds [
35], the images of 
 diffeomorphism [
36] are uniformly prox-regular sets. If we take 
 the convexity of 
C and the uniformly prox-regularity of 
 are equivalent. For more details of uniformly prox-regular sets, please see [
31,
33,
37].
Given an operator 
S, the nonconvex variational inequality problem
      
      was introduced by Bounkhel M. [
38], and further studied in [
37,
39,
40]. If 
, problem (
2) and problem (
1) are equivalent. We now give an example regarding the nonconvex case.
Example 1. [37] Let , , and let , and the set C be the union of two disjoint squares, A and B, having respectively, vertices at the points , , , and  and at the points , , , and . The fact that C can be written in the form  shows that it is a uniformly prox-regular set in  and the nonconvex variational inequality (
2) 
has a solution on the square B.  Some properties of the uniformly l-prox-regular sets are given below.
Proposition 2. [37] Let , , be a nonempty, closed, and uniformly l-prox-regular subset of . Let . Then: - (i) For all , ; 
- (ii) For all ,  is Lipschitz continuous with constant  on ; 
- (iii) The proximal normal cone  is closed as a set-valued mapping. 
 The next special operators are needed to develop our results.
Definition 3. [40] For all u, , the operator  is said to be: - (i) Monotone in the first variable if 
- (ii) α-strongly monotone in the first variable if  such that 
- (iii) β-Lipschitz in the first variable if  such that 
 Definition 4. [41] For all u, , the operator  is said to be: - (i) ν-strongly monotone if  such that 
- (ii) L-Lipschitz if  such that 
- (iii) Uniformly L-Lipschitz if  such that 
- (iv) Generalized -Lipschitz if  such that 
 Now, let us recall the class of the nearly Lipschitz operator, nearly nonexpansive operator, and nearly uniformly L-Lipschitz continuous operator briefly.
Definition 5. [41] For all u, , the operator  is said to be: - (i) Nearly Lipschitz with respect to  with  if  such that 
The infimum of  is called nearly Lipschitz constant and is denoted by A nearly Lipschitz operator S with respect to  is said to be:
 We need the following proposition in order to get the main result.
Proposition 3. [41] For , let  be nearly uniformly -Lipschitz operators with respect to . Define a self-mapping S,  for all . Then  is a nearly uniformly -Lipschitz operator with respect to . If , for any , we have  Example 2. Let ,  and an operatorwith  for . Then  is a nearly uniformly -Lipschitz operator with respect to .  Lemma 1. [9] Let  be a sequence of nonnegative real numbers and let  be a sequence in [0,1] such that , , ,  and . If ,  and  satisfy the propertythen .  In the next sections, we are going to state and prove results regarding the existence and uniqueness of the solutions to a SSNVI, and also propose an iterative algorithm to determine the unique solution to SSNVI which is also a fixed point to some operators with suitable properties.
  3. Split Systems of Nonconvex Variational Inequalities
In the section, we consider a SSNVI with several nonlinear operators.
For 
l, 
, let 
 be uniformly 
l-prox-regular and 
 be uniformly 
k-prox-regular. For 
, consider the nonlinear operators 
, 
, 
, and 
. Let 
A and 
B be two bounded linear operators from 
 to 
. The SSNVI is to find 
 such that
      
      and such that 
 with 
, 
 solves
      
To study the existence of solutions to system (
4), the following two lemmas are needed.
Lemma 2. For , , let  and  be nonlinear operators. Then system (
4) 
and the following problem are equivalent:  Proof.  Suppose that 
 solves system (
4).
If 
, then:
        
If 
, the following is always true
        
By Definition 2 and Proposition 1, we have 
 and then
        
Conversely, if 
 solves problem (6), Definition 2 guarantees that 
 solves system (
4).  □
 We will obtain a uniqueness theorem for the solution to system (
4) after verifying the equivalence between the fixed point formulation (
7) and system (
4).
Lemma 3. For , , let  and  be nonlinear operators. Suppose that , , and . Then  solves system (
4) 
if and only if  Proof.  Suppose that 
 solves system (
4). By using 
 and the projection operator technique, we have
        
From Proposition 2, we get 
, and then the set 
 is a singleton. From Lemma 2,
        
        that is,
        
Thus, we get .
By the same way, we conclude that 
. Thus, relations (
7) are satisfied. It is easy to check the converse.  □
 From Lemma 2, we find out the existence of a solution to system (
4). By Lemma 3, system (
4) admits a unique solution.
Theorem 1. For , , let  be operators which satisfy the conditions from Lemma 3, and  be nonlinear operators. Suppose that , , ,. Let the operators  be -Lipschitz and -strongly monotone in the first variable and the operators  be -Lipschitz and -strongly monotone. If the parameters satisfywhere , , then system (
4) 
admits a unique solution.  Proof.  Define the operators 
, 
,
        
        for all 
. From Lemma 3, it is easy to check that relations (
9) are satisfied. Define 
 on 
 as in Proposition 3, that is
        
Clearly,  is a normed space.
Define a self-mapping ,  for all .
Next, we prove that 
T is a contraction. Let 
, 
. By Proposition 2, we have
        
In view of 
, 
, for the first summand we have
        
        and for the second summand
        
Therefore, we have obtained
        
Finally, we rewrite the inequality above as
        
        where 
. Since the parameters satisfy conditions (
8), we get 
. From inequality (10), it follows that the operator 
T is a contraction. Thus, there exists only one element 
 such that 
. Returning to relation (9), we have 
 and 
. From Lemma 3, system (
4) admits a unique solution.  □
 The SSNVI is to find 
 which solves system (
4). Then its image 
 has to solve system (5). So, Theorem 1 proved the validity of the existence and uniqueness theorem for the solution to SSNVI.
  4. Iterative Algorithm
In this part, the set of solutions to SSNVI is denoted by y 
 and the set of fixed points of 
S by 
. For any given 
 define 
 as in Proposition 3. Notice that 
 and 
 if and only if 
. If 
, from Lemma 3, in relations (
9) and for 
, we achieve
      
We now construct the following iterative algorithm (
12) by formulation (
11) for approximating the unique common element of the set of fixed points of some nearly uniformly Lipschitz operators and the set of solution to SSNVI.
Theorem 2. For , ,  is a uniformly l-prox-regular and  is a uniformly k-prox-regular. Let ,  be endowed with the same properties as in Theorem 1. Suppose , , , . Let the operators  be -Lipschitz and -strongly monotone in the first variable and the operators  be -Lipschitz and -strongly monotone. A and B are bounded linear operators from  to ,  and  are adjoint operators. Let  be two nearly uniformly -Lipschitz operators with respect to ,  be the same as in Proposition 3 with . Let the sequence  be computed as followswhere  with . Suppose that ,  and Suppose that , ,  with ,  and  are as in Theorem 1 and Then the sequence  computed by relation (
12) 
converges strongly to an element of .  Proof.  By Theorem 1, let 
 be the solution to system (
4). Therefore, 
 is the unique solution to SSNVI. Let us take 
. Since conditions (
8) and (
13) are satisfied respectively, then we obtain
        
From the definition of 
, 
, by relations (
12), (
8), (
15) and Proposition 2, we have
        
In view of 
 and 
, from relations (
12), (
8), (
16), and Proposition 2, we find
        
By looking into the definition of 
 and 
, from (
12), (
13), (
17), and Proposition 2, we attain
        
In light of 
 and 
, from (
12), (
13), (
18) and Proposition 2, we conclude
        
Using (
11), (
12), (
14), (
19)–(
21), (
23), and Proposition 3, we obtain
        
By using relations (
11), (
12), (
14), (
19), (
20), (
22), (
25), and Proposition 3, we have
        
It follows from (
24) and (
26) that
        
By applying Lemma 1 to relation (
27), we achieve 
 and 
. Thus, we conclude that the sequence 
 computed by (
12) converges strongly to an element of 
.  □
 We now have in view a special case of SSNVI, called the split systems of general variational inequalities (SSGVI), which is an improvement of SVIP in [
29] and SSVI in [
30].
Surely, if 
 the convexity of 
C and the uniformly prox-regularity of 
 are equivalent. Thus, in a underlying convex set, the SSGVI is to find 
 such that
      
      and such that 
 with 
, 
 solves
      
      where 
 and 
 are nonempty, closed, convex sets, 
, 
, 
, and 
 (
) are the same as Theorem 2.
If l, , then the uniformly prox-regularity of ,  collapse to convexity, respectively, that is to say , . Hence, we have the following corollary.
Corollary 1. Let  and  be nonempty, closed, convex sets. For , presume that , ,  , A, and B are the same as in Theorem 2. For each  let sequence  be computed as followswhere  with . Suppose that  and  with Then the sequence  computed by relation (
28) 
converges strongly to a solution to the SSGVI.    5. Numerical Example
Let . Let , , , ,  for all x, . Let  and , , , , respectively. Let  and , , , , respectively.
Clearly, 
, 
, 
, 
, 
, 
, 
, 
 are 1-strongly monotone and 2-Lipschitzian. Let 
 and 
 from 
 to 
, respectively. For 
, 
. We now rewrite (
28) as follows
      
For every 
, the operators and the parameters satisfy all conditions in Corollary 1. We find that the sequence 
 generated by relation (
29) converges strongly to (0, 0).
Choosing initial values (10, 20), we see that 
Figure 1 demonstrates Corollary 1.
  6. Conclusions
In this paper, we investigated the split system of nonconvex variational inequalities (SSNVI) in the context of uniformly prox-regular sets, which is an improvement of SSGVI, SSVI, and SVIP. By using an adequate formulation and the projection technique, we constructed an iterative algorithm for approximating the unique common solution to the set of fixed points of nearly uniformly Lipschitz operators and the set of solutions to SSNVI. The results of this paper are expected to be used as further study on numerical techniques.
   
  
    Author Contributions
All authors participated in the conceptualization, validation, formal analysis, and investigation, as well as the writing of the original draft preparation, reviewing, and editing.
Funding
This work was supported by the Key Subject Program of Lingnan Normal University (Grant No. 1171518004), the Natural Science Foundation of Guangdong Province (2018A0303070012), and the Young Innovative Talents Project in Guangdong Universities (2017KQNCX125). Li-Jun Zhu was supported by the grants NXJG2017003, NXYLXK2017B09, and Advanced Intelligent Perception and Control Technology Innovative Team of NingXia.
Acknowledgments
The authors are grateful to the reviewers and to the editors for their valuable comments and suggestions which helped us improve the paper significantly.
Conflicts of Interest
The authors declare that they have no competing interests.
References
- Stampacchia, G. Formes bilineaires coercitives sur les ensembles convexes. CR Acad. Sci. Paris 1964, 258, 4413–4416. [Google Scholar]
- Kazmi, K.; Rizvi, S. Iterative approximation of a common solution of a splite quilibrium problem, a variational inequality problem and a fixed point problem. J. Egypt. Math. Soc. 2013, 21, 44–51. [Google Scholar] [CrossRef]
- Ceng, L.; Wen, C. Iterative schemes for convex minimization problems with constraints. Abstr. Appl. Anal. 2012, 2012, ID:140679. [Google Scholar] [CrossRef]
- Pang, J. Asymmetric variational inequalities over product of sets: Applications and iterative methods. Math. Program. 1985, 31, 206–219. [Google Scholar] [CrossRef]
- Verma, R. Generalized system of relaxed cocoercive variational inequalities and projection methods. J. Optim. Theory Appl. 2004, 121, 203–210. [Google Scholar] [CrossRef]
- Kassay, G.; Reich, S.; Sabach, S. Iterative methods for solving systems of variational inequalities in reflexive Banach spaces. SIAM J. Optim. 2011, 21, 1319–1344. [Google Scholar] [CrossRef]
- Ceng, L.; Wen, C. Systems of variational inequalities with hierarchical variational inequality constraints for asymptotically nonexpansive and pseudocontractive mappings. Racsam. Rev. R. Acad. A 2019, 113, 2431–2447. [Google Scholar] [CrossRef]
- Yao, Y.; Liou, Y.; Yao, J. Iterative algorithms for the split variational inequality and fixed point problems under nonlinear transformations. J. Nonlinear Sci. Appl. 2017, 10, 843–854. [Google Scholar] [CrossRef]
- Yao, Y.; Postolache, M.; Liou, Y.; Yao, Z. Construction algorithms for a class of monotone variational inequalities. Optim. Lett. 2016, 10, 1519–1528. [Google Scholar] [CrossRef]
- Ceng, L.; Postolache, M.; Yao, Y. Iterative algorithms for a system of variational inclusions in Banach spaces. Symmetry 2019, 11, 811. [Google Scholar] [CrossRef]
- Ceng, L.; Petrusel, A.; Yao, J.; Yao, Y. Systems of variational inequalities with hierarchical variational inequality constraints for Lipschitzian pseudocontractions. Fixed Point Theory 2019, 20, 113–134. [Google Scholar] [CrossRef]
- Thanh, T.; Hobiny, A.; Karapnar, E. A solution for the non-cooperative equilibrium problem of two person via fixed point theory. J. Inequal. Appl. 2015, 2015, 158. [Google Scholar] [CrossRef]
- Shehu, Y.; Iyiola, O. on a modified extragradient mehtod for variational inequaliyt problem. J. Ind. Manag. Optim. 2019, 15, 319–342. [Google Scholar]
- Yao, Y.; Shahzad, N. Strong convergence of a proximal point algorithm with general errors. Optim. Lett. 2012, 6, 621–628. [Google Scholar] [CrossRef]
- Zegeye, H.; Shahzad, N.; Yao, Y. Minimum-norm solution of variational inequality and fixed point problem in banach spaces. Optimization 2012, 64, 453–471. [Google Scholar] [CrossRef]
- Yao, Y.; Postolache, M.; Yao, J. Strong convergence of an extragradient algorithm for variational inequality and fixed point problems. U. Politeh. Buch. Ser. A 2013,  in press. [Google Scholar]
- Yao, Y.; Postolache, M.; Yao, J. An iterative algorithm for solving the generalized variational inequalities and fixed points problems. Mathematics 2019, 7, 61. [Google Scholar] [CrossRef]
- Zhang, C.; Zhu, Z.; Yao, Y.; Liu, Q. Homotopy method for solving mathematical programs with bounded box-constrained variational inequalities. Optimization 2019. [Google Scholar] [CrossRef]
- Facchinei, F.; Pang, J. Finite-Dimensional Variational Inequalities and Complementarity Problems; Springer: New York, NY, USA, 2003; Volumes I and II. [Google Scholar]
- Konnov, I. Combined Relaxation Methods for Variational Inequalities; Springer: Berlin, Germany, 2001. [Google Scholar]
- Liu, Z.; Gao, H.; Kang, S.; Shim, S. Auxiliary principle for generalized nonlinear variational-like inequalities. Int. J. Math. Math. Sci. 2006, 2006, 95723. [Google Scholar] [CrossRef]
- Noor, M.; Noor, K.; Said, E. Auxiliary principle technique for solving bifunction variational inequalities. J. Optim. Theory Appl. 2011, 149, 441–445. [Google Scholar] [CrossRef]
- Zhu, D.; Marcotte, P. An extended descent framework for variational inequalities. J. Optim. Theory Appl. 1994, 80, 349–366. [Google Scholar] [CrossRef]
- Yao, Y.; Leng, L.; Postolache, M.; Zheng, X. Mann-type iteration method for solving the split common fixed point problem. J. Nonlinear Convex Anal. 2017, 18, 875–882. [Google Scholar]
- Yao, Y.; Yao, J.; Liou, Y.; Postolache, M. Iterative algorithms for split common fixed points of demicontractive operators without priori knowledge of operator norms. Carpathian J. Math. 2018, 34, 459–466. [Google Scholar]
- Yao, Y.; Liou, Y.; Postolache, M. Self-adaptive algorithms for the split problem of the demicontractive operators. Optimization 2018, 67, 1309–1319. [Google Scholar] [CrossRef]
- Yao, Y.; Agarwal, P.; Postolache, M.; Liou, Y. Algorithms with strong convergence for the split common solution of the feasibility problem and fixed point problem. Fixed Point Theory Appl. 2014, 2014, 183. [Google Scholar] [CrossRef]
- Yao, Y.; Postolache, M.; Liou, Y.C. Strong convergence of a self-adaptive method for the split feasibility problem. Fixed Point Theory Appl. 2013, 2013, 201. [Google Scholar] [CrossRef]
- Censor, Y.; Gibali, A.; Reich, S. Algorithms for the split variational inequality problem. Numer. Algor. 2012, 59, 301–323. [Google Scholar] [CrossRef]
- Kazmi, K. Solving a system of split variational inequality problems. Ann. Univ. Ferrara. 2016, 62, 71–82. [Google Scholar] [CrossRef]
- Clarke, F.; Ledyaev, Y.; Stern, R.; Wolenski, P. Nonsmooth Analysis and Control Theory; Springer: New York, NY, USA, 1998. [Google Scholar]
- Clarke, F.; Stern, R.; Wolenski, P. Proximal smoothness and the lower C2 property. J. Convex Anal. 1995, 2, 117–144. [Google Scholar]
- Poliquin, R.; Rockafellar, R.; Thibault, L. Local differentiability of distance functions. Trans. Am. Math. Soc. 2002, 352, 5231–5249. [Google Scholar] [CrossRef]
- Canino, A. On p-convex sets and geodesics. J. Diff. Equ. 1988, 75, 118–157. [Google Scholar] [CrossRef]
- Franchi, B.; Serapioni, B.; Cassano, F. Regular submanifolds, graphs and area formula in Heisenberg groups. Adv. Math 2007, 211, 152–203. [Google Scholar] [CrossRef]
- Bonatti, C.; Crovisier, S.; Wilkinson, A. The C1 generic diffeomorphism has trivial centralizer. Publ. Math-Paris 2009, 109, 185–244. [Google Scholar] [CrossRef]
- Noor, M. On an implicit method for nonconvex variational inequalities. J. Optim. Theory Appl. 2010, 147, 411–417. [Google Scholar] [CrossRef]
- Bounkhel, M.; Tadj, L.; Hamdi, A. Iterative schemes to solve nonconvex variational problems. J. Inequal. Pure Appl. Math. 2003, 4, 1–14. [Google Scholar]
- Kazmi, K. Split nonconvex variational inequality problem. Math. Sci. 2013, 7, 1–5. [Google Scholar] [CrossRef]
- Noor, M.; Noor, K.; Said, E. On nonconvex bifunction variational inequalities. Optim. Lett. 2012, 6, 1477–1484. [Google Scholar] [CrossRef]
- Sahu, D. Fixed points of demicontinuous nearly Lipschitzian mappings in Banach spaces. Comment. Math. Univ. Carol. 2005, 46, 653–666. [Google Scholar]
© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).