Optimal Latin hypercube designs for the Kullback-Leibler criterion

AStA Advances in Statistical Analysis

Volumn 94, Issue 4, 2010, Pages 341-351

  Jourdan, A ^a   Franco, J ^b  

^a UNIVERSITÉ DE CERGY PONTOISE   (France)

^b TOTAL   (France)

Author keywords

Computer experiments; Kullback Leibler information; Optimal Latin hypercube designs; Space filling designs

Indexed keywords

EID: 78650748142     PISSN: 18638171     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10182-010-0145-y     Document Type: Article

References (23)

1. Audze, P., Eglais, V.: New approach for planning out of experiments. In: Problems of Dynamics and Strengths, vol. 35, pp. 104-107 (1977).
2. Bates, S. J., Sienz, J., Toropov, V. V.: Formulation of the optimal Latin hypercube design of experiments using permutation genetic algorithm. In: 45th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference, Palm Springs, CA, April 19-22 2004 (2004). Paper AIAA-2004-2011.
3. Bates, R. A., Buck, R. J., Riccomagno, E., Wynn, H. P.: Experimental design and observation for large Systems. J. R. Stat. Soc. B 58, 77-94 (1996).
4. Beirlant, J., Dudewicz, E. J., Györfi, L., Van Der Meulen, E. C.: Nonparametric entropy estimation: an overview. Int. J. Math. Stat. Sci. 6(1), 17-39 (1997).
5. Currin, C., Mitchell, T., Morris, M., Ylvisaker, D.: A Bayesian approach to the design and analysis of computer experiments. ORNL Technical Report 6498, available from the National technical information service, Springfield, Va. 22161 (1988).
6. Fang, K. T., Li, R., Sudjianto, A.: Design and Modeling for Computer Experiments. Chapman & Hall, London (2006).
7. Grosso, A., Jamali, A. R. M. J. U., Locatelli, M.: Finding maximin Latin hypercube designs by iterated local search heuristics. Eur. J. Oper. Res. 197, 541-547 (2009).
8. Gunzburger, M., Burkardt, J.: Uniformity measures for point sample in hypercubes. https://people. scs. fsu. edu/~burkardt/pdf/ptmeas. pdf (2004).
9. Husslage, B., Rennen, G., van Dam, E., den Hertog, D.: Space-filling Latin hypercube designs for computer experiments. CentER Discussion Paper 2006-18, Tilburg University (2006).
10. Jin, R., Chen, W., Sudjianto, A.: An efficient algorithm for constructing optimal design of computer experiments. J. Stat. Plan. Inference 134, 268-287 (2005).
11. Johnson, M. E., Moore, L. M., Ylvisaker, D.: Minimax and maximin distance design. J. Stat. Plan. Inference 26, 131-148 (1990).
12. Jourdan, A., Franco, J.: Plans d'experiences numeriques d'information de Kullback-Leibler minimale. J. Soc. Fr. Stat., 150(2), 52-64 (2009).
13. Koehler, J. R., Owen, A. B.: Computer experiments. In: Ghosh, S., Rao, C. R. (eds.) Designs and Analysis of Experiments. Handbook of Statistics, vol. 13, pp. 261-308. North-Holland, Amsterdam (1996).
14. Kosachenko, L. F., Leonenko, N. N.: Sample estimate of entropy of a random vector. Probl. Inf. Transm. 23, 95-101 (1987).
15. Levy, S., Steinberg, D. M.: Computer experiments. Adv. Stat. Anal. 94(4), 311-324 (2010).
16. Li, W., Wu, C. F. J.: Column-pairwise algorithms with applications to the construction of supersaturated designs. Technometrics 39, 171-179 (1997).
17. Lievendahl, M., Stocki, R.: A study on algorithms for optimization of Latin hypercubes. J. Stat. Plan. Inference 136, 3231-3247 (2006).
18. Morris, M. D., Mitchell, T. J.: Exploratory designs for computational experiments. J. Stat. Plan. Inference 43, 381-402 (1995).
19. Niederreiter, H.: Point sets and sequences with small discrepancy. Mon. hefte Math. 104, 273-337 (1987).
20. Park, J. S.: Optimal Latin hypercube designs for computer experiments. J. Stat. Plan. Inference 39, 95-111 (1994).
21. Sacks, J., Welch, W. J., Mitchell, T. J., Wynn, H. P.: Design and analysis of Computer Experiments. Stat. Sci. 4, 409-435 (1989).
22. Shewry, M. C., Wynn, H. P.: Maximum entropy sampling. J. Appl. Stat. 14, 165-170 (1987).
23. Ye, K. Q., Li, W., Sudjianto, A.: Algorithmic construction of optimal symmetric Latin hypercube designs. J. Stat. Plan. Inference 90, 145-159 (2000).