Abstract
In this paper, we consider stochastic mixed vector variational inequality problems. Firstly, we present an equivalent form for the stochastic mixed vector variational inequality problems. Secondly, we present a deterministic bi-criteria model for giving the reasonable resolution of the stochastic mixed vector variational inequality problems and further propose the approximation problem for solving the given deterministic model by employing the smoothing technique and the sample average approximation method. Thirdly, we obtain the convergence analysis for the proposed approximation problem while the sample space is compact. Finally, we propose a compact approximation method when the sample space is not a compact set and provide the corresponding convergence results.
Keywords:
stochastic; mixed vector variational inequality; deterministic bi-criteria model; sample average approximation; compact approximation MSC:
90C33; 90C15
1. Introduction
Let be a nonempty, closed, and convex set, where () are continuously differentiable vector-valued functions. For every is a continuously differentiable, proper, and convex function with closed effective domain. The mixed vector variational inequality problems (MVVIP) are defined as , for all , satisfying
where and . Obviously, for every , problem (1) is equivalent to finding , satisfying
The above MVVIP can be used to deal with the following multiobjective optimization problems, which originated from the study of utility theory in economics and were first proposed in the economic balance [1]:
where and are all continuously differentiable convex functions on . In [2], by using the exponential penalty method, the authors obtained the penalty approximation problem of (3) as follows:
where is a penalty parameter and satisfying is an exponential function. It is also proved in [2] that the efficient solution of (3) can be approximated by solving the weakly efficient solution of problem (4). It is worth noting that problem (4) is an unconstrained multiobjective optimization problem and function is a convex function.
In fact, solving the weakly efficient solution of problem (4) is equivalent to solving MVVIP (2) (the proof of which can be found in Theorem 1), which indicates that, for a sufficiently large penalty parameter, the solution of MVVIP can be used to approximate the efficient solution of problem (3). Multiobjective optimization problems can be applied to artificial intelligence, engineering, electrical engineering, and medicine [3,4,5,6]. In addition, multiobjective optimization problems also have wide applications in fields such as design optimization, manufacturing, structural health monitoring [7], and chemical engineering [8]. Therefore, MVVIP also have a wide range of applications in production and life, which have certain research significance.
Due to the existence of many uncertain factors, such as price, output, and sales, in actual production and life, in this paper, we mainly consider MVVIP with uncertain factors, that is, stochastic mixed vector variational inequality problems (SMVVIP): finding satisfies
where is a stochastic vector defined on the probability space and is a support set of the probability space. Under the given probability measure, “” stands the abbreviation for “almost surely”. For each , is continuously differentiable vector-valued function at and is continuously differentiable on . Here, and . For simplicity, we use to denote either the stochastic vector or an element of throughout this paper.
To the best of our knowledge, the SMVVIP have not yet been studied. However, there are a few works on the special cases of MVVIP. For instance, Salahuddin et al. [9] and Xie et al. [10] discussed the MVVIP in topological vector spaces and established some existence Theorems. Moreover, Irfan [11] considered a new class of exponential MVVIP involving multi-valued mappings in a fuzzy environment and proved some existence theorems of solutions of exponential MVVIP. In addition, a gap function of a non-smooth mixed weak vector variational inequality problem is given by Jayswal et al. [12]. For more information about the existence of MVVIP solutions and the gap function error bounds, we refer the readers to [13,14,15] and the references therein.
In fact, the SMVVIP is obviously a generalization of the stochastic variational inequality problems (SVIP): finding satisfies
where is a stochastic vector, is a vector-valued function, and D is a nonempty closed convex set. Based on Fukushima’s work in [16], for a giving a parameter , Luo [17] defined a regularized gap function as follows:
The SVIP have been considered in many articles. In particular, Shanbhag [18] considered the applications of SVIP in the power market and radio system design. Moreover, Luo et al. [17] formulated SVIP as a minimization problem, and presented the expected residual minimization (ERM) model for SVIP by taking the gap function as the residual. In addition, Chen et al. [19] investigated the SVIP from a standpoint of minimization of conditional value at risk (CVaR); that is, the authors employed the gap function to define a loss function and presented a deterministic CVaR model for solving SVIP. For more research on SVIP, interested readers can refer to [20,21,22,23,24].
The main contributions of this paper are as follows:
- We present a reasonable deterministic bi-criteria model for solving SMVVIP, which can be regarded as a combination of the ERM model and CVaR model.
- We employ the smoothing technique and the sample average approximation method to present approximation problems for solving the given deterministic model. In addition, we consider the convergence of the proposed approximation problem when the sample space is a compact set.
- When the sample space is not compact, we also propose a compact approximation method and provide convergence results.
We adopt the following standard notations throughout this paper. For a given nonempty set , denotes its interior. For a given vector-valued function , denotes its Jacobian matrix at x. denotes its Jacobian matrix at . denotes its Jacobian matrix at . For a given nonempty set , denotes its normal cone operator at and conv stands for the convex hull of D. For a given real-valued function , denotes its subdifferential operator at x. Moreover, stands for the 2-norm and ,
2. Preliminaries
Definition 1
([25]). The normal cone operator for a nonempty closed convex subset at is defined as
Definition 2
([25]). The definition of the subdifferential of a convex function at x is
Definition 3
([26]). For a function and a parameter , the mapping is the proximal operator defined as
where is a nonempty closed convex subset.
According to reference [27], when G is proper and convex, the proximal operator has many special properties. For example, is single-valued [26] and the proximal operator satisfies the following non-expansive property:
We then give the following inequalities which will be used in later.
Cauchy–Schwarz inequality Let the stochastic variables , is evaluated at interval , and , , then we have
especially, if , we have
We now provide the proof of the statement in the Introduction that “Solving the weakly efficient solution of the problem (4) is equivalent to solve the MVVIP (2)”.
Theorem 1.
Let and . For fixed penalty parameter , the necessary and sufficient condition for to be the solution of the MVVIP is that is the weakly efficient solution of the problem (4).
Proof.
(i) We first prove the necessity. Suppose is not a weakly efficient solution of the problem (4). Due to , for any , there exists such that . Thus, we have
Since is a continuous differentiable convex function, for every , it holds that . Therefore
Since , , problem (7) is equivalent to
This is in contradiction with the solution that is the solution of MVVIP. Therefore, the necessity is established.
(ii) We then prove sufficiency. If is not a solution of the MVVIP, there exists such that
That is, for any , there holds . Because is a convex function, for every , we have . Thus
On the other hand, let , for any the following holds
and
where is the sufficiently small number in . Therefore, combine with (8)–(10) and we can obtain that there exists such that for every and , we have
This contradicts the definition of efficient solution for problem (4). Therefore, the conclusion holds. □
For giving the deterministic model of SMVVIP, we first propose an equivalent formulation for MVVIP by the following Theorem, which is called the equivalent mixed scalar variational inequality problems.
Theorem 2.
Solving the problem is equivalent to finding satisfying
Proof.
(i) We first prove the necessity. Obviously, problem (2) is equivalent to the following form: finding satisfies
Let . Furthermore, noting that is an optimal solution of the following problem
In addition, we observe that the first-order necessary and sufficient condition of the above problem is . By [25], it holds that
Thus, there exists with , satisfying . By the definition of normal cone, we can easily obtain that
Combining with the subdifferential operator of we have
Adding (13) and (14), we obtain
Therefore, the necessity is established.
(ii) Next, we prove the sufficiency. Suppose that there exists , satisfying
Since , there exists at least one , such that
Thus, (15) is equivalent to
Hence, we have
which means that is a solution of MVVIP. □
Now, in order to present the deterministic bi-criteria model for solving SMVVIP, we require introducing the following two deterministic models for solving SVIP mentioned in section one:
- The ERM model for solving SVIP:where stands for mathematical expectation and is the regularized gap function for SVIP.
- The CVaR model for solving SVIP:To present the CVaR model, we first introduce the value at risk (VaR) model. For any fixed x and confidence level , the regularized gap function is taken as the loss function, and the VaR for the loss associated with x is defined aswhere stands for the probability. However, as a decision variable function, VaR usually does not satisfy the convexity and consistency of risk measurement selection. Due to this, Rockafellar et al. [28] proposed the CVaR, which had better properties than VaR and is defined aswhere represents the distribution function of .
Chen et al. [19] gave the CVaR model for solving SVIP as follows:
Because the above two models contain mathematical expectations that are usually difficult to calculate in practice, scholars usually apply the sample average approximation (SAA) method to dispose the expected value. That is, for an integrable function , if the independent identically distributed samples of stochastic variable is , the sample average value can be used to approximate the expected value , where , as . The above limit process holds with probability one (we abbreviated it by “w.p.1” below) by the strong law of large numbers, that is
3. Deterministic Bi-Criteria Model for Solving SMVVIP
In this section, based on the works for solving SVIP, we will present a deterministic bi-criteria model for solving SMVVIP. By Theorem 2, similar to the equivalent form of MVVIP, we can write the SMVVIP (5) as the following equivalent stochastic mixed scalar variational inequality problems: finding satisfies
The existence of stochastic factors lead to the fact that problem (19) does not have a common solution for almost every . Therefore, in order to obtain a reasonable solution, we need to give a reasonable deterministic model for (19), and treat the solution of this deterministic model as the solution of SMVVIP. In order to give the deterministic model, motivated by the work of Fukushima [16], we define the regularized gap function of (19) as follows:
As stated by [29], for any and , we have
which can serve as a gap function of (19), while
Obviously, based on Fukushima’s work in [30], for each , the regularized gap function . In addition, by Theorem 2.2 in [29], we have for each if and only if solves (19). Hence, we can easily obtain that the following optimization problem is equivalent to (19):
According to reference [30], for a given function , when the optimal solution of is unique, let
where the gradient of at x is actually showed by
In addition, by Theorem 3.2 in [16] and for each , and are continuously differentiable, we have is continuously differentiable at . Since the optimal solution of formulation (20) is unique, based on the above results, we can obtain the gradient of at as follows:
where I denotes the unit matrix in appropriate dimension.
Next, in combination with the research of ERM model [17,22] and CVaR model [19], along with the bi-criteria model [31], for solving SVIP, we give the deterministic bi-criteria model for problem (19) as follows:
where and
We adopt the weighted sum method in [32] to deal with the multiobjective optimization problems (23), that is, given a weight coefficient , which can be modeled different degrees of risk aversion to decision-makers in the real world. Using the method mentioned above, we obtain the following weighted optimization problem:
Note that if , (24) becomes the ERM model for solving SMVVIP. Because this model does not take into account the error between the real possible of the regularized gap function and its expected residual, the ERM model is risk neutral. If , (24) converts to the CVaR model for solving SMVVIP, which makes it risk averse. For some investors, though, it may be too conservative. Therefore, the above model can make a compromise between the expected residual of regularized gap function and the robust value model in the worst case. More details about the deterministic bi-criteria model can be found in reference [31]. According to Theorem 2 of [28], for a given parameter , we can easily obtain that problem (24) is equivalent to
where and .
Note that due to the existence of non-smooth function , problem (25) is a non-smooth optimization problem. In order to deal with the non-smoothness of the function, as the special case of the smoothing function proposed by Peng in [33], given a parameter , we can obtain the smoothing form of as follows:
In addition, also has the following properties [34]:
Thus, we give the smoothing approximation problem of problem (25) as follows:
where and let .
Note that problem (27) contains a mathematical expectation that is difficult to compute, and we apply the SAA method introduced in Section 2 to obtain the following smoothing SAA problem of (27):
We will investigate the limiting behavior of these approximation problems in the following section.
4. Convergence Analysis
In this section, we first investigate the limiting behavior of global optimal solutions of problem (28). Then, when is not a compact set, we will propose the compact approximation problem and give the proof of the convergence of compact approximation problem.
4.1. Convergence Behavior of Global Optimal Solutions
We now assume that is related to k, so we let in problem (28) is , and when . From now on, and represent the sets of optimal solutions of problems (25) and (28), respectively.
Theorem 3.
Suppose that is a nonempty compact set. For given parameters r, β and for each k, let and is an accumulation point of . Then, we have w.p.1.
Proof.
We assume that . Let , , and be a compact convex set containing , , and , respectively. By the continuous differentiability of on , there exists a constant satisfying
In addition, since is continuously differentiable on , we have that for any , there exists a constant satisfying
It follows from the mean value theorem that, for each and each , there exists with satisfying
Similarly, for each k and , there exists with satisfying
Thus, according to formulation (29)–(32) we have
Remark 1.
In Theorem 3, we only show the convergence result of the global optimal solution sequence of smoothing SAA problem (28). In fact, when the function can be evaluated, as a part of the proof of Theorem 3, we can easily obtain that the global optimal solution sequence of smoothing approximation problem (27) converges to the global optimal solution of problem (25).
Remark 2.
Note that (28) is a non-convex problem, so it is difficult to obtain a global optimal solution sequence of problem (28) in general. Therefore, it is essential to consider the convergence of stationary points. According to Theorem 2 of reference [35], we can similarly prove that the stationary points of smoothing SAA problem (28) converges to the stationary points of problem (25). Here, we omit the proof process.
4.2. Convergence of the Compact Approximation Problem
It is worth noting that in Theorem 3, the sample space is a compact set. If is not a compact set, we apply the compact approximation method to solve the problem. In order to give the compact approximation problem of (25), for a sufficiently large number , we first define the compact approximation set of as follows:
Then, we present the compact approximation problem of (25) as follows:
where and D be a nonempty closed convex set, and . is a compact set. Next, we make some assumptions.
- (A1)
- For each , there exists an integrable function such that andFurthermore, for every there exists such that
- (A2)
- There exists an integrable function such that andIn addition, there exists such that
Remark 3.
For every , by assumption (A1), for every , we can easily obtain that
Furthermore, for every , we can easily obtain that
In addition, under conditions (A1)–(A2), by Cauchy–Schwarz inequalities and (41) and (42), for every and , we can obtain
and
Similar to (44), we also have
Moreover, by (A2) and (43), we have
Thus, for every and , we have
Lemma 1.
Let (A1)–(A2) hold, then we have
Proof.
Lemma 2.
Suppose that (A1)–(A2) hold and . Then, we have with probability one.
Proof.
(i) We first prove that
By the non-expansive property of (6), , and (A1), we have
In consequence, by , , , (42)–(44) and (51), the following holds
Furthermore, by (42), (44), (45), (49), and the second part of the first inequality of (51), we have
It then follows from , (42)–(45), (49), and (51) that
Moreover, by , , (A2), (43), (47), we can obtain
Furthermore, similar to (55), we have
where the second inequality follows from (51) and the limit holds following from (43), (45), and (47). As maintained by (39) and (52)–(56), the following holds
Thus, the formulation (50) holds.
Next, we show the main convergence result and denote the sets of global optimal solutions of problems (25) and (40) by and , respectively.
Theorem 4.
Suppose that conditions – hold. For each ν, let and is an accumulation point of . Then, we have w.p.1.
Proof.
We assume that , By the inequality given in reference [34] and Lemma 2, we have
It follows from (58) and Lemma 2 that
5. Conclusions
We established the equivalence between SMVVIP and stochastic mixed scalar variational inequality problems. Based on this result, we first proposed a deterministic bi-criteria model (25) for solving SMVVIP. Subsequently, we employed the smoothing technique to derive the smooth approximation problem (27) from (25) and utilized sample average approximation techniques to solve (27). In addition, we have discussed the convergence behavior of the global optimal solutions under the assumption that the sample space is compact. When is not a compact set, the convergence analysis of the compact approximation problem has been considered as well.
Author Contributions
Funding acquisition, M.L.; Supervision, M.L.; Writing—original draft, M.L. and M.D.; writing—review and editing, M.L. and Y.Z. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by the Natural Science Foundation General Project of the Department of Liaoning Province Science and Technology (No. 2021-MS-153).
Conflicts of Interest
The authors declare no conflict of interest.
References
- Smith, A. An Inquiry into the Nature and Causes of the Wealth of Nations; University of Chicago Press: Chicago, IL, USA, 1977. [Google Scholar]
- Liu, S.M.; Feng, E. The exponential penalty function method for multiobjective programming problems. Optim. Methods Softw. 2010, 25, 667–675. [Google Scholar] [CrossRef]
- Cerda-Flores, S.C.; Rojas-Punzo, A.A.; Nápoles-Rivera, F. Applications of Multi-Objective Optimization to Industrial Processes: A Literature Review. Processes 2022, 10, 133. [Google Scholar] [CrossRef]
- Han, S.; Zhu, K.; Zhou, M.C.; Cai, X. Information-Utilization-Method-Assisted Multimodal Multiobjective Optimization and Application to Credit Card Fraud Detection. IEEE Trans. Comput. Soc. Syst. 2021, 8, 856–869. [Google Scholar] [CrossRef]
- Lyons, M.A. Pretomanid dose selection for pulmonary tuberculosis: An application of multi-objective optimization to dosage regimen design. CPT Pharmacometrics Syst. Pharmacol. 2021, 10, 211–219. [Google Scholar] [CrossRef] [PubMed]
- Li, M.; Wang, L.; Wang, Y.; Chen, Z. Sizing optimization and energy management strategy for hybrid energy storage system using multiobjective optimization and random forests. IEEE Trans. Power Electron. 2021, 36, 11421–11430. [Google Scholar] [CrossRef]
- Pereira, J.L.J.; Oliver, G.A.; Francisco, M.B.; Cunha, S.S.; Gomes, G.F. A Review of Multi-objective Optimization: Methods and Algorithms in Mechanical Engineering Problems. Arch. Comput. Methods Eng. 2022, 29, 2285–2308. [Google Scholar] [CrossRef]
- Bhaskar, V.; Gupta, S.K.; Ray, A.K. Applications of multiobjective optimization in chemical engineering. Rev. Chem. Eng. 2000, 16, 1–54. [Google Scholar] [CrossRef]
- Salahuddin; Ahmad, M.K.; Verma, R.U. Existence solutions to mixed vector variational-type inequalities. Adv. Nonlinear Var. 2013, 16, 115–123. [Google Scholar]
- Xie, P.D.; Salahuddin. Generalized mixed general vector variational-like inequalities in topological vector spaces. J. Nonlinear Analysis Optim. Theory Appl. 2013, 4, 163–172. [Google Scholar]
- Irfan, S.S. Exponential Type Mixed Vector Variational Inequalities with Fuzzy Mappings. Panam. Math. J. 2020, 30, 11–26. [Google Scholar]
- Jayswal, A.; Kumari, B.; Ahmad, I. A gap function and existence of solutions for a non-smooth vector variational inequality on Hadamard manifolds. Optimization 2021, 70, 1875–1889. [Google Scholar] [CrossRef]
- Chang, S.; Salahuddin; Wang, L.; Ma, Z.L. Error bounds for mixed set-valued vector inverse quasi-variational inequalities. J. Inequalities Appl. 2020, 1, 160. [Google Scholar] [CrossRef]
- Liu, D.Y.; Jiang, Y. Scalarization of Mixed Vector Variational Inequalities and Error Bounds of Gap Functions. Appl. Math. Mech. 2017, 38, 715–726. [Google Scholar]
- Salahuddin. Set valued exponential type g-mixed vector variational inequality problems. Commun. Appl. Nonlinear Anal. 2017, 24, 59–72. [Google Scholar]
- Fukushima, M. Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Program. 1992, 53, 99–110. [Google Scholar] [CrossRef]
- Luo, M.J.; Lin, G.H. Expected residual minimization method for stochastic variational inequality problems. J. Optim. Theory Appl. 2009, 140, 103–116. [Google Scholar] [CrossRef]
- Shanbhag, U.V. Stochastic Variational Inequality Problems: Applications, Analysis, and Algorithms. In Theory Driven by Influential Applications; Topaloglu, H., Smith, J.C., Greenberg, H.J., Eds.; Informs: Catonsville, MD, USA, 2013; pp. 71–107. [Google Scholar]
- Chen, X.J.; Lin, G.H. CVaR-based formulation and approximation method for stochastic variational inequalities. Numer. Algebr. Control Optim. 2011, 1, 35–48. [Google Scholar] [CrossRef]
- Bot, R.T.; Mertikopoulos, O.; Staudigl, M.; Vuong, P.T. Minibatch forward-backward-forward methods for solving stochastic variational inequalities. Stoch. Syst. 2021, 11, 112–139. [Google Scholar] [CrossRef]
- Jadamba, B.; Khan, A.A.; Sama, M.; Yang, Y. An iteratively regularized stochastic gradient method for estimating a random parameter in a stochastic PDE. A variational inequality approach. J. Nonlinear Var. Anal. 2021, 5, 865–880. [Google Scholar]
- Luo, M.J.; Lin, G.H. Convergence results of the ERM method for nonlinear stochastic variational inequality problems. J. Optim. Appl. 2009, 142, 569–581. [Google Scholar] [CrossRef]
- Wang, S.H.; Lin, R.G.; Shi, Y.T. A stochastic selective projection method for solving a constrained stochastic variational inequality problem. J. Appl. Numer. Optim. 2022, 4, 341–355. [Google Scholar]
- Yang, Z.P.; Zhang, J.; Zhu, X.D.; Lin, G.H. Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications. J. Comput. Appl. Math. 2019, 352, 382–400. [Google Scholar] [CrossRef]
- Fukushima, M. Fundamentals of Nonlinear Optimization; Asakura Shoten: Tokyo, Japan, 2001. [Google Scholar]
- Solodov, M.V. Merit functions and error bounds for generalized variational inequalities. J. Math. Anal. Appl. 2003, 287, 405–414. [Google Scholar] [CrossRef]
- Bauschke, H.H.; Combettes, P.L. Convex Analysis and Monotone Operator Theory in Hilbert Spaces; Springer: New York, NY, USA, 2011. [Google Scholar]
- Rockafellar, R.T.; Uryasev, S. Optimization of conditional value-at-risk. J. Risk 2000, 2, 21–42. [Google Scholar] [CrossRef]
- Chen, L.; Lin, G.H.; Yang, X.M. Expected Residual Minimization Method for Stochastic Mixed Variational Inequality Problems. Pac. J. Optim. 2017, 14, 703–722. [Google Scholar]
- Fukushima, M. Merit functions for variational inequality and complementarity problems. In Nonlinear Optimization and Applications; Di Pillo, G., Giannessi, F., Eds.; Plenum Press: New York, NY, USA, 1996; pp. 155–170. [Google Scholar]
- Yang, X.M.; Zhao, Y.; Lin, G.H. Deterministic Bicriteria Model for Stochastic Variational Inequalities. J. Oper. Res. Soc. China 2018, 6, 507–527. [Google Scholar] [CrossRef]
- Ehrgott, M. Multicriteria Optimization; Springer Science & Business Media: Heidelberg, Germany, 2005. [Google Scholar]
- Peng, J.M. A Smoothing Function and Its Applications. Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods; Springer: Boston, MA, USA, 1998; pp. 293–316. [Google Scholar]
- Chen, C.H.; Mangasarian, O.L. A class of smoothing function for nonlinear and mixed complementarity problems. Comput. Optim. Appl. 1996, 5, 97–138. [Google Scholar] [CrossRef]
- Luo, M.J.; Zhang, K. Convergence Analysis of the Approximation Problems for Solving Stochastic Vector Variational Inequality Problems. Complexity 2020, 2020, 1203627. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 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 (https://creativecommons.org/licenses/by/4.0/).