An Algorithm for Constructing Orthogonal and Nearly-Orthogonal Arrays With Mixed Levels and Small Runs

Technometrics

Volumn 44, Issue 4, 2002, Pages 356-368

  Xu, Hongquan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

D optimality; Exchange algorithm; Interchange algorithm; J2 optimality

Indexed keywords

CALCULATIONS; COMBINATORIAL MATHEMATICS; MATRIX ALGEBRA; OPTIMIZATION; PRODUCTIVITY; STATISTICAL METHODS;

EXCHANGE ALGORITHM; INTERCHANGE ALGORITHM; ORTHOGONAL ARRAYS;

ALGORITHMS;

EID: 0036849529     PISSN: 00401706     EISSN: 15372723     Source Type: Journal    
DOI: 10.1198/004017002188618554     Document Type: Article

References (33)

1. Box, G. E. P., and Tyssedal, J. (1996), “Projective Properties of Certain Orthogonal Arrays,” Biometrika, 83, 950-955.
2. Cheng, C. S. (1980), “Orthogonal Arrays With Variable Numbers of Symbols,” The Annals of Statistics, 8, 447-453.
3. Cheng, C. S. (1995), “Some Projection Properties of Orthogonal Arrays,” The Annals of Statistics, 23, 1223-1233.
4. Cheng, S.-W., and Wu, C. F. J. (2001), “Factor Screening and Response Surface Exploration” (with discussion), Statistica Sinica, 11, 553-604.
5. Chipman, H., Hamada, M., and Wu, C. F. J. (1997), “A Bayesian Variable-Selection Approach for Analyzing Designed Experiments With Complex Aliasing,” Technometrics, 39, 372-381.
6. Cook, R. D., and Nachtsheim, C. J. (1980), “A Comparison of Algorithms for Constructing Exact D-Optimal Designs,” Technometrics, 22, 315-324.
7. DeCock, D., and Stufken, J. (2000), “On Finding Mixed Orthogonal Arrays of Strength 2 With Many 2-Level Factors,” Statistics and Probability Letters, 50, 383-388.
8. Deng, L. Y., and Tang, B. (1999), “Generalized Resolution and Minimum Aberration Criteria for Plackett-Burman and Other Nonregular Factorial Designs,” Statistica Sinica, 9, 1071-1082.
9. Dueck, G., and Scheuer, T. (1990), “Threshold Accepting: A General Purpose Algorithm Appearing Superior to Simulated Annealing,” Journal of Computational Physics, 90, 161-175.
10. Eccleston, J. A., and Hedayat, A. (1974), “On the Theory of Connected Designs: Characterization and Optimality,” The Annals of Statistics, 2, 1238-1255.
11. Fang, K.-T., Lin, D. K. J., Winker, P., and Zhang, Y. (2000), “Uniform Design: Theory and Application,” Technometrics, 42, 237-248.
12. Galil, Z., and Kiefer, J. (1980), “Time- and Space-Saving Computer Methods, Related to Mitchell’s DETMAX, for Finding D-Optimum Designs,” Technometrics, 22, 301-313.
13. Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, MA: Addison-Wesley.
14. Hamada, M. S., and Wu, C. F. J. (1992), “Analysis of Designed Experiments With Complex Aliasing,” Journal of Quality Technology, 24, 130-137.
15. Hedayat, A. S., Sloane, N. J. A., and Stufken, J. (1999), Orthogonal Arrays: Theory and Applications, New York: Springer-Verlag.
16. Kirkpatrick, S., Gelatt, C. D., Jr., and Vecchi, M. P. (1983), “Optimization by Simulated Annealing,” Science, 220, 671-680.
17. Lam, C., and Tonchev, V. D. (1996), “Classification of Affine Resolvable 2-(27,9,4) Designs,” Journal of Statistical Planning and Inference, 56, 187-202.
18. Li, W. W., and Wu, C. F. J. (1997), “Columnwise-Pairwise Algorithms With Applications to the Construction of Supersaturated Designs,” Technometrics, 39, 171-179.
19. Lin, D. K. J. (1993), “Another Look at First-Order Saturated Designs: The p-Efficient Designs,” Technometrics, 35, 284-292.
20. Lin, D. K. J., and Draper, N. R. (1992), “Projection Properties of Plackett and Burman Designs,” Technometrics, 34, 423-428.
21. Ma, C.-X., Fang, K.-T., and Liski, E. (2000), “A New Approach in Constructing Orthogonal and Nearly Orthogonal Arrays,” Metrika, 50, 255-268.
22. Miller, A. J., and Nguyen, N.-K. (1994), “A Fedorov Exchange Algorithm for D-Optimal Design,” Applied Statistics, 43, 669-677.
23. Myers, R. H., and Montgomery, D. C. (1995), Response Surface Methodology: Process and Product in Optimization Using Designed Experiments, New York: Wiley.
24. Nguyen, N.-K. (1996a), “An Algorithmic Approach to Constructing Supersaturated Designs,” Technometrics, 38, 69-73.
25. Nguyen, N.-K (1996b), “A Note on the Construction of Near-Orthogonal Arrays With Mixed Levels and Economic Run Size,” Technometrics, 38, 279-283.
26. Nguyen, N.-K (2001), “Cutting Experimental Designs into Blocks,” Australian & New Zealand Journal of Statistics, 43, 367-374.
27. Nguyen, N.-K., and Miller, A. J. (1992), “A Review of Some Exchange Algorithms for Constructing Discrete D-Optimal Designs,” Computational Statistics and Data Analysis, 14, 489-498.
28. Rao, C. R. (1947), “Factorial Experiments Derivable from Combinatorial Arrangements of Arrays,” Journal of the Royal Statistical Society, Supplement, 9, 128-139.
29. Tang, B., and Deng, L. Y. (1999), “Minimum G2-Aberration for Non-regular Fractional Factorial Designs,” The Annals of Statistics, 27, 1914-1926.
30. Wang, J. C., and Wu, C. F. J. (1992), “Nearly Orthogonal Arrays With Mixed Levels and Small Runs,” Technometrics, 34, 409-422.
31. Wang, J. C., and Wu, C. F. J (1995), “A Hidden Projection Property of Plackett-Burman and Related Designs,” Statistica Sinica, 5, 235-250.
32. Wu, C. F. J., and Hamada, M. S. (2000), Experiments: Planning, Analysis and Parameter Design Optimization, New York: Wiley.
33. Xu, H., and Wu, C. F. J. (2001), “Generalized Minimum Aberration for Asymmetrical Fractional Factorial Designs,” The Annals of Statistics, 29, 549-560.