Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
From MaRDI portal
Publication:3345655
DOI10.1287/opre.32.6.1296zbMath0552.65004OpenAlexW2125299871WikidataQ56172085 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 regionrejection techniqueslarge dimensional regionsMarkovian methodsuniformly distributed random points
Related Items (only showing first 100 items - show all)
Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model ⋮ Improving hit-and-run for global optimization ⋮ Simulated annealing for constrained global optimization ⋮ A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding ⋮ Short-run characteristics of samples drawn by random walks ⋮ Random sampling: billiard walk algorithm ⋮ The SMAA-PROMETHEE method ⋮ Notes on ``Hit-and-run enables efficient weight generation for simulation-based multiple criteria decision analysis ⋮ ELECTRE Methods: A Survey on Roman Słowiński Contributions ⋮ Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation ⋮ Oracle lower bounds for stochastic gradient sampling algorithms ⋮ Stochastic multiobjective acceptability analysis for the Choquet integral preference model and the scale construction problem ⋮ Entanglement in bipartite quantum systems: Euclidean volume ratios and detectability by Bell inequalities ⋮ A Fast and Practical Method to Estimate Volumes of Convex Polytopes ⋮ Efficient sampling in spectrahedra and volume approximation ⋮ Exploring stochasticity and imprecise knowledge based on linear inequality constraints ⋮ \(t\)-copula from the viewpoint of tail dependence matrices ⋮ Elicitation of criteria importance weights through the Simos method: a robustness concern ⋮ Stochastic Billiards for Sampling from the Boundary of a Convex Set ⋮ Efficient pairwise preference elicitation allowing for indifference ⋮ GAIA-SMAA-PROMETHEE for a hierarchy of interacting criteria ⋮ Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ An empirical evaluation of walk-and-round heuristics for mixed integer linear programs ⋮ Low-rank separated representation surrogates of high-dimensional stochastic functions: application in Bayesian inference ⋮ Rank constrained distribution and moment computations ⋮ Computing and estimating the volume of the solution space of SMT(LA) constraints ⋮ Pure adaptive search in Monte Carlo optimization ⋮ Single observation adaptive search for discrete and continuous stochastic optimization ⋮ Sampling from the complement of a polyhedron: an MCMC algorithm for data augmentation ⋮ A new approach to the analysis of random methods for detecting necessary linear inequality constraints ⋮ Multiobjective Interacting Particle Algorithm for Global Optimization ⋮ Multiple criteria decision aiding as a prediction tool for migration potential of regions ⋮ Meta-control of an interacting-particle algorithm for global optimization ⋮ Approximating the tail of the Anderson-Darling distribution ⋮ Fixed order controller design subject to engineering specifications ⋮ Efficient computation of the stochastic behavior of partial sum processes ⋮ On the Bayesian calibration of computer model mixtures through experimental data, and the design of predictive models ⋮ A robust hierarchical nominal multicriteria classification method based on similarity and dissimilarity ⋮ Sampling dynamic networks with application to investigation of HIV epidemic drivers ⋮ Approximating Joint Probability Distributions Given Partial Information ⋮ A Simulation-Based Approach to Decision Making with Partial Information ⋮ Hit and run as a unifying device ⋮ An efficient dimension-adaptive uncertainty propagation approach ⋮ Parallel and interacting stochastic approximation annealing algorithms for global optimisation ⋮ Pattern hit-and-run for sampling efficiently on polytopes ⋮ Simulation-based confidence bounds for two-stage stochastic programs ⋮ Exploiting sparsity for semi-algebraic set volume computation ⋮ Comparison of hit-and-run, slice sampler and random walk Metropolis ⋮ Qualitative chain graphs and their application ⋮ Pattern discrete and mixed hit-and-run for global optimization ⋮ Gibbs/Metropolis algorithms on a convex polytope ⋮ The equal spacing of \(N\) points on a sphere with application to partition-of-unity wave diffraction problems ⋮ Slow hit-and-run sampling ⋮ Randomized methods based on new Monte Carlo schemes for control and optimization ⋮ A weighted belief-propagation algorithm for estimating volume-related properties of random polytopes ⋮ An analytically derived cooling schedule for simulated annealing ⋮ Pure adaptive search in global optimization ⋮ Pure Random Search with exponential rate of convergency ⋮ Statistics with set-valued functions: applications to inverse approximate optimization ⋮ Adaptive search with stochastic acceptance probabilities for global optimization ⋮ ParEGO extensions for multi-objective optimization of expensive evaluation functions ⋮ Solving fractional problems with dynamic multistart improving hit-and-run ⋮ A systematic approach for examining the impact of calibration uncertainty in disease modeling ⋮ Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems ⋮ Estimating Latent Processes on a Network From Indirect Measurements ⋮ Hit-and-run algorithms for the identification of nonredundant linear inequalities ⋮ HOW TO GENERATE UNIFORM SAMPLES ON DISCRETE SETS USING THE SPLITTING METHOD ⋮ Generation of classes of robust periodic railway timetables ⋮ A soft approach for hard continuous optimization ⋮ Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints ⋮ Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations ⋮ Efficient uncertainty quantification with the polynomial chaos method for stiff systems ⋮ Unnamed Item ⋮ Research on probabilistic methods for control system design ⋮ On the generation of random stable polynomials ⋮ Volume estimation by monte carlo methods* ⋮ Multi-criteria and medical diagnosis for application to health insurance systems: a general approach through non-additive measures ⋮ Measuring exposure to dependence risk with random Bernstein copula scenarios ⋮ Pairwise comparison tables within the deck of cards method in multiple criteria decision aiding ⋮ Centered solutions for uncertain linear equations ⋮ A Generalized Sampling Approach for Multilinear Utility Functions Given Partial Preference Information ⋮ Generating a random collection of discrete joint probability distributions subject to partial information ⋮ \(D\)-decomposition technique state-of-the-art ⋮ Extracting information about the rotator cuff from magnetic resonance images using deterministic and random techniques ⋮ Robust Optimization with Ambiguous Stochastic Constraints Under Mean and Dispersion Information ⋮ Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule ⋮ A Metropolis-class sampler for targets with non-convex support ⋮ The interacting-particle algorithm with dynamic heating and cooling ⋮ The Gibbs cloner for combinatorial optimization, counting and sampling ⋮ New reflection generator for simulated annealing in mixed-integer/continuous global optimization ⋮ As simple as possible but not simpler in multiple criteria decision aiding: the robust-stochastic level dependent Choquet integral approach ⋮ Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference ⋮ A coherent approach to Bayesian data envelopment analysis ⋮ Monte Carlo computation of the mean of a function with convex support ⋮ Optimal coverage of convex regions ⋮ An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs ⋮ Matching stochastic algorithms to objective function landscapes ⋮ A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems ⋮ The symplectic geometry of closed equilateral random walks in 3-space
This page was built for publication: Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
