Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
From MaRDI portal
Publication:3345655
DOI10.1287/opre.32.6.1296zbMath0552.65004WikidataQ56172085 ScholiaQ56172085MaRDI QIDQ3345655
Publication date: 1984
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2027.42/7681
bounded region; rejection techniques; large dimensional regions; Markovian methods; uniformly distributed random points
Related Items
Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints, A Hit‐and‐Run approach for generating scale invariant Small World networks, Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control, Meta-control of an interacting-particle algorithm for global optimization, Fixed order controller design subject to engineering specifications, Monte Carlo computation of the mean of a function with convex support, Matching stochastic algorithms to objective function landscapes, A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems, Adaptive search with stochastic acceptance probabilities for global optimization, \(D\)-decomposition technique state-of-the-art, The interacting-particle algorithm with dynamic heating and cooling, The Gibbs cloner for combinatorial optimization, counting and sampling, Optimal coverage of convex regions, Pure adaptive search in Monte Carlo optimization, A new approach to the analysis of random methods for detecting necessary linear inequality constraints, Pure adaptive search in global optimization, New reflection generator for simulated annealing in mixed-integer/continuous global optimization, Simulated annealing for constrained global optimization, Slow hit-and-run sampling, Efficient uncertainty quantification with the polynomial chaos method for stiff systems, Improving hit-and-run for global optimization, An analytically derived cooling schedule for simulated annealing, Solving fractional problems with dynamic multistart improving hit-and-run, Generation of classes of robust periodic railway timetables, A soft approach for hard continuous optimization, Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations, Hit-and-run algorithms for the identification of nonredundant linear inequalities, Volume estimation by monte carlo methods*, Pure Random Search with exponential rate of convergency, HOW TO GENERATE UNIFORM SAMPLES ON DISCRETE SETS USING THE SPLITTING METHOD, Short-run characteristics of samples drawn by random walks
