Next Article in Journal
Optimal Control of a PDE Model of an Invasive Species in a River
Next Article in Special Issue
Strongly Convex Functions of Higher Order Involving Bifunction
Previous Article in Journal
Some Implicativities for Groupoids and BCK-Algebras
Previous Article in Special Issue
Inertial Method for Bilevel Variational Inequality Problems with Fixed Point and Minimizer Point Constraints
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Weighted Method for Uncertain Nonlinear Variational Inequality Problems

1
Ningxia Key Laboratory of Intelligent Information and Big Data Processing, Governance and Social Management Research Center of Northwest Ethnic Regions, North Minzu University, Yinchuan 750021, China
2
State Key Laboratory of Mechanics Control of Mechanical Structures, Institute of Nano Science and Department of Mathematics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
3
School of Mathematics and Information Science, North Minzu University, Yinchuan 750021, China
4
Center for General Education, China Medical University, Taichung 40402, Taiwan
5
Institute of Mathematical Statistics and Applied Mathematics, Romanian Academy, 050711 Bucharest, Romania
6
Department of Mathematics and Informatics, University “Politehnica” of Bucharest, 060042 Bucharest, Romania
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Mathematics 2019, 7(10), 974; https://doi.org/10.3390/math7100974
Submission received: 19 August 2019 / Revised: 9 October 2019 / Accepted: 10 October 2019 / Published: 15 October 2019

Abstract

:
A convex combined expectations regularized gap function with uncertain variable is presented to deal with uncertain nonlinear variational inequality problems (UNVIP). The UNVIP is transformed into a minimization problem through an uncertain weighted expected residual function. Moreover, the convergence of the global optimal solutions of the uncertain weighted expected residual minimization model is given through the integration by parts method under the compact space of the uncertain event. The limiting behaviors of the transformed model are analyzed. Furthermore, a compact approximation method is proposed in the unbounded uncertain event space. Through analysis of the convergence of UWERM model and reasonable hypothesis, the compact approximation method is verified under the circumstance of Holder continuity.
MSC:
49J53; 49J40; 65K10; 90C99

1. Introduction

Let S R n be a nonempty closed convex set and f : S R n be a mapping. If there is a vector x * S such that
( x x * ) T f ( x * ) 0 , x S
holds, it is called the variational inequality problem (denoted by VIP(f, S)). In the past several years, the VIP is always a very hot problem in the field of the operation research. The developments of VIP involve theoretic research, effective algorithm for finding solution and applications. Yao [1] established a generalized quasi-variational inequality model. The study of the existence of the variational inequality problem is extended in finite dimensional spaces and the class of problems modeled by the variational inequality theory is enlarged. Some significant existence results are established based on mild assumptions without convexity. In [2], the existence of the variational and the generalized variational inequality problems are presented under the discontinuous mappings. The uniqueness of the solution of the generalized variational inequality problem is given and the existence of the generalized complementarity problem is investigated. In [3], they study the existence of the set-valued variational inequalities (VVI) based on vector mappings. The necessary and sufficient conditions of the existence are established based on the gap functions of VVI. The above shows that the VIP can be transformed into a semi-infinite programming problem by a proper gap function. Postolache et al. [4,5,6,7] made a contribution to the solution and application of variational inequalities. In [4], they consider three classes of variational problem including multitime multiobjective variational problem (VVP), multitime vector fractional variational problem (VFP), and multitime scalar variational problem (SVP). The necessary optimality conditions are established for SVP. The efficient solution and the normal efficiency solution of the two vector variational problems VVP and VFP are presented, and necessary efficiency of conditions of the efficient solution and the normal efficiency solution are established. In [5], the authors construct algorithms for a class of monotone variational inequalities. In [6], the writers prove the existence and approximation of solutions for generalized extended nonlinear variational inequalities. In [7], the authors propose the variant extragradient-type method for monotone variational inequalities. Yao et al. have done a lot of research into the variational inequality problem in the last few years (see [8,9,10]); also, Facchinei and Pang [11] have done similar research. However, for Variational Inequalities with uncertain variables, they involve very little. Uncertainty theory [12] models a kind of degree of belief that the uncertain event will happen. Many applications also contain some uncertain variable, such as a new stock, emergencies, devastating military experiments, etc. Subsequently, the uncertain variational inequality problem is proposed by Chen and Zhu [13]. In their paper, a new class of uncertain variational inequality problems are proposed to find x * S such that
M { γ Γ | ( x x * ) T F ( x * , ξ ( γ ) ) 0 , x S } = 1 ,
where ξ ( γ ) is the uncertain variable, Γ is a nonempty set, F : R n × Γ R n is a mapping. They solve the expected value model based on uncertainty theory.
Li and Jia [14] introduced the uncertain variable in the VIP model, they established an expected residual model about the uncertain variable through a regularized gap function. It is given as
min θ ( x ) θ ( x ) : = E [ g ( x , ξ ) ] = T g ( x , t ) d Φ ( t ) s . t . x S ,
here, ξ B , E stands for the expectation with respect to the uncertain variable ξ , Φ ( t ) stands for the uncertain distribution function with respect to the uncertain variable ξ . T stands for domain of Φ ( t ) . Recall that, for x R n and ξ B ,
g ( x , ξ ) = ( x H ( x , ξ ) ) T F ( x , ξ ) α 2 x H ( x , ξ ) G 2 ,
where
H ( x , ξ ) : = P r o j S . G ( x α 1 G 1 F ( x , ξ ) )
F : R n × R R n is a mapping. α is a positive parameter, G is an n × n symmetric positive-definite matrix, and · G means the G-norm defined by x G = x T G x for x R n .
In [14], Li and Jia considered a linear uncertain variational inequality problem. The properties and convergence analysis of the ERM problem were discussed. Integration by parts method is proposed to solve (2). The purpose of this paper is to introduce UWERM model for dealing with nonlinear uncertain variational inequality problem.
The paper is organized as following. We recall some preliminary results about uncertainty theory and other preliminaries in Section 2. Then, the convergence of global optimal solutions and convergence of stationary points of UWERM model are discussed in Section 3. Furthermore, the compact approximations of UWERM model are covered in Section 4. Finally, the conclusions are given in Section 5.

2. Preliminaries

2.1. Uncertainty Theory

In this section, some fundamental concepts, properties concerning uncertain variables, uncertain distribution and expectation are recalled. Let Γ be a nonempty set, and L a σ -algebra over Γ . Each element Λ in L is called an event and assigned a number M { Λ } to indicate the belief degree with which the Λ will happen. In order to deal with belief degrees correctly, Liu put forward the following three axioms:
Axiom 1 (Normality Axiom). M { Γ } = 1 for the universal set Γ ;
Axiom 2 (Duality Axiom). M { Λ } + M { Λ c } = 1 for any event Λ ;
Axiom 3 (Subadditivity Axiom). For each countable sequence of events Λ 1 , Λ 2 , , we have
M i = 1 Λ i i = 1 M { Λ i } .
Definition 1
(Liu [12]). The set function M is called an uncertain measure if it satisfies the normality, duality, and subadditivity axioms.
The triplet ( Γ , L , M ) is called an uncertainty space. Furthermore, the product uncertain measure on the product σ -algebra L was defined by Liu as follows:
Axiom 4 (Product Axiom). Let ( Γ k , L k , M k ) be uncertainty spaces for k = 1 , 2 , . The product uncertain measure M is an uncertain measure satisfying
M k = 1 Λ k = k = 1 M k { Λ k }
where Λ k are arbitrary events chosen from L k for k = 1 , 2 , , respectively.
Definition 2
(Liu [12]). An uncertain variable is a measurable function ξ from an uncertainty space ( Γ , L , M ) to the set of real numbers, i.e., for any Borel set B of real numbers, the set
{ ξ B } = { γ Γ | ξ ( γ ) B }
is an event.
Theorem 1
(Liu [12]). Let ξ 1 , ξ 2 , , ξ n be uncertain variables, and f a real-valued measurable function. Then ξ = f ( ξ 1 , ξ 2 , , ξ n ) is an uncertain variable defined by
ξ ( γ ) = f ( ξ 1 ( γ ) , ξ 2 ( γ ) , , ξ n ( γ ) ) , γ Γ .
Definition 3
(Liu [12]). Suppose ξ is an uncertain variable. Then the uncertainty distribution of ξ is defined by
Φ ( t ) = M ξ t
for any real number t.
For ranking uncertain variables, the concept of expected value was proposed by Liu [12] as follows:
Definition 4
(Liu [12]). Let ξ be an uncertain variable. Then the expected value of ξ is defined by
E [ ξ ] = 0 + M { ξ t } d t 0 M { ξ t } d t
provided that at least one of the two integrals is finite.
Theorem 2
(Liu [12]). Let ξ be an uncertain variable with uncertainty distribution Φ. If the expected value exists, then
E [ ξ ] = + t d Φ ( t ) .
Corollary 1
(Liu [12]). Let ξ be an uncertain variable with uncertainty distribution Φ and let f(t) be a strictly monotone function, then we have
E [ f ( ξ ) ] = + f ( t ) d Φ ( t ) .

2.2. Other Preliminaries

From Theorem 4.2 of [14] and the continuity of ( F , x F ) , θ is continuously differentiable over S and
θ ( x ) = E [ x g ( x , ξ ) ] , x S .
From non-additivity of the uncertain variable, we can tell there is no density function for uncertain variable. So Φ ( x ) usually is not differentiable in uncertainty theory. By the results given in [15], g ( · , ξ ) is a continuously differentiable function over S for any ξ B , and
x g ( x , ξ ) = F ( x , ξ ) ( x F ( x , ξ ) α G ) ( H ( x , ξ ) x ) .
Theorem 3.
Through [16], we can get the following conclusion
lim k 1 N k t i T k Φ ( t i ) g ( x , t i ) = T Φ ( t ) g ( x , t ) d t
For any x R n , we also have
λ m i n x x G λ m a x x
where G is a positive definite matrix, λ m i n and λ m a x are its smallest and largest eigenvalues, respectively. A and A F denote the spectral norm and the Frobenius norm of matrix A, respectively. The relationship between A and A F , x and x G are as follows,
A A F .
A F j = 1 n A j .
where A j is the jth column vector of A.
These definitions and properties will be used in the latter theorem.

3. Convergence Analysis

3.1. UWERM Establishment and Hypothesis

In this paper, the next formulation (10) is called a uncertain weighted expected residual minimization model with λ [ 0 , 1 ] .
min θ ( x ) : = λ E [ g ( x , ξ ) ] + ( 1 λ ) E [ g 2 ( x , ξ ) ] = T ( λ g ( x , t ) + ( 1 λ ) g 2 ( x , t ) ) d Φ ( t ) s . t . x S ,
where g is defined as (3), E stands for the expectation with respect to the uncertain variable ξ , Φ ( t ) stands for the uncertain distribution function with respect to the uncertain variable ξ .
In this section, we assume that the uncertain space T is compact. Under this assumption, we will investigate the convergence results for (10).
Definition 5.
Let θ k ( x ) minimum be as follows:
min θ k ( x ) = λ g ( x , t ) Φ ( t ) | t T λ N k t i T k Φ ( t i ) g ( x , t i ) + ( 1 λ ) g 2 ( x , t ) Φ ( t ) | t T 2 ( 1 λ ) N k t i T k Φ ( t i ) g ( x , t i ) g ( x , t i )
where the sets T k = { t i | i = 1 , 2 , , N k } is generated by [16], and satisfy N k as k , we call T uncertain event space, theoretically T is domain of Φ ( t ) , g ( x , t ) Φ ( t ) | t T is a function merely related to x.
We will study the following approximations problem to the UWERM problem (10) as follows:
min θ k ( x ) = λ g ( x , t ) Φ ( t ) | t T λ N k t i T k Φ ( t i ) g ( x , t i ) + ( 1 λ ) g 2 ( x , t ) Φ ( t ) | t T 2 ( 1 λ ) N k t i T k Φ ( t i ) g ( x , t i ) g ( x , t i ) s . t . x S
We study the limiting problems (12) in the next section. Let the function F be affine. Some assumptions such as the positive definiteness and the square integrability are given, see [14] for details. To prove the latter theorem, we suppose that the uncertain distribution function Φ ( t ) is continuous on t T , and that a third order derivative of the function F exists (denoted by F x t x ). Owing to H ( x , t ) : = P r o j S . G ( x α 1 G 1 F ( x , t ) ) and H ( x , t ) : = P r o j S . G ( x α 1 G 1 F ( x , t ) ) , it is easy to get H, H x , and H t are continuous. First, the convergence of global optimal solutions is considered.

3.2. Convergence of Global Optimal Solutions

For convenience, we denote by S * and S k * the sets of optimal solutions of problems (10) and (12), respectively. Now, we first give the following lemma which is the robust convergence version of ERM approximate problem.
Lemma 1.
For any fixed x S , we have
θ ( x ) = lim k θ k ( x ) .
Proof. 
It is known from the definition of θ ( x ) function of (10) and integration by parts method that
θ ( x ) : = λ E [ g ( x , ξ ) ] + ( 1 λ ) E [ g 2 ( x , ξ ) ] = T ( λ g ( x , t ) + ( 1 λ ) g 2 ( x , t ) ) d Φ ( t ) = λ g ( x , t ) Φ ( t ) | t T λ T Φ ( t ) g ( x , t ) d t + ( 1 λ ) g 2 ( x , t ) Φ ( t ) | t T ( 1 λ ) T Φ ( t ) 2 g ( x , t ) g ( x , t ) d t
while by the definition of θ k ( x ) function of (11) that
θ k ( x ) = λ g ( x , t ) Φ ( t ) | t T λ N k t i T k Φ ( t i ) g ( x , t i ) + ( 1 λ ) g 2 ( x , t ) Φ ( t ) | t T 2 ( 1 λ ) N k t i T k Φ ( t i ) g ( x , t i ) g ( x , t i )
It can be straightforwardly obtained from (6) that
lim k 1 N k t i T k Φ ( t i ) g ( x , t i ) = T Φ ( t ) g ( x , t ) d t .
and
lim k 1 N k t i T k Φ ( t i ) g ( x , t i ) g ( x , t i ) = T Φ ( t ) g ( x , t ) g ( x , t ) d t .
Thus it holds that θ ( x ) = lim k θ k ( x ) .  □
Theorem 4.
Assume that x k S k * for each sufficiently large k. and x * is an accumulation point of { x k } . Then, we have x * S *
Proof. 
Let x * be an accumulation point of { x k } . Without loss of generality, we assume that { x k } converges to x * . It is obvious that x * S . We first show that
lim k ( θ k ( x k ) θ k ( x * ) ) = 0 .
Let B S be a compact convex set containing the sequence x k . By the continuity of g t x , g and g on the compact set B × T , there exists a constant C 1 , C 2 , C 3 > 0 such that
g t x ( x , t ) C 1 , ( x , ξ ) B × T .
g ( x , t ) C 2 , ( x , ξ ) B × T .
g ( x , t ) C 3 , ( x , ξ ) B × T .
Moreover, we have from the mean-value theorem that, for each x k and each ξ i , there exists y k i = α k i x k + ( 1 α k i ) x * B with α k i [ 0 , 1 ] such that
| g t ( x k , t i ) g t ( x * , t i ) | = | g t x ( y k i , t i ) T ( x k x * ) | .
also there exists z k i = β k i x k + ( 1 β k i ) x * B with β k i [ 0 , 1 ] such that
| ( g ( x k , t ) g t ( x k , t i ) g ( x * , t ) g t ( x * , t i ) ) | = | ( g x g t + g g t x ) ( z k i , t i ) T ( x k x * ) |
So, we have
| θ k ( x k ) θ k ( x * ) | = | λ g ( x k , t ) Φ ( t ) | t T λ N k t i T k Φ ( t i ) g t ( x k , t i ) + ( 1 λ ) g 2 ( x k , t ) Φ ( t ) | t T 1 λ N k t i T k 2 Φ ( t i ) g ( x k , t ) g t ( x k , t i ) λ g ( x * , t ) Φ ( t ) | t T + λ N k t i T k Φ ( t i ) g t ( x * , t i ) ( 1 λ ) g 2 ( x * , t ) Φ ( t ) | t T + 1 λ N k t i T k Φ ( t i ) 2 g ( x * , t ) g t ( x * , t i ) | | λ g ( x k , t ) Φ ( t ) | t T λ g ( x * , t ) Φ ( t ) | t T | + | ( 1 λ ) g 2 ( x k , t ) Φ ( t ) | t T ( 1 λ ) g 2 ( x * , t ) Φ ( t ) | t T | + | λ N k t i T k Φ ( t i ) ( g t ( x k , t i ) g t ( x * , t i ) ) | + | 1 λ N k t i T k 2 Φ ( t i ) ( g ( x k , t ) g t ( x k , t i ) g ( x * , t ) g t ( x * , t i ) ) | | λ g ( x k , t ) Φ ( t ) | t T λ g ( x * , t ) Φ ( t ) | t T | + | ( 1 λ ) g 2 ( x k , t ) Φ ( t ) | t T ( 1 λ ) g 2 ( x * , t ) Φ ( t ) | t T | + λ N k t i T k Φ ( t i ) | ( g t ( x k , t i ) g t ( x * , t i ) ) | + 1 λ N k t i T k Φ ( t i ) | ( g ( x k , t ) g t ( x k , t i ) g ( x * , t ) g t ( x * , t i ) ) | = | λ g ( x k , t ) Φ ( t ) | t T λ g ( x * , t ) Φ ( t ) | t T | + | ( 1 λ ) g 2 ( x k , t ) Φ ( t ) | t T ( 1 λ ) g 2 ( x * , t ) Φ ( t ) | t T | + λ N k t i T k Φ ( t ) | g t x ( y k i , t i ) T ( x k x * ) | + 1 λ N k t i T k Φ ( t ) | ( g x g t + g g t x ) ( z k i , t i ) T ( x k x * ) | | λ g ( x k , t ) Φ ( t ) | t T λ g ( x * , t ) Φ ( t ) | t T | + | ( 1 λ ) g 2 ( x k , t ) Φ ( t ) | t T ( 1 λ ) g 2 ( x * , t ) Φ ( t ) | t T | + λ N k t i T k Φ ( t i ) g t x ( y k i , t i ) · ( x k x * ) + 1 λ N k t i T k Φ ( t i ) ( g x g t + g g t x ) ( z k i , t i ) · ( x k x * ) | λ g ( x k , t ) Φ ( t ) | t T λ g ( x * , t ) Φ ( t ) | t T | + | ( 1 λ ) g 2 ( x k , t ) Φ ( t ) | t T ( 1 λ ) g 2 ( x * , t ) Φ ( t ) | t T | + C 1 ( x k x * ) λ N k t i T k Φ ( t i ) + ( C 2 2 + C 1 C 3 ) ( x k x * ) 1 λ N k t i T k Φ ( t i )
Owing to t i T k Φ ( t i ) N k , so 1 N k t i T k Φ ( t i ) 1 . Because of the fact that the sequence { x k } converges to { x * } . Therefore,
| θ k ( x k ) θ k ( x * ) | k 0 .
On the other hand, noting that
| θ k ( x k ) θ ( x * ) | | θ k ( x k ) θ k ( x * ) | + | θ k ( x * ) θ ( x * ) | ,
so, we have from Lemma 1 and (16) that
lim k θ k ( x k ) = θ ( x * ) .
Since, for each sufficiently large k, x k S k * , there exist ϵ > 0 such that
θ k ( x k ) θ k ( x ) + ϵ
holds for any x S . Letting k + in (19) and taking (18) and lemma 1 into account, we get
θ ( x * ) θ ( x ) + ϵ , x S ,
which means x * S * . □

3.3. Convergence of Stationary Points

Theorem 5.
If lim k x k = x * , then
lim k θ k ( x k ) = θ ( x * ) .
Proof. 
Let B S be a compact convex set containing the sequence x k . By the continuity of F t , F t x , g t , g t x H , H t , and x 2 F j on the compact set B × T , there exists a constant C s u p { x k , k = 1 , 2 , } such that, for any ( x , t ) B × T ,
F t C ,
F t x C ,
g t C ,
g t x C ,
F x t x C ,
H C ,
H t C ,
where F t x denotes the derivative of F ( x , t ) with respect to x,t. We first show that
lim k 0 λ N k t i T k Φ ( t i ) F t ( x k , t i ) F t ( x * , t i ) = 0 .
In fact, from (8) and (9), we have
1 N k t i T k Φ ( t i ) F t ( x k , t i ) F t ( x * , t i ) 1 N k t i T k Φ ( t i ) F t ( x k , t i ) F t ( x * , t i ) F j = 1 n 1 N k t i T k Φ ( t i ) F t ( x k , t i ) j F t ( x * , t i ) j .
Moreover, for each x k , ξ i and any fixed j, from the mean-value theorem, there exists y k i j = τ k i j x k + ( 1 τ k i j ) x ¯ B with τ k i j [ 0 , 1 ] such that
1 N k t i T k Φ ( t i ) F t ( x k , t i ) j F t ( x * , t i ) j 1 N k t i T k Φ ( t i ) F t x ( y k i j , t i ) x k x * C x k x * 1 N k t i T k Φ ( t i ) k 0 ,
where the second inequality follows from (21), while (27) holds immediately from (28) and (29). In a similar way, it holds that
lim k 0 λ N k t i T k Φ ( t i ) F ( x k , t i ) F ( x * , t i ) = 0
and
lim k 0 λ N k t i T k Φ ( t i ) F x ( x k , t i ) F x ( x * , t i ) = 0
and
lim k 0 λ N k t i T k Φ ( t i ) F x t ( x k , t i ) F x t ( x * , t i ) = 0 .
It then follows from (7), (30), and the non-expansive property of P r o j S , G that
1 N k t i T k Φ ( t i ) H ( x * , t i ) H ( x k , t i ) λ m i n 1 2 1 N k t i T k Φ ( t i ) H ( x * , t i ) H ( x k , t i ) G λ m i n 1 2 1 N k t i T k Φ ( t i ) ( x * α 1 G 1 F ( x * , t i ) ( x k α 1 G 1 F ( x k , t i ) G λ m a x 1 2 λ m i n 1 2 1 N k t i T k Φ ( t i ) ( x k x * + α 1 G 1 F ( x k , t i ) F ( x * , t i ) ) k 0 .
So
λ N k t i T k Φ ( t i ) H ( x * , t i ) H ( x k , t i ) k 0
On the other hand, by (21), (25), (32), and (33), we have
1 N k t i T k Φ ( t i ) F x t ( x k , t i ) H ( x k , t i ) F x t ( x * , t i ) H ( x * , t i ) = 1 N k t i T k Φ ( t i ) F x t ( x k , t i ) ( H ( x k , t i ) H ( x * , t i ) ) + ( F x t ( x k , t i ) F x t ( x * , t i ) H ( x * , t i ) 1 N k t i T k Φ ( t i ) ( F x t ( x k , t i ) ( H ( x k , t i ) H ( x * , t i ) + F x t ( x k , t i ) F x t ( x * , t i ) H ( x * , t i ) ) C · 1 N k t i T k Φ ( t i ) ( ( H ( x k , t i ) H ( x * , t i ) + F x t ( x k , t i ) F x t ( x * , t i ) ) k 0 .
So
λ N k t i T k Φ ( t i ) F x t ( x k , t i ) H ( x k , t i ) F x t ( x * , t i ) H ( x * , t i ) k 0
Noting that C s u p { x k , k = 1 , 2 , } , from (24) and (33), it implies that
1 N k t i T k Φ ( t i ) F x t ( x k , t i ) x k F x t ( x * , t i ) x * 1 N k t i T k Φ ( t i ) ( F x t ( x k , t i ) x k F x t ( x * , t i ) x k ) + F x t ( x * , ξ i ) x k x * C · 1 N k t i T k Φ ( t i ) ( F x t ( x k , t i ) F x t ( x * , t i ) + x k x * ) k 0 .
So
λ N k t i T k Φ ( t i ) F x t ( x k , t i ) x k F x t ( x * , t i ) x * k 0 .
By the same way as (33), we have
lim k 0 λ N k t i T k Φ ( t i ) H t ( x k , t i ) H t ( x * , t i ) = 0 .
Thus, from (20), (26), (31), and (34), we can get
1 N k t i T k Φ ( t i ) F x ( x k , t i ) H t ( x k , t i ) F x ( x * , t i ) H t ( x * , t i ) = 1 N k t i T k Φ ( t i ) F x ( x k , t i ) ( H t ( x k , t i ) H t ( x * , t i ) ) + ( F x ( x k , t i ) F x ( x * , t i ) H t ( x * , t i ) 1 N k t i T k Φ ( t i ) ( F x ( x k , t i ) ( H t ( x k , t i ) H t ( x * , t i ) + F x ( x k , t i ) F x ( x * , t i ) H t ( x * , t i ) ) C · 1 N k t i T k Φ ( t i ) ( ( H t ( x k , t i ) H t ( x * , t i ) + F x ( x k , t i ) F x ( x * , t i ) ) k 0 .
Hence
λ N k t i T k Φ ( t i ) F x ( x k , t i ) H t ( x k , t i ) F x ( x * , t i ) H t ( x * , t i ) k 0 .
Through the above analysis, our main purpose is to prove the conclusion of θ k ( x k ) = θ k ( x * ) , in order to prove θ k ( x k ) = θ ( x * ) . By (5) and (33)–(35), we have following naturally
θ k ( x k ) θ ( x * ) = λ g x ( x k , t ) Φ ( t ) | t T λ N k t i T k Φ ( t i ) g x t ( x k , t i ) + ( 1 λ ) 2 g g x ( x k , t ) Φ ( t ) | t T 1 λ N k t i T k Φ ( t i ) ( g t g x + g g x t ) ( x k , t i ) λ g x ( x * , t ) Φ ( t ) | t T + λ N k t i T k Φ ( t i ) g x t ( x * , t i ) ( 1 λ ) 2 g g x ( x k , t ) Φ ( t ) | t T + 1 λ N k t i T k Φ ( t i ) ( g t g x + g g x t ) ( x * , t i ) | λ g x ( x k , t ) Φ ( t ) | t T λ g x ( x * , t ) Φ ( t ) | t T | + | ( 1 λ ) 2 g g x ( x k , t ) Φ ( t ) | t T ( 1 λ ) 2 g g x ( x * , t ) Φ ( t ) | t T | + λ N k t i T k Φ ( t i ) g x t ( x k , t i ) λ N k t i T k Φ ( t i ) g x t ( x * , t i ) + 1 λ N k t i T k Φ ( t i ) ( g t g x + g g x t ) ( x k , t i ) 1 λ N k t i T k Φ ( t i ) ( g t g x + g g x t ) ( x * , t i ) | λ g x ( x k , t ) Φ ( t ) | t T λ g x ( x * , t ) Φ ( t ) | t T | + | ( 1 λ ) 2 g g x ( x k , t ) Φ ( t ) | t T ( 1 λ ) 2 g g x ( x * , t ) Φ ( t ) | t T | + λ N k t i T k Φ ( t i ) ( g x t ( x k , t i ) g x t ( x * , t i ) ) + 1 λ N k t i T k Φ ( t i ) ( ( g t g x + g g x t ) ( x k , t i ) ( g t g x + g g x t ) ( x * , t i ) ) | λ g x ( x k , t ) Φ ( t ) | t T λ g x ( x * , t ) Φ ( t ) | t T | + | ( 1 λ ) g x ( x k , t ) Φ ( t ) | t T ( 1 λ ) g x ( x * , t ) Φ ( t ) | t T | + λ N k t i T k Φ ( t i ) ( [ F t ( x k , t i ) λ F x t ( x k , t i ) ( H ( x k , t i ) x k ) λ ( F x ( x k , t i ) α G ) H t ( x k , t i ) ] λ [ F t ( x * , t i ) F x t ( x * , t i ) ( H ( x * , t i ) x * ) λ ( F x ( x * , t i ) α G ) H t ( x * , t i ) ] ) + 1 λ N k t i T k Φ ( t i ) ( ( g t g x + g g x t ) ( x k , t i ) ( g t g x + g g x t ) ( x * , t i ) ) .
While
1 λ N k t i T k Φ ( t i ) ( ( g t g x + g g x t ) ( x k , t i ) ( g t g x + g g x t ) ( x * , t i ) ) = 1 λ N k t i T k Φ ( t i ) ( ( g t g x ( x k , t i ) g t g x ( x * , t i ) ) + ( g g x t ( x k , t i ) g g x t ( x * , t i ) ) ) .
and
( g t g x ( x k , t i ) g t g x ( x * , t i ) ) = ( g t ( x k , t i ) g x ( x k , t i ) g t ( x k , t i ) g x ( x * , t i ) ) + ( g t ( x k , t i ) g x ( x * , t i ) g t ( x * , t i ) g x ( x * , t i ) ) g t ( x k , t i ) g x ( x k , t i ) g x ( x * , t i ) + g t ( x k , t i ) g t ( x * , t i ) g x ( x * , t i ) ) .
Moreover, we have from the mean-value theorem that, for each x k and each ξ i , there exists η k i = α k i x k + ( 1 α k i ) x * B with α k i [ 0 , 1 ] such that
g t ( x k , t i ) g t ( x * , t i ) = g t x ( η k i , t i ) ( x k x * ) ,
and
g x ( x k , t i ) g x ( x * , t i ) F ( x k , t i ) F ( x * , t i ) + F x ( x k , t i ) H t ( x k , t i ) F x ( x * , t i ) H t ( x * , t i ) + F x ( x k , t i ) x k F x ( x * , t i ) x * α G H ( x k , t i ) H ( x * , t i ) + α G x k x * ,
and
F x ( x k , t i ) H t ( x k , t i ) F x ( x * , t i ) H t ( x * , t i ) = F x ( x k , t i ) ( H t ( x k , t i ) H t ( x * , t i ) ) + ( F x ( x k , t i ) F x ( x * , t i ) ) H t ( x * , t i ) F x ( x k , t i ) H t ( x k , t i ) H t ( x * , t i ) + F x ( x k , t i ) F x ( x * , t i ) H t ( x * , t i ) ,
and
F x ( x k , t i ) x k F x ( x * , t i ) x * = ( F x ( x k , t i ) F x ( x * , t i ) ) x k + F x ( x k , t i ) ( x k x * ) F x ( x k , t i ) F x ( x * , t i ) x k + F x ( x k , t i ) ( x k x * ) ,
and also
( g g x t ( x k , t i ) g g x t ( x * , t i ) ) = ( g ( x k , t i ) g x t ( x k , t i ) g ( x k , t i ) g x t ( x * , t i ) ) + ( g ( x k , t i ) g x t ( x * , t i ) g ( x * , t i ) g x t ( x * , t i ) ) g ( x k , t i ) g x t ( x k , t i ) g x t ( x * , t i ) + g ( x k , t i ) g ( x * , t i ) g x t ( x * , t i ) ) ,
also there exists z k i = β k i x k + ( 1 β k i ) x * B with β k i [ 0 , 1 ] such that
g ( x k , t i ) g ( x * , t i ) = g x ( z k i , t i ) ( x k x * ) .
Through the above discussion and analysis, we get
θ k ( x k ) θ k ( x * ) k 0 ,
through integration by parts, we also know that
θ ( x * ) = E [ x ( λ g ( x * , ξ ) + ( 1 λ ) g 2 ( x * , ξ ) ) ] = λ E [ x g ( x * , ξ ) ] + ( 1 λ ) E [ x g 2 ( x * , ξ ) ] = λ E [ x g ( x * , ξ ) ] + 2 ( 1 λ ) E [ g ( x * , ξ ) g ( x * , ξ ) ] ,
and
E [ x g ( x * , ξ ) ] = T x g ( x * , t ) d Φ ( t ) = x g ( x * , t ) Φ ( t ) | t T T Φ ( t ) d x g ( x * , t ) = x g ( x * , t ) Φ ( t ) | t T T Φ ( t ) g x t ( x * , t ) d t ,
and
E [ g ( x * , ξ ) g ( x * , ξ ) ] = T g ( x * , t ) g ( x * , t ) d Φ ( t ) = g ( x * , t ) g ( x * , t ) Φ ( t ) | t T T Φ ( t ) d g ( x * , t ) g ( x * , t ) = g ( x * , t ) g ( x * , t ) Φ ( t ) | t T T Φ ( t ) d g ( x * , t ) g ( x * , t ) = g ( x * , t ) g ( x * , t ) Φ ( t ) | t T T Φ ( t ) ( ( g ( x * , t ) ) 2 + g ( x * , t ) g ( x * , t ) ) d t .
Notice that
θ k ( x * ) = λ x g ( x * , t ) Φ ( t ) | t T λ N k t i T k Φ ( t i ) g ( x * , t i ) + 2 ( 1 λ ) g ( x * , t ) g ( x * , t ) Φ ( t ) | t T 2 ( 1 λ ) N k t i T k Φ ( t i ) ( ( g ( x * , t i ) ) 2 + g ( x * , t i ) g ( x * , t i ) ) ,
Owing to
lim k 1 N k t i T k Φ ( t i ) g x t ( x * , t i ) = T Φ ( t ) g x t ( x * , t ) d t .
and
lim k 1 N k t i T k Φ ( t i ) ( ( g ( x * , t i ) ) 2 + g ( x * , t i ) g ( x * , t i ) ) , = T Φ ( t ) ( ( g ( x * , t ) ) 2 + g ( x * , t ) g ( x * , t ) ) d t .
So it is easy to see that lim k θ k ( x * ) = θ ( x * ) . Thus, It is clear that lim k θ k ( x k ) = θ ( x * ) .  □
Definition 6.
Suppose that S = { x R n | c ( x ) 0 } , where c i : R n R , i = 1 , 2 , , m , are all continuously differentiable convex functions. A point x k is said to be stationary point of (12) if there exists a Lagrange multiplier vector μ k R m such that
θ k ( x k ) + i = 1 m ( μ i ) k c i ( x k ) = 0 ,
0 μ k , c ( x k ) 0 a n d ( μ k ) T c ( x k ) = 0 .
x * is said to be a stationary point of (10) if there exists a Lagrange multiplier vector μ * R m such that
θ ( x * ) + i = 1 m μ i * c i ( x * ) = 0 ,
0 μ * , c ( x * ) 0 a n d ( μ * ) T c ( x * ) = 0 .
Definition 7.
The Slater’s constraint qualification holds if there exists a vector y R n such that c i ( y ) < 0 for each i = 1 , 2 , , m .
Theorem 6.
Let x k be stationary point to (12) for each k and x * be an accumulation point of { x k } . If the Slater constraint qualification holds, then x * is stationary point to problem (10).
Proof. 
Without loss of generality, we assume that lim k x k = x * . Let μ k be the corresponding multiplier vector satisfying (36) and (37).
(i) We first show that the sequence { μ k } is bounded. To this end, we denote
υ k : = i = 1 m ( μ i ) k .
Let { μ k } be unbounded, which means lim k υ k = + . Taking a subsequence, we may assume that the limits μ i * : = lim k ( μ i ) k υ k ( i = 1 , 2 , , m ) exist. For every i Υ ( x * ) : = { i | c i ( x * ) = 0 , 1 i m } , it holds c i ( x * ) 0 by (37), further more ( μ i * ) T c i ( x * ) = 0 , it holds μ i * = 0 . Then, from (40),
i Υ ( x * ) μ i * = i = 1 m μ i * = 1 .
Note that c i is continuous for each i and { θ k ( x k ) } is convergent by theorem 5. Because of lim k υ k = + , lim k θ k ( x k ) υ k 0 . Dividing (36) by υ k and taking a limit, we obtain
i Υ ( x * ) μ i * c i ( x * ) = i = 1 m μ i * c i ( x * ) = 0 .
Owing to the Slater’s constraint qualification, there exists a vector y R n such that c i ( y ) < 0 for each i = 1 , 2 , , m . Noting that each c i is convex, we have
( y x * ) T c i ( x * ) c i ( y ) c i ( x * ) = c i ( y ) < 0 , i Υ ( x * ) .
From (42) and μ i * 0 for each i by (37), we get μ i * c i ( x * ) = 0 . Furthermore, c i ( x * ) 0 from (43), it implies that μ i * = 0 for each i Υ ( x * ) . This contradicts (41). Hence { μ k } is bounded.
(ii) By (i), then μ k must exists a subsequence such that μ * : = lim k μ k , we still denote it as μ k . Note that both c i and c i are continuous for each i, by Theorem 5, it holds
lim k θ k ( x * ) = θ ( x * ) .
Taking a limit in (36) and (37), we obtain (38) and (39) immediately. Therefore, x * is stationary point to problem (10). □
For the sake of completeness, we will propose a compact approximation approach for the case where T is noncompact in the next section.

4. Case Where Uncertain Event Space T Is Unbounded

The uncertain event space T is supposed to be compact in the last section. From a technical point of view, it might be worthy to study whether approximation problem of (10) remain true under uncertain event space T is unbounded. We now discuss the case where T is an unbounded and closed subset of R l in this section. For this case, given a sufficiently large number ν , we consider its compact approximation. we define a compact approximation of T by
T ν : = { t T | t ν }
and consider the following approximation problem of (10):
min θ ν ( x ) : = E [ g ( x , ξ ) ] = T ν g ( x , t ) d Φ ( t ) s . t . x S .
Since problem (44) has a compact uncertain set, we use the method proposed in the last section to solve (44). We make the following assumptions in this section:
(A1) The function F ( x , t ) is Holder continuous in x on S with order τ > 0 and Holder constant κ ( t ) , which means
F ( x , t ) F ( y , t ) κ ( t ) x y τ , x , y S .
We further suppose that E [ κ 2 ( ξ ) ] < +
(A2) Satisfying E [ F ( x , ξ ) 4 ] < + , x S ,
Theorem 7.
Under the Assumptions (A1) and (A2), we have
E [ g 2 ( x , ξ ) ] < + , x S ,
Proof. 
Since g ( x , t ) 0 for t T , it follows from (3) that
α 2 x H ( x , t ) G 2 ( x H ( x , t ) ) T F ( x , t ) ( x H ( x , t ) ) F ( x , t )
From (7), it holds that
( x H ( x , t ) ) F ( x , t ) λ m i n 1 2 x H ( x , t ) G F ( x , t ) .
We then have
x H ( x , t ) G 2 α λ m i n 1 2 F ( x , t ) ,
and hence
x H ( x , t ) λ m i n 1 2 x H ( x , t ) G 2 α λ m i n F ( x , t ) .
As a result, it holds
g 2 ( x , t ) = ( ( x H ( x , t ) ) T F ( x , t ) α 2 x H ( x , t ) G 2 ) 2 ( x H ( x , t ) F ( x , t ) + α 2 x H ( x , t ) G 2 ) 2 ( 4 α λ m i n F ( x , t ) 2 ) 2 .
So
g 2 ( x , t ) 16 α 2 λ m i n 2 F ( x , t ) 4 .
This, together with (44), implies that E [ g ( x , ξ ) ] < + . We obtain the desired result. □
Theorem 8.
Let x ν be an optimal solution of problem (44) for each ν and let x ˜ be an accumulation point of x ν . Then, under the Assumptions (A1) and (A2), x ˜ is an optimal solution of problem (10).
Proof. 
For simplicity, we assume that lim ν x ν = x ˜ . It is obvious that x ˜ S .
We first show that
lim ν θ ν ( x ν ) = θ ( x ˜ ) .
It holds that
| θ ν ( x ν ) θ ν ( x ˜ ) | = | λ T ν g ( x ν , t ) d Φ ( t ) + ( 1 λ ) T ν g 2 ( x ν , t ) d Φ ( t ) λ T ν g ( x ˜ , t ) d Φ ( t ) ( 1 λ ) T ν g 2 ( x ˜ , t ) d Φ ( t ) λ T | g ( x ν , t ) g ( x ˜ , t ) | d Φ ( t ) + ( 1 λ ) T | g 2 ( x ν , t ) g 2 ( x ˜ , t ) | d Φ ( t )
Firstly, we prove λ T | g ( x ν , t ) g ( x ˜ , t ) | d Φ ( t ) 0 .
| T ν ( g ( x ν , t ) g ( x ˜ , t ) ) d Φ ( t ) | = | T ν ( ( x ν H ( x ν , t ) ) T F ( x ν , t ) α 2 x ν H ( x ν , t ) G 2 ( x ˜ H ( x ˜ , t ) ) T F ( x ˜ , t ) + α 2 x ˜ H ( x ˜ , t ) G 2 ) d Φ ( t ) | , T | ( x ν x ˜ + H ( x ˜ , t ) H ( x ν , t ) ) T F ( x ν , t ) | d Φ ( t ) + T | ( x ˜ H ( x ˜ , t ) ) T ( F ( x ν , t ) F ( x ˜ , t ) ) | d Φ ( t ) + α 2 T | x ˜ H ( x ˜ , t ) G 2 x ν H ( x ν , t ) G 2 | d Φ ( t ) .
Next, we prove T | ( x ν x ˜ + H ( x ˜ , t ) H ( x ν , t ) ) T F ( x ν , t ) | d Φ ( t ) 0 , T | ( x ˜ H ( x ˜ , t ) ) T ( F ( x ν , t ) F ( x ˜ , t ) ) | d Φ ( t ) 0 and α 2 T | x ˜ H ( x ˜ , t ) G 2 x ν H ( x ν , t ) G 2 | d Φ ( t ) 0 , respectively. Before proving them, we have (48). By the nonexpansive property of P r o j S , G , the holder continuity of F, and (7), we have
H ( x ˜ , t ) H ( x ν , t ) G = ( x ˜ α 1 G 1 F ( x ˜ , t ) ( x ν α 1 G 1 F ( x ν , t ) G ( x ˜ x ν G + α 1 G 1 F ( x ˜ , t ) α 1 G 1 F ( x ν , t ) G λ m a x 1 2 ( x ν x ˜ + α 1 G 1 F ( x ν , t ) F ( x ˜ , t ) ) σ ( x ν x ˜ + x ν x ˜ τ κ ( t ) ) ,
where σ : = m a x { λ m a x 1 2 , λ m a x 1 2 α 1 G 1 } .
H ( x ˜ , t ) H ( x ν , t ) λ m i n 1 2 H ( x ˜ , t ) H ( x ν , t ) G σ λ m i n 1 2 ( x ν x ˜ + x ν x ˜ τ κ ( t ) ) .
We have from Theorem 7 and the Cauchy-Schwarz inequality that, for any x S ,
E [ κ ( ξ ) ] E [ κ 2 ( ξ ) ] < + ,
and
E [ F ( x , ξ ) ] E [ F ( x , ξ ) 2 ] < + ,
and
| E [ κ ( ξ ) F ( x , ξ ) ] | E [ κ 2 ( ξ ) ] E [ F ( x , ξ ) 2 ] < + .
Therefore, we can infer that
T | ( x ν x ˜ + H ( x ˜ , t ) H ( x ν , t ) ) T F ( x ν , t ) | d Φ ( t ) T | ( x ν x ˜ + H ( x ˜ , t ) H ( x ν , t ) ) × ( F ( x ˜ , t ) + F ( x ˜ , t ) F ( x ν , t ) ) d Φ ( t ) T | ( ( 1 + σ λ m i n 1 2 ) x ν x ˜ + σ λ m i n 1 2 x ν x ˜ τ κ ( t ) ) × ( F ( x ˜ , t ) + x ν x ˜ τ κ ( t ) d Φ ( t ) = ( 1 + σ λ m i n 1 2 ) x ν x ˜ E [ F ( x ˜ , ξ ) ] + σ λ m i n 1 2 x ν x ˜ τ E [ κ ( ξ ) F ( x ˜ , ξ ) ] + ( 1 + σ λ m i n 1 2 ) x ν x ˜ τ + 1 E [ κ ( ξ ) ] + σ λ m i n 1 2 x ν x ˜ 2 τ E [ κ 2 ( ξ ) ] ν 0 ,
where the second inequality follows from (49) and the holder continuity of F.
Similarly, from Assumption (A1), Theorem 7, and (45)–(52), we obtain
T | ( x ˜ H ( x ˜ , t ) ) T ( F ( x ν , t ) F ( x ˜ , t ) ) | d Φ ( t ) T x ˜ H ( x ˜ , t ) F ( x ν , t ) F ( x ˜ , t ) d Φ ( t ) T 2 α λ m i n F ( x ˜ , t ) F ( x ν , t ) F ( x ˜ , t ) d Φ ( t ) 2 α λ m i n x ν x ˜ τ T κ ( t ) F ( x ˜ , t ) d Φ ( t ) = 2 α λ m i n x ν x ˜ τ E [ κ ( t ) F ( x ˜ , t ) ] ν 0 ,
and
α 2 T | ( x ˜ H ( x ˜ , t ) ) G 2 x ν H ( x ν , t ) ) G 2 | d Φ ( t ) = α 2 T | ( x ˜ H ( x ˜ , t ) G + x ν H ( x ν , t ) G ) × ( x ˜ H ( x ˜ , t ) G x ν H ( x ν , t ) G ) | d Φ ( t ) α 2 T ( x ˜ H ( x ˜ , t ) G + x ν H ( x ν , t ) G ) × x ˜ H ( x ˜ , t ) x ν + H ( x ν , t ) G d Φ ( t ) λ m i n 1 2 T ( F ( x ˜ , t ) + F ( x ν , t ) ) × ( λ m a x 1 2 x ν x ˜ + H ( x ˜ , t ) H ( x ν , t ) G ) d Φ ( t ) λ m i n 1 2 T ( 2 F ( x ˜ , t ) + x ν x ˜ τ κ ( t ) ) × ( ( λ m a x 1 2 + σ ) x ν x ˜ + σ x ν x ˜ τ κ ( t ) ) d Φ ( t ) = 2 λ m i n 1 2 ( λ m a x 1 2 + σ ) x ν x ˜ E [ F ( x ˜ , ξ ) ] + 2 σ λ m i n 1 2 x ν x ˜ τ E [ κ ( ξ ) F ( x ˜ , ξ ) ] + ( λ m i n 1 2 ( λ m a x 1 2 + σ ) x ν x ˜ τ + 1 E [ κ ( ξ ) ] + σ λ m i n 1 2 x ν x ˜ 2 τ E [ κ 2 ( ξ ) ) ] ν 0 .
By consequence, it holds that
| T ( g ( x ν , t ) g ( x ˜ , t ) ) d Φ ( t ) | ν 0 .
Then, we prove ( 1 λ ) T | g 2 ( x ν , t ) g 2 ( x ˜ , t ) | d Φ ( t ) 0 .
By mean-value theorem, for each x ν and each ξ , there exist y ν = a ν x ν + ( 1 a ν ) x ˜ with a ν [ 0 , 1 ] such that
g 2 ( x ν , t ) g 2 ( x ˜ , t ) = 2 g ( y ν , ξ ) g x ( y ν , ξ ) T ( x ν x ˜ ) ,
it follows that
| g 2 ( x ν , t ) g 2 ( x ˜ , t ) | 2 g ( y ν , ξ ) g x ( y ν , ξ ) T · ( x ν x ˜ ) .
Furthermore, in view of the continuity of g, g x and the compactness of { y ν } × T ν , as ν , we have that
( 1 λ ) T ν | g 2 ( x ν , t ) g 2 ( x ˜ , t ) | d Φ ( t ) 0 .
From (53) and (54), it holds that
| θ ν ( x ν ) θ ν ( x ˜ ) | ν 0 .
On the other hand, it is easy to see from Theorem 7 that
lim ν ( θ ν ( x ˜ ) θ ( x ˜ ) ) = lim ν T T ν ( λ g ( x ˜ , t ) + ( 1 λ ) g 2 ( x ˜ , t ) ) d Φ ( t ) = 0 .
Noting that
| θ ν ( x ν ) θ ( x ˜ ) | | θ ν ( x ν ) θ ν ( x ˜ ) | + | θ ν ( x ˜ ) θ ( x ˜ ) | ,
we get (47) from (55) and (56) immediately.
(ii) Since x ν is an optimal solution of problem (44) for each ν , we have
θ ν ( x ν ) θ ν ( x ) θ ( x ) , x S .
Consequently, letting ν in (57) and taking (47) into account, we obtain
θ ( x ˜ ) θ ( x ) , x S .
This manifests that x ˜ is an optimal solution of (10). □

5. Conclusions

Based on the discussion of the previous section, we proposed a method of convex combined expectations of the least absolute deviation and least squares about the so-called regularized gap function for nonlinear uncertain variational inequality problems (for short, UNVIP). We succeeded in establishing the UWERM model and extend the results given in [14] to the case where the uncertain event space is compact. As shown in the paper, convergence of global optimal solutions and convergence of stationary points are analyzed respectively. Moreover, we present a compact approximation approach for the case where the uncertain event space is unbounded.

Author Contributions

All authors contributed equally and significantly in writing this article: writing—original draft preparation, Z.J., conceptualization, C.L. and M.P., investigation, Z.J., funding acquisition, C.L. All authors read and approved the final manuscript.

Funding

National Natural Science Foundation of China (No. 71561001), the Major Projects of North Minzu University (ZDZX201805), the Key Scientific Research Projects in 2017 at North Minzu University (2017KJ13) and First-Class Disciplines Foundation of Ningxia (Grant No. NXYLXK2017B09).

Acknowledgments

This work was supported by the National Natural Science Foundation of China (No. 71561001), the Major Projects of North Minzu University (ZDZX201805), the Key Scientific Research Projects in 2017 at North Minzu University (2017KJ13) and First-Class Disciplines Foundation of Ningxia (Grant No. NXYLXK2017B09).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Yao, J.C. The generalized quasi-variational inequality problem with applications. J. Math. Anal. Appl. 1991, 158, 139–160. [Google Scholar] [CrossRef] [Green Version]
  2. Yao, J.; Guo, J. Variational and generalized variational inequality with discontinuous mappings. J. Math. Anal. Appl. 1994, 82, 371–392. [Google Scholar] [CrossRef]
  3. Yang, X.Q.; Yao, J.C. Gap functions and fxistence of solutions to set-valued vector variational inequalities. J. Optim. Theory Appl. 2002, 115, 407–417. [Google Scholar] [CrossRef]
  4. Mititelu, S.; Postolache, M. Efficiency and duality for multitime vector fractional variational problems on manifolds. Balk. J. Geom. Appl. 2011, 16, 90–101. [Google Scholar]
  5. Yao, Y.H.; Postolache, M. Construction algorithms for a class of monotone variational inequalities. Optim. Lett. 2016, 10, 1519–1528. [Google Scholar] [CrossRef]
  6. Thakur, B.S.; Postolache, M. Existence and approximation of solutions for generalized extended nonlinear variational inequalities. J. Inequal. Appl. 2013, 2013, 590. [Google Scholar] [CrossRef] [Green Version]
  7. Yao, Y.; Postolache, M.; Liou, Y.C. Variant extragradient-type method for monotone variational inequalities. Fixed Point Theory Appl. 2013, 2013, 185. [Google Scholar] [CrossRef] [Green Version]
  8. Yao, Y.H.; Chen, R.D.; Xu, H.K. Schemes for finding minimum-norm solutions of variational inequalities. Nonlinear Anal. 2010, 72, 3447–3456. [Google Scholar] [CrossRef]
  9. Yao, Y.H.; Liou, Y.C.; Yao, J.C. 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] [Green Version]
  10. Yao, Y.H.; Zheng, X.X. The split variational inequality problem and its algorithm iteration. J. Nonlinear Sci. Appl. 2017, 10, 2649–2661. [Google Scholar] [CrossRef] [Green Version]
  11. Facchinei, F.; Pang, J.S. Finite-Dimensional Variational Inequalities and Complementarity Problems; Springer: New York, NY, USA, 2003. [Google Scholar]
  12. Liu, B. Uncertainty Theory, 4th ed.; Springer: Berlin, Germany, 2015. [Google Scholar]
  13. Chen, Q.Q.; Zhu, Y.G. A class of uncertain variational inequality problems. J. Inequal. Appl. 2015, 2015, 231. [Google Scholar] [CrossRef]
  14. Li, C.L.; Jia, Z.F. Expected residual minimization method for uncertain variational inequality problems. J. Nonlinear Sci. Appl. 2017, 10, 5958–5975. [Google Scholar] [CrossRef] [Green Version]
  15. Fukushima, M. Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Program. 1992, 53, 99–110. [Google Scholar] [CrossRef]
  16. Niederreiter, H. Random Number Generation and Quasi-Monte Carlo Methods; SIAM: Philadelphia, PA, USA, 1992. [Google Scholar]

Share and Cite

MDPI and ACS Style

Li, C.; Postolache, M.; Jia, Z. Weighted Method for Uncertain Nonlinear Variational Inequality Problems. Mathematics 2019, 7, 974. https://doi.org/10.3390/math7100974

AMA Style

Li C, Postolache M, Jia Z. Weighted Method for Uncertain Nonlinear Variational Inequality Problems. Mathematics. 2019; 7(10):974. https://doi.org/10.3390/math7100974

Chicago/Turabian Style

Li, Cunlin, Mihai Postolache, and Zhifu Jia. 2019. "Weighted Method for Uncertain Nonlinear Variational Inequality Problems" Mathematics 7, no. 10: 974. https://doi.org/10.3390/math7100974

APA Style

Li, C., Postolache, M., & Jia, Z. (2019). Weighted Method for Uncertain Nonlinear Variational Inequality Problems. Mathematics, 7(10), 974. https://doi.org/10.3390/math7100974

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop