Space-filling experimental designs for constrained design spaces

References

• Auffray, Y., P. Barbillon, and J. M. Marin. 2012. “Maximin Design on Non Hypercube Domains and Kernel Interpolation.” Statistics and Computing 22 (3): 703–712. doi: 10.1007/s11222-011-9273-9
   Web of Science ®Google Scholar
• Bates, S., J. Sienz, and D. Langley. 2003. “Formulation of the Audze–Eglais Uniform Latin Hypercube Design of Experiments.” Advances in Engineering Software 34: 493–506. doi: 10.1016/S0965-9978(03)00042-5
   Web of Science ®Google Scholar
• Chen, R., D. Hsieh, Y. Hung, and W. Wang. 2012. “Optimizing Latin Hypercube Designs by Particle Swarm.” Statistics and Computing 23 (5): 663–676. doi: 10.1007/s11222-012-9363-3
   Web of Science ®Google Scholar
• Draguljić, D., T. J. Santner, and A. M. Dean. 2012. “Noncollapsing Space-Filling Designs for Bounded Nonrectangular Regions.” Technometrics 54 (2): 169–178. doi: 10.1080/00401706.2012.676951
   Web of Science ®Google Scholar
• Fang, K. T., C. X. Ma, and P. Winker. 2002. “Centered L2-Discrepancy of Random Sampling and Latin Hypercube Design and Construction of Uniform Designs.” Mathematics of Computation 71: 275–297. doi: 10.1090/S0025-5718-00-01281-3
   Web of Science ®Google Scholar
• Flury, B. A. 1990. “Principal Points.” Biometrika 77: 33–41. doi: 10.1093/biomet/77.1.33
   Web of Science ®Google Scholar
• Fuerle, F., and J. Sienz. 2011. “Formulation of the Audze–Eglais Uniform Latin Hypercube Design of Experiments for Constrained Design Spaces.” Advances in Engineering Software 42 (9): 680–689. doi: 10.1016/j.advengsoft.2011.05.004
   Web of Science ®Google Scholar
• Fuerle, F., and J. Sienz. 2013. “Decomposed Surrogate Based Optimization of Carbon-Fiber Bicycle Frames Using Optimum Latin Hypercubes for Constrained Design Spaces.” Computers & Structures 119: 48–59. doi: 10.1016/j.compstruc.2012.11.014
   Web of Science ®Google Scholar
• Georgiou, S. D., and S. Stylianou. 2011. “Block-Circulant Matrices for Constructing Optimal Latin Hypercube Designs.” Journal of Statistical Planning & Inference 141 (5): 1933–1943. doi: 10.1016/j.jspi.2010.12.006
   Web of Science ®Google Scholar
• Hickernell, F. J. 1998. “A Generalized Discrepancy and Quadrature Error Bound.” Mathematics of Computation of the American Mathematical Society 67: 299–322. doi: 10.1090/S0025-5718-98-00894-1
   Web of Science ®Google Scholar
• Jin, R., W. Chen, and A. Sudjianto. 2005. “An Efficient Algorithm for Constructing Optimal Design of Computer Experiments.” Journal of Statistical Planning and Inference 134 (1): 268–287. doi: 10.1016/j.jspi.2004.02.014
   Web of Science ®Google Scholar
• Johnson, M. E., L. E. Moore, and D. Ylvisaker. 1990. “Minimax and Maximin Distance Designs.” Journal of Statistical Planning and Inference 26 (2): 131–148. doi: 10.1016/0378-3758(90)90122-B
   Web of Science ®Google Scholar
• Joseph, V. R. 2016. “Space-Filling Designs for Computer Experiments: A Review.” Quality Engineering 28 (1): 28–35. doi: 10.1080/08982112.2015.1100447
   Web of Science ®Google Scholar
• Lekivetz, R., and B. Jones. 2015. “Fast Flexible Space-Filling Designs for Nonrectangular Regions.” Quality and Reliability Engineering International 31 (5): 829–837. doi: 10.1002/qre.1640
   Web of Science ®Google Scholar
• Liefvendahl, M., and R. Stocki. 2006. “A Study on Algorithms for Optimization of Latin Hypercubes.” Journal of Statistical Planning and Inference 136 (9): 3231–3247. doi: 10.1016/j.jspi.2005.01.007
   Web of Science ®Google Scholar
• Mak, S., and V. R. Joseph. 2018. “Minimax and Minimax Projection Designs Using Clustering.” Journal of Computational & Graphical Statistics 27 (1): 166–178. doi: 10.1080/10618600.2017.1302881
   Web of Science ®Google Scholar
• Mckay, M. D., R. J. Beckman, and W. J. Conover. 1979. “A Comparison of Three Method for Selecting Values of Input Variables in the Analysis of Output From a Computer Code.” Technometrics 2 (21): 239–245.
   Google Scholar
• Montgomery, D. C., E. N. Loredo, D. Jearkpaporn, and M. C. Testik. 2002. “Experimental Designs for Constrained Regions.” Quality Engineering 14 (4): 587–601. doi: 10.1081/QEN-120003561
   Google Scholar
• Morris, M. D., and T. J. Mitchell. 1995. “Exploratory Designs for Computational Experiments.” Journal of Statistical Planning and Inference 43: 381–402. doi: 10.1016/0378-3758(94)00035-T
   Web of Science ®Google Scholar
• Morris, M. D., L. E. Moore, and M. D. McKay. 2006. “Sampling Plans Based on Balanced Incomplete Block Designs for Evaluating the Importance of Computer Model Inputs.” Journal of Statistical Planning and Inference 136: 3203–3220. doi: 10.1016/j.jspi.2005.01.001
   Web of Science ®Google Scholar
• Perrin, G., and C. Cannamela. 2017. “A Repulsion-Based Method for the Definition and the Enrichment of Optimized Space Filling Designs in Constrained Input Spaces.” Journal de la Société Française de Statistique 158 (1): 37–67.
   Google Scholar
• Pholdee, N., and S. Bureerat. 2015. “An Efficient Optimum Latin Hypercube Sampling Technique Based on Sequencing Optimisation Using Simulated Annealing.” International Journal of Systems Science 46 (10): 1780–1789. doi: 10.1080/00207721.2013.835003
   Web of Science ®Google Scholar
• Shewry, M. C., and H. P. Wynn. 1987. “Maximum Entropy Sampling.” Journal of Applied Statistics 14 (2): 165–170. doi: 10.1080/02664768700000020
   Google Scholar
• Stinstra, E., D. den Hertog, P. Stehouwer, and A. Vestjens. 2010. “Uniform Designs Over General Input Domains with Applications to Target Region Estimation in Computer Experiments.” Computational Statistics and Data Analysis 51 (1): 219–232.
   Google Scholar
• Stinstra, E., P. Stehouwer, D. Den Hertog, and A. Vestjens. 2003. “Constrained Maximin Designs for Computer Experiments.” Technometrics 45: 340–346. doi: 10.1198/004017003000000168
   Web of Science ®Google Scholar
• Sun, F., F. Pang, and M. Liu. 2011. “Construction of Column-Orthogonal Designs for Computer Experiments.” Science China Mathematics 54 (12): 2683–2692. doi: 10.1007/s11425-011-4284-8
   Web of Science ®Google Scholar
• Viana, F. A. C., G. Venter, and V. Balabanov. 2010. “An Algorithm for Fast Optimal Latin Hypercube Design of Experiments.” International Journal for Numerical Methods in Engineering 82 (2): 135–156.
   Web of Science ®Google Scholar
• Zhu, H., L. Liu, T. Long, and L. Peng. 2012. “A Novel Algorithm of Maximin Latin Hypercube Design Using Successive Local Enumeration.” Engineering Optimization 44 (5): 551–564. doi: 10.1080/0305215X.2011.591790
   Web of Science ®Google Scholar