An economical acceptance-rejection algorithm for uniform random variate generation over constrained simplexes

作者：Ahmadi Javid Amir^*; Moeini Asghar

来源：Statistics and Computing, 2016, 26(3): 703-713.

DOI：10.1007/s11222-015-9553-x

• Uniform random variate generation over simplexes
• Convex optimization
• Simulation-based portfolio optimization
• Stochastic multi-criteria decision analysis
• Distributions with imprecise probabilities
• Mixture experiment design

This paper develops an algorithm for uniform random generation over a constrained simplex, which is the intersection of a standard simplex and a given set. Uniform sampling from constrained simplexes has numerous applications in different fields, such as portfolio optimization, stochastic multi-criteria decision analysis, experimental design with mixtures and decision problems involving discrete joint distributions with imprecise probabilities. The proposed algorithm is developed by combining the acceptance-rejection and conditional methods along with the use of optimization tools. The acceptance rate of the algorithm is analytically compared to that of a crude acceptance-rejection algorithm, which generates points over the simplex and then rejects any points falling outside the intersecting set. Finally, using convex optimization, the setup phase of the algorithm is detailed for the special cases where the intersecting set is a general convex set, a convex set defined by a finite number of convex constraints or a polyhedron.

• 出版日期2016-5