A general framework for approximate sampling with an application to generating points on the boundary of bounded convex regions

Statistica Neerlandica

Volumn 52, Issue 1, 1998, Pages 42-59

  Romeijn, H E ^a  

^a ERASMUS UNIVERSITY   (Netherlands)

Author keywords

Probability: Applications; Simulation: Random variable generation

Indexed keywords

EID: 0032351076     PISSN: 00390402     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-9574.00067     Document Type: Article

References (46)

1. APPLEGATE, D. and R. KANNAN (1990), Sampling and integration of near log-concave functions, in: Proceedings of the 23rd ACM Symposium on the Theory of Computing, 156-163.
2. BÉLISLE, C. J. P., H. E. ROMEIJN and R. L. SMITH (1993), Hit-and-run algorithms for generating multivariate distributions, Mathematics of Operations Research 18, 255-266.
3. BERBEE, H. C. P., C. G. E. BOENDER, A. H. G. RINNOOY KAN, C. L. SCHEFFER, R. L. SMITH and J. TELGEN (1987), Hit-and-run algorithms for the identification of nonredundant linear inequalities, Mathematical Programming 37, 184-207.
4. BOENDER, C. G. E., R. J. CARON, J. F. MCDONALD, A. H. G. RINNOOY KAN, H. E. ROMEIJN, R. L. SMITH, J. TELGEN and A. C. F. VORST (1991), Shake-and-bake algorithms for generating uniform points on the boundary of bounded polyhedra, Operations Research 39, 945-954.
5. BOENDER, C. G. E. and H. E. ROMEIJN (1995), Stochastic methods, in: R. Horst and P. M. Pardalos (eds.), Handbook of Global Optimization, 829-869, Kluwer Academic Publishers, Dordrecht, The Netherlands.
6. BOHACHEVSKY, I. O., M. E. JOHNSON and M. L. STEIN (1986), Generalized simulated annealing for function optimization, Technometrics 28, 209-217.
7. BOROVKOV, K. A. (1991), On a new variant of the Monte Carlo method, SIAM Journal on the Theory of Probability and its Applications 36, 355-360.
8. BROOKS, S. H. (1958), A discussion of random methods for seeking maxima, Operations Research 6, 244-251.
9. CHEN, M.-H. and B. SCHMEISER (1993), Performance of the Gibbs, Hit-and-run, and Metropolis samplers, Journal of Computational and Graphical Statistics 2, 251-272.
10. CORANA, A., M. MARCHESI, C. MARTINI and S. RIDELLA (1987), Minimizing multimodal functions for continuous variables with the "simulated annealing" algorithm, ACM Transactions on Mathematical Software 13, 262-280.
11. DEKKERS, A. and E. AARTS (1991), Global optimization and simulated annealing, Mathematical Programming 50, 367-393.
12. VAN DIJK, H. K. (1984), Posterior analysis of econometric models using Monte Carlo integration, PhD thesis, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands.
13. DOOB, J. L. (1953), Stochastic processes, Wiley, New York.
14. DYER, M. E. and A. M. FRIEZE (1992), Computing the volume of convex bodies: a case where randomness probably helps, in: B. Bollobás (ed.), Probabilistic combinatorics and its applications, 123-170, Proceedings of Symposia in Applied Mathematics, volume 44.
15. DYER, M. E., A. M. FRIEZE and R. KANNAN (1991), A random polynomial-time algorithm for approximating the volume of convex bodies, Journal of the Association for Computing Machinery 38, 1-17.
16. DYER, M. E., A. M. FRIEZE and L. STOUGIE (1994), The Hit-and-run algorithm is a fully polynomial randomised algorithm for computing the volume of a convex body, Paper presented at the 15th International Symposium on Mathematical Programming, Ann Arbor, Michigan.
17. GELFAND, A. E. and A. F. M. SMITH (1990), Sampling-based approaches to calculating marginal densities, Journal of the American Statistical Association 85, 398-409.
18. d, SIAM Journal on Control and Optimization 31, 111-131.
19. HAMMERSLEY, J. M. and D. C. HANDSCOMB (1964), Monte Carlo methods, Methuen & Co. Ltd., London, United Kingdom.
20. HASTINGS, W. K. (1970), Monte Carlo sampling methods using Markov chains and their applications, Biometrika 57, 97-109.
21. KAUFMAN, D. E. and R. L. SMITH (1991), Optimal direction choice for Hit-and-run sampling. Technical Report 90-08, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan, forthcoming in Operations Research.
22. LALLEY, S. and H. ROBBINS (1988), Stochastic search in a convex region, Probability Theory and Related Fields 77, 99-116.
23. LOVÁSZ, L. (1991), Geometric algorithms and algorithmic geometry, in: Proceedings of the International Congress of Mathematics, 139-154, Berlin, Germany, Springer-Verlag.
24. LOVÁSZ, L. and M. SIMONOVITS (1990), The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume, in: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 346-354.
25. LOVÁSZ, L. and M. SIMONOVITS (1993), Random walks in a convex body and an improved volume algorithm, Random Structures and Algorithms 4, 359-412.
26. MCDONALD, J. F. (1992), SB algorithms for generating points which are approximately uniformly distributed over the surface of a bounded convex region, Windsor Mathematics and Statistics Report 92-09, Department of Mathematics and Statistics, University of Windsor, Windsor, Ontario, Canada.
27. NUMMELIN, E. (1984), General irreducible Markov chains and non-negative operators, Cambridge University Press, Cambridge, United Kingdom.
28. OREY, S. (1971), Limit theorems for Markov chain transition probabilities, Van Nostrand, New York, New York.
29. PATEL, N. R., R. L. SMITH and Z. B. ZABINSKY (1988), Pure adaptive search in Monte Carlo optimization, Mathematical Programming 43, 317-328.
30. PESKUN, P. H. (1973), Optimum Monte-Carlo sampling using Markov chains, Biometrika 60, 607-612.
31. REVUZ, D. (1975), Markov chains, North-Holland, Amsterdam, The Netherlands.
32. RINNOOY KAN, A. H. G. and G. T. TIMMER (1987a), Stochastic global optimization methods; part I: clustering methods, Mathematical Programming 39, 27-56.
33. RINNOOY KAN, A. H. G. and G. T. TIMMER (1987b), Stochastic global optimization methods; part II: multi level methods, Mathematical Programming 39, 57-78.
34. RITOV, Y. (1989), Monte Carlo computation of the mean of a function with convex support, Computational Statistics and Data Analysis 7, 269-277.
35. ROMEIJN, H. E. (1991), Shake-and-bake algorithms for the identification of nonredundant linear inequalities, Statistica Neerlandica 45, 31-50.
36. ROMEIJN, H. E. (1992), Global optimization by random walk sampling methods, Thesis Publishers, Amsterdam, The Netherlands.
37. ROMEIJN, H. E. and R. L. SMITH (1994a), Simulated annealing and adaptive search in global optimization, Probability in the Engineering and Informational Sciences 8, 571-590.
38. ROMEIJN, H. E. and R. L. SMITH (1994b), Simulated annealing for constrained global optimization, Journal of Global Optimization 5, 101-126.
39. RUBINSTEIN, R. Y. (1981), Simulation and the Monte Carlo method, Wiley, New York.
40. RUBINSTEIN, R. Y. (1982), Generating random vectors uniformly distributed inside and on the surface of different regions, European Journal of Operational Research 10, 205-209.
41. SCHMEISER, B. W. and M.-H. CHEN (1991), On Hit-and-run Monte Carlo sampling for evaluating multidimensional integrals, Technical Report SMS91-1, School of Industrial Engineering, Purdue University, West Lafayette, Indiana.
42. SMITH, R. L. (1982), Private communication.
43. SMITH, R. L. (1984), Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions, Operations Research 32, 1296-1308.
44. TIERNEY, L. (1994), Markov chains for exploring posterior distributions, The Annals of Statistics 22, 1701-1762.
45. ZABINSKY, Z. B. and R. L. SMITH (1992), Pure adaptive search in global optimization, Mathematical Programming 53, 323-338.
46. ZABINSKY, Z. B., R. L. SMITH, J. F. MCDONALD, H. E. ROMEIJN and D. E. KAUFMAN (1993), Improving Hit-and-run for global optimization, Journal of Global Optimization 3, 171-192.