Solution of Stochastic Quadratic Programming with Imperfect Probability Distribution Using Nelder-Mead Simplex Method

Stochastic quadratic programming with recourse is one of the most important topics in the field of optimization. It is usually assumed that the probability distribution of random variables has complete information, but only part of the information can be obtained in practical situation. In this paper, we pro-pose a stochastic quadratic programming with imperfect probability distribution based on the linear partial information (LPI) theory. A direct optimizing algorithm based on Nelder-Mead simplex method is proposed for solving the problem. Finally, a numerical example is given to demonstrate the efficiency of the algorithm.


Introduction
Stochastic programming is an important method to solve decision problems in random environment.It was proposed by Dantzig, an American economist in 1956 [1].Currently, the main method to solve the stochastic programming is to transform the stochastic programming into its own deterministic equivalence class and using the existing deterministic planning method to solve it.According to different research problems, stochastic programming mainly consists of three problems: distribution problem, expected value problem, and probabilistic constraint programming problem.Classic stochastic programming with recourse is a type of expected value problem, modeling based on a two-stage decision-making method.It is a method by making decisions before and after ob- and many important solutions have been proposed [2].In these methods, the dual decomposition L-shape algorithm established in the literature [3] is the most effective algorithm for solving two-stage stochastic programming.It is based on the duality theory, and the algorithm converges to the optimal solution by determining the feasible cutting plane and optimal cutting, and solving the main problem step by step.This method is essentially an external approximation algorithm that can effectively solve the large-scale problems that occur after the stochastic programming is transformed into deterministic mathematical programming.Abaffy and Allevi present a modified version of the L-shaped method in [4], used to solve two-stage stochastic linear programs with fixed recourse.
This method can apply class attributes and special structures to a polyhedron process to solve a certain type of large-scale problems, which greatly reduces the number of arithmetic operations.In general, stochastic programming is based on the complete information about probability distribution, but in practical situation, due to the lack of historical data and statistical theory, it is impossible to obtain complete information of the probability distribution, and can only get partial information in fact.In order to solve this problem, literature [9] and [10] based on fuzzy theory, under the condition that the membership function of certain parameters of the probability distribution is known, the method of determining the two-stage recourse function is given , two-stage and multi-stage stochastic programming problems are distributed and discussed.In [11], based on the linear partial information (LPI) theory of Kofler [12], a class of two-stage stochastic programming with recourse is established, and an L-shape method based on quadratic programming is given.Based on the literature [8] and literature [11], this paper establishes a two-stage stochastic programming model under incomplete probability distribution information based on LPI theory, and presents an improved Nelder-Mead solution method.Experiment shows the algorithm is effective.

The Model of
where Here , , . Assumed that the probability distribution of random variable has the following linear partial information: are fixed matrices, assumed the set of probability distributions π is a polyhedron.Thus the two-stage function can be written as We call Equations ( 1)-( 3) stochastic quadratic programming with recourse models under LPI.
Chen established a similar stochastic quadratic programming model in [8], but assumed that the probability distribution is completely known, that is the "Max" symbol in Equation ( 2) does not appear.The above model is a new stochastic quadratic programming model based on LPI theory to solve the stochastic programming problem with incomplete information probability distribution.

Since ( )
, i g y ω is the convex function about y ([8]), ( ) f y is also the convex function about y (see [13]), and then the problems ( 1)-( 3) essentially belong to the convex programming problem.Obviously the recourse function is not differential, so the Newton method proposed in [8] is no longer applicable.In order to solve this problem, we design a solution based on the improved Nelder-Mead method.The experimental results show that the method is effective.

Modified Nelder-Mead
The Nelder-Mead method (NM) [14] was originally a direct optimization algo-rithm developed for solving the nonlinear programming, NM algorithm belongs to the modified polyhedron method in nature.It searches for the new solution by reflecting the extreme point with the worst function value through the centroid of the remaining extreme points.Experimental shows, compared to random search, the algorithm can find the optimal solution more efficiently.The NM algorithm does not require any gradient information of the function during the entire optimization procedures, it can handle problems for which the gradient does not exist everywhere.NM allows the simplex to rescale or change its shape based on the local behavior of the response function.When the newly-generated point has good quality, an extension step will be taken in the hope that a better solution can be found.On the other hand, when the newly-generated solution is of poor quality, a contraction step will be taken, restricting the search on a smaller region.Since NM determines its search direction only by comparing the function values, it is insensitive to small inaccuracies in function values.
The classic NM method has several disadvantages in the search process.First, the convergence speed of the algorithm depends too much on the choice of initial polyhedron.Indeed, a too small initial simplex can lead to a local search, consequently the NM may convergent to a local solution.Second, NM might perform the shrink step frequently and in turn reduce the size of simplex to the greatest extent.Consequently, the algorithm can converge prematurely at a non-optimal solution.
Chang [15] propose a new variant of Nelder-Mead, called Stochastic Nelder-Mead simplex method (SNM).This method seeks the optimal solution by gradually increasing the sample size during the iterative process of the algorithm, which not only can effectively save the calculation time, but also can increase the adaptability of the algorithm to prevent premature convergence of the algorithm.This article refers to the design idea of [15] and adds an adaptive random search process to solve problems (1)-(3) in the NM algorithm.The specific process of the algorithm is described as follows: Firstly, by attaching a Lagrange multiplier vector λ , convex problems (1)-(3) can be written as an unconstrained problem: Contraction: here it is certain that ( ) ( ) , in this case, we can expect that a better value will be inside the simplex formed by all the vertices, then the simplex contracts.
, the contracted point is determined by ( ) , the contraction is accepted.Replaced Algorithm termination condition: There are different criteria to determine the termination conditions of the NM algorithm in practice, in this paper, we use as our convergence criterion.
Parameters choice: The polyhedron transform in the NM algorithm mainly includes four parameters, α for reflection, β for expansion and γ for con- traction, assumed they satisfy the following constraints: Step 1 calculate the function values of n+1 points, rank all points and identify , , , then the reflection point is expanded using the expansion rule ( ) otherwise return to Step 5; Step 4 if the convergence criterion is met, stop the iteration, otherwise, return to Step 1; Step 5 if ( ) ( ) , the contraction point is determined by calculate ( ) Step 6 when all previous Step s fail, we use adaptive random search to generate new points, then return to Step 1.

Numerical Experiment
Consider the problem (1)-(3) in which , , , optimal function value is 3.7382 θ = , the running time is 29.490318 seconds.this shows, on the one hand, as the information of the probability distribution changes from incomplete to complete information, the objective function values of the models (1)-( 3) constructed tend to have better results.On the other hand, there is no significant increase in the number of iterations of the algorithm during the optimization process.

Conclusion
For the case that the probability distribution has incomplete information, this

X
. S. Ma, X. Liu DOI: 10.4236/jamp.2018.650951112 Journal of Applied Mathematics and Physics serving the value of a variable.With regard to the theory and methods of two-stage stochastic programming, a very systematic study has been conducted While the stochastic programming is transformed into the corresponding equivalence classes, it is generally a nonlinear equation.In recent years, with the introduction of new theories and methods for solving nonlinear equations, especially the infinite dimensional variational inequality theories and the application of smoothness techniques that have received widespread attention in recent years[5] [6][7], a stochastic programming solution method based on nonlinear equation theory is proposed.Chen X. expressed the two-stage stochastic programming as a deterministic equivalence problem in the literature[8], and transformed it into a nonlinear equation problem by introduced Lagrange multiplier.By using the B-differentiable properties of nonlinear functions, a Newton method for solving stochastic programming is proposed.Under certain conditions, the global convergence and local super-linear convergence of the algorithm are proved.

..
a failed contraction is much rarer, it may happen in some case, In that case, generally we contract towards the lowest point in the expectation of finding a simpler landscape.Replace all points except the best point l This article uses the following process: when contraction fails, using a random search process to generate new points based on fitness of function.Let fitness function be According to the roulette algorithm, get a new point by randomly searched in the neighborhood of the point corresponding to the probability interval.The neighborhood ( ) the centroid of all vertices other than h k

Stochastic Quadratic Programming with Imperfect Probability Distribution
which are not on the same plane.Let , ,

Table 2 .
From Table2, we can see the program stops at 89 times, the optimal solution . The running time is 382.307942seconds.Comparing the results, we find that when the value of N is increased by 10 times, the running time increased by 13 times, this is normal, it need more times to calculate the recourse function.However,

Table 1 .
Iterative results.From Table3we can see, the program stops at 64 times, the optimal solution