Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programming

Methodology and Computing in Applied Probability

Volumn 10, Issue 2, 2008, Pages 121-178

  Rubinstein, Reuven ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Boltzmann distribution; Combinatorial optimization; Counting problems; Cross entropy; Monte Carlo simulation; Rare events

Indexed keywords

EID: 42649113418     PISSN: 13875841     EISSN: 15737713     Source Type: Journal    
DOI: 10.1007/s11009-007-9061-3     Document Type: Article

References (21)

1. E. H. L. Aarts, and J. H. M. Korst, Simulated Annealing and Boltzmann Machines, Wiley, 1989.
2. S. Arora, E. Hazan, and S. Kale, The Multiplicative Weights Update Method: A Meta Algorith and Applications, Manuscript, Princeton University.
3. A. Ben-Tal, and M. Taboule, "Penalty functions and duality in stochastic programming via φ -divergence functionals," Mathematics of Operations Reseach vol. 12(2) pp. 224-240, 1987.
4. Z. I. Botev, D. P. Kroese, and T. Taimre, "Generalized cross-entropy methods." Proceedings of RESIM06 pp. 1-30, 2006.
5. T. M. Cover, and J. A. Thomas, Elements of Information Theory, Wiley, 1991.
6. A. Ghate, and R. L. Smith, "A dynamic programming approach to efficient sampling from Boltzmann distribution," (accepted for publication)
7. T. Homem-de-Mello, "A study on the cross-entropy method for rare event probability estimation," INFORMS Journal on Computing vol. 19(3) pp 381-394, 2007.
8. G. S. Fishman, Discrete Event Simulation: Modeling, Programming, and Analysis, Springer-Verlag, 2001.
9. J.N. Kapur, and H. K. Kesavan, Entropy Optimization with Applications, Academic, 1992.
10. R. Motwani, and R. Raghavan. Randomized Algorithms, Cambridge University Press, 1997.
11. M. A. Pincus, "A closed form selection of certain programming problems," Operations Research vol. 16 pp. 690-694, 1968.
12. R. Y. Rubinstein, "Optimization of computer simulation models with rare events," European Journal of Operations Research vol. 99 pp. 89-112, 1997.
13. R. Y. Rubinstein, "The cross-entropy method for combinatorial and continuous optimization," Methodology and Computing in Applied Probability vol. 2 pp. 127-190, 1999.
14. R. Y. Rubinstein, "A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation," Methodology and Computing in Applied Probability vol. 1 pp. 1-46, 2005.
15. R. Y. Rubinstein, "How many needles are in a haystack, or how to solve #P-complete counting problems," Methodology and Computing in Applied Probability vol. 1 pp. 1-42, 2007.
16. R. Y. Rubinstein, D. P. Kroese, A. Dolgin, and P. W. Glynn, "Parametric minimum cross-entropy method for counting the number of satisfiability assignments," Manuscript, Technion, Israel.
17. R. Y. Rubinstein, and A. Shapiro, Discrete Event Systems: Sensitivity Analysis and Stochastic Optimization, Wiley, 1993.
18. R. Y. Rubinstein, and D. P. Kroese, The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning, Springer, 2004.
19. R. Y. Rubinstein, and D. P. Kroese, Simulation and the Monte Carlo Method; Second Edition, Wiley, 2007.
20. A. Shapiro, "Stochastic Programming, Handbook in Operations Research and Management Science," A. Ruszczynski and A. Shapiro (eds.), Elsevier, 2003.
21. L. A. Wolsey, Integer Programming, Wiley, 1998.