Optimal orthogonal-array-based latin hypercubes

Journal of Applied Statistics

Volumn 30, Issue 5, 2003, Pages 585-598

  Leary, Stephen ^a   Bhaskar, Atul ^a   Keane, Andy ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL METHOD;

EID: 0037409709     PISSN: 02664763     EISSN: None     Source Type: Journal    
DOI: 10.1080/0266476032000053691     Document Type: Article

References (15)

1. CURRIN, C., MITCHELL, T., MORRIS, M. D. & YLVISAKER, D. (1991) Bayesian prediction of deterministic functions, with applications to the design and analysis of computer experiments, Journal of the Americal Statistical Association, 86, pp. 953-963.
2. JOHNSON, M., MOORE, L. & YLVISAKER, D. (1990) Minimax and maximin distance designs, Journal of Statistical Planning and Inference, 26, pp. 131-148.
3. JONES, D. R., SCHONLAU, M. & WELCH, W. J. (1998) Efficient global optimization of expensive blackbox functions, Journal of Global Optimization, 13(4), pp. 455-492.
4. LI, W. & WU, C. F. J. (1997) Columnwise-pairwise algorithms with applications to the construction of supersaturated designs, Technometrics, 39, pp. 171-179.
5. MCKAY, M. D., BECKMAN, R. J. & CONOVER, W. J. (1979) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code, Technometrics, 21, pp. 239-245.
6. MORRIS, M. D. & MITCHELL, T. J. (1995) Exploratory designs for computer experiments, Journal of Statistical Planning and Inference, 43, pp. 381-402.
7. MYERS, R. H. & MONTGOMERY, D. C. (1995) Response Surface Methodology: Process and Product Optimization using Designed Experiments (Wiley).
8. PARK, J. S. (1994) Optimal latin hypercube designs for computer experiments, Journal of Statistical Planning and Inference, 39, pp. 95-111.
9. SACKS, J., SCHILLER, S. B. & WELCH, W. J. (1989) Designs for computer experiments, Technometrics, 34, pp. 15-25.
10. SHEWRY, M. & WYNN, H. (1987) Maximum entropy design, Journal of Applied Statistics, 14, pp. 165-170.
11. TANG, B. (1993) Orthogonal-array-based latin hypercubes, Journal of the Americal Statistical Association, 88, pp. 1392-1397.
12. TANG, B. X. (1994) A theorem for selecting oa-based latin hypercubes using a distance criterion, Communications in Statistics-Theory and Methods, 23, pp. 2047-2058.
13. YE, K. Q. (1998) Column orthogonal latin hypercubes and their application in computer experiments, Journal of the Americal Statistical Association, 93, pp. 1430-1439.
14. YE, K. Q., LI, W. & SUDJIANTO, A. (2000) Algorithmic construction of optimal symmetric latin hypercube designs, Journal of Statistical Planning and Inference, 90, pp. 145-159.
15. ZHU, C., BYRD, R. H., LU, P. & NOCEDAL, J. (1994) L-BFGS-B: a limited memory FORTRAN code for solving bound constrained optimization problems. Technical Report, NAM-11, EECS Department, Northwestern University.