摘要：A new method, called the simplex method, is proposed to generate the uniform design over a convex polyhedron in n-dimensional Euclidean

摘要：Some test statistics of Kolmogorov type and Cramér-von Mises type based on projection pursuit technique are proposed for the testing problem of sphericity of a high-dimensional distribution. The limiting distributions of the test statistics are derived under the null hypothesis and under any fixed alternative. The asymptotic properties of bootstrap approximation are investigated. Furthermore, for computational reasons, an approximation for the statistics, based on the number theoretic method, is suggested.

摘要：A predict_correct projection method is presented for solving monotone variant variational inequalities, which could exploit the advantages and overcome the difficulties of both explicit and implicit projection methods.

摘要：Using outward rotations, we obtain an approximation algorithm for MAXn/2-UNCUT problem, i.e., partitioning the vertices of a weighted graph into two blocks of equalcardinality such that the total weight of edges that do not cross the cut is maximized. In manyinteresting cases, the algorithm performs better than the algorithms of Ye and of Halperin andZwick. The main tool used to obtain this result is semidefinite programming.