A Projection and Contraction Method for P-Order Cone Constraint Stochastic Variational Inequality Problem

In this paper, we study the p-order cone constraint stochastic variational inequality problem. We first take the sample average approximation method to deal with the expectation and gain an approximation problem, further the ra-tionality is given. When the underlying function is Lipschitz continuous, we acquire a projection and contraction algorithm to solve the approximation problem. In the end, the method is applied to some numerical experiments and the effectiveness of the algorithm is verified.


Introduction
Variational inequality has important applications in many aspects such as physics, economic equilibrium theory, cybernetics, engineering, optimization, etc. [1] [2] [3]. Since there are many random factors that cannot be ignored in real life, such as weather, demand, price, etc., stochastic variational inequality has become a research hot-spot of many scholars in recent decades. In this paper, we consider the stochastic variational inequality problem with p-order cone (abbrevd.POSVI), which is to find x C ∈ , such that ( ) where , ⋅ ⋅ denotes the Euclidean inner product, ξ is a random variable defined in probability Ω , Thus, the POSVI in this paper can be regarded as an extension of the second-order constrained stochastic variational inequality problem. The research of theory and algorithm has made great progress in recent decades. Our research focuses on transforming solving the POSVI into finding the zero point of equation and constructing optimization algorithm under certain condition. Hence, the work below is down first.
Assume that a closed convex subset of n R is C and n x R ∈ , then the projection of x on C is [5]: Refer to reference [6], * x is the solution of problem (1) if and only if for any α , the equation holds below Define the residual of the equation as ( ) , then, solving POSVI only needs to find a zero point of ( ) , G x α . In the following, we concentrate on constructing algorithm to solve the problem. There are some optimization algorithms that have been applied to stochastic optimization problem, for example, Korpelevich and Antipin study the outer gradient projection algorithm and every iteration should compute the projection twice, see [7] [8]. On the basis of previous research, Tseng proposes a gradient projection algorithm and every iteration only should compute a projection one time, see [9]. Different from the first two algorithms, Duong and Yekini receive step size through Amjo-type search method, which can decrease the difficulty of [9] to estimate the Lipschitz constant, see [10] [11]. Under a mapping is mono-tone and Lipschitz continuous, Yang and Liu give a projection algorithm and the better of which is that the compute of the step size does not depend on Amjo-like search, see [12] [13] [14]. Combined the above algorithms, we propose a projection and contraction method.
The organizational framework of this paper is as follows: In part 2, we introduce some definitions and conclusions about the p-order cone. In part 3, the basic idea of sample average approximation method is shown and the revelent conclusions are given. In part 4, a projection and contraction method is proposed and it is proved that the sequence generated by the method converges to the real solution. In part 5, a numerical example is given, and the method is applied to solve it. The numerical results claim that the method is effective. In part 6, the work of this paper is summarized and future research topic is given.

Preliminaries
In this section, we give some basic concepts and conclusions related to p-order cone in order to facilitate the following research. the Jordan product of p-order cone is expressed by , : x y x y w , , n w w w = , and 0 0 Lemma 2.1. ( [5]). If the projection formula is defined as (2), then the properties below can be received: , .

Sample Average Approximation
If the integral involved in POSVI can be evaluated, then it can be solved as a deterministic stochastic variational inequality problem. However, are usually not accurately evaluated, because the distribution of ξ is unknown and the information of ξ can only be acquired from the past data samples, which inspires us to search a function to approximate Many scholars have explored approximation methods [17] [18] [19]: sample-path optimization (SPO), sample average approximation (SAA) and stochastic approximation (SA). In this paper, we select SAA method, whose main idea is to generate N independent and identically distributed (i.i.d.) samples 1 2 , , , N ξ ξ ξ , and use the sample average function , we call (1) as true problem and (6) as SAA problem.
Define the moment function of ( ) , j f x ξ as: , such that for any ξ ∈ Ω , and , 3) The moment function   (4) and (3), solving SAA problem (6) is equivalent to find a zero of ( ) , G x α .

Projection and Contraction Method and Convergence Analysis
In this part, we propose the projection and contraction method based on the former research and certify the algorithm is convergent. At last, the algorithm is applied to numerical examples that we give. To facilitate our research, we denote the projection of x onto p K as x + and the projection of x − onto p K * as x − . Hence, it is clear that Step 2 Let k l be the smallest nonnegative integer, which satisfies Step 3 Calculate Step 4 Compute Proof. Prove the above inequality is equivalent to proof From Formula (2), we can get then from Lemma 2.1 (1) and (13), we get the above formula holds because of Lemma 2.1. So the inequality (16) and (17) hold, the proof is complete. Proof. From (10) and (11), it gets that which is equivalent to x be a solution of SAA problem (6), then the first inequality holds since the projection operator is non-expansive, the second inequality holds since Lemma 4.1, and the last inequality holds from inequality (18) and (19). Obviously, the sequence { }

Numerical Experiment
In this section, we certify the effectiveness of algorithm 3.1 by giving some numerical experiments. The tasks are completed by Matlab 2018b, which are installed on a computer that has 3.3 GHz CPU and 4.0 GB memory. We set parameters 0.75, 1.95 u γ = = respectively, and ε denotes error defined by ( ) * x t x − , further, ITER represents average number of iterations and ACPU is the average run time.
Example 5.1. Consider the POSVI below: find x, such that , D is a real symmetric matrix with n dimension, and the element of D is selected randomly by Matlab from the interval [ ] 0,1 . The SAA problem: find x C ∈ , such that       From Tables 1-4 and Figures 1-4, we can analyze that for different p, as the dimension n increases, ITER and ACPU both become larger and relatively stable, and the error ε becomes smaller and tends to zero. Therefore, generally speaking, the algorithm we proposed is effective.
Specially, p = 2 is a special case. When p = 2, P-order cone degenerates into second order cone. From the numerical results, when p = 2 and p = 3, the operation result is better when n is larger. 3 is the smallest number greater than 2. After many numerical experiments, it is found that with the increase of p, the time for large-scale problems will become longer and longer, until p = 10, the calculation results tend to be stable. That is, after p is greater than 10, the calculation Journal of Applied Mathematics and Physics result does not change much. So we chose a middle number, 5.

Conclusion
In this paper, a sample average approximation method is applied to approximate stochastic inequality problem with p-order cone. In order to solve p-order cone stochastic variational inequality problem, under moderate condition, we propose a projection and contraction method and prove the iteration sequence produced by the method converges to the solution of the SAA problem. At last, based on the projection and contraction method, we give some numerical examples and the experimental results verify the accuracy of the method. Next, we expect to investigate the numerical solution of circular cone constrained stochastic variational inequality problem. Find other suitable methods to further solve the p-order cone-constrained stochastic variational inequality problem in this paper, and carry out numerical simulation comparison.