Stochastic coordinate-exchange optimal designs with complex constraints

References

• Bowman, V. E., and D. C. Woods. 2013. Weighted space-filling designs. Journal of Simulation 7 (4):249–63.
   Web of Science ®Google Scholar
• Cornell, J. 2002. Experiments with mixtures: Designs, models, and the analysis of mixture data. Wiley, New York, 3rd ed.
   Google Scholar
• Draguljić, D.,. A. Dean, and T. Santner. 2012. Non-collapsing maximin designs for Hyper-Polygonal regions. Technometrics 54 (2):169–78.
   Web of Science ®Google Scholar
• Fedorov, V. V. 1972. Theory of optimal experiments. vol. 12, Academic Press, New York.
   Google Scholar
• Hau, I., and G. Box. 1990. “Constrained Experimental Designs, Part I: Construction of Projection Designs,” Technical Report 53, Center for Quality and Productivity Improvement.
   Google Scholar
• Hayeck, G. 2009. “The Kinematics of the Upper Extremity and Subsequent Effects on Joint Loading and Surgical Treatment,” Ph.D. thesis, Cornell University.
   Google Scholar
• Hormann, K., and A. Agathos. 2001. The point in polygon problem for arbitrary polygons. Computational Geometry 20 (3):131–44.
   Web of Science ®Google Scholar
• Hung, Y. 2011. Adaptive Probability-Based latin hypercube designs. Journal of the American Statistical Association 106 (493):213–9.
   Web of Science ®Google Scholar
• Hung, Y., Y. Amemiya, and C. Wu. 2010. Probability-Based latin hypercube designs for Slid-Rectangular regions. Biometrika 97 (4):961–8.
   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–87.
   Web of Science ®Google Scholar
• Joseph, V., and Y. Hung. 2008. Orthogonal-Maximin latin hypercube designs. Statistica Sinica 18 :171–86.
   Web of Science ®Google Scholar
• Joseph, V. R., E. Gul, and S. Ba. 2015. Maximum projection designs for computer experiments. Biometrika 102 (2):371–80.
   Web of Science ®Google Scholar
• Kang, L., and V. Joseph. 2009. Bayesian optimal single arrays for robust parameter design. Technometrics 51 (3):250–61.
   Web of Science ®Google Scholar
• Kang, L., V. Roshan Joseph, and W. Brenneman. 2011. Design and modeling strategies for mixture-of-Mixtures Experiments. Technometrics 53 (2):125–36.
   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–37.
   Web of Science ®Google Scholar
• Li, W. W., and C. F. J. Wu. 1997. Columnwise-Pairwise algorithms with applications to the construction of supersaturated designs. Technometrics 39 (2):171–9.
   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–47.
   Web of Science ®Google Scholar
• Meyer, R. K., and C. J. Nachtsheim. 1995. The Coordinate-Exchange algorithm for constructing exact optimal experimental designs. Technometrics 37 (1):60–9.
   Web of Science ®Google Scholar
• Montgomery, D., E. Loredo, D. Jearkpaporn, and M. Testik. 2002. Experimental designs for constrained regions. Quality Engineering 14 (4):587–601.
   Google Scholar
• Morris, M. D., and T. J. Mitchell. 1995. Exploratory designs for computational experiments. Journal of Statistical Planning and Inference 43 (3):381–402.
   Web of Science ®Google Scholar
• Nguyen, N., and G. Piepel. 2005. Computer-Generated experimental designs for Irregular-Shaped regions. Quality Technology & Quantitative Management 2 (2):147–60.
   Google Scholar
• Piepel, G., S. Cooley, and B. Jones. 2005. Construction of a 21-Component Layered mixture experiment design using a new mixture Coordinate-Exchange algorithm. Quality Engineering 17 (4):579–94.
   Google Scholar
• Pratola, M. T., O. Harari, D. Bingham, and G. E. Flowers. 2017. Design and analysis of experiments on nonconvex regions. Technometrics 59 (1):36–47.
   Web of Science ®Google Scholar
• Santner, T. J., B. J. Williams, and W. I. Notz. 2003. The design and analysis of computer experiments. New York: Springer-Verlag.
   Google Scholar
• SAS Institute Inc 2015. JMP® 12 design of experiments guide. Cary, NC: SAS Institute Inc.
   Google Scholar
• Sasena, M., P. Papalambros, and P. Goovaerts. 2002. “Global optimization of problems with disconnected feasible regions via surrogate modeling,” in 9th AIAA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, pp. 4–6.
   Google Scholar
• Stinstra, E., D. den Hertog, P. Stehouwer, and A. Vestjens. 2003. Constrained maximin designs for computer experiments. Technometrics 45 (4):340–6.
   Web of Science ®Google Scholar
• Trosset, M. 1999. “Approximate maximin distance designs,” in Proceedings of the Section on Physical and Engineering Sciences, pp. 223–227.
   Google Scholar
• Welch, W. J. 1985. ACED: Algorithms for the construction of experimental designs. The American Statistician 39 (2):146.
   Google Scholar
• Ye, K. Q., W. Li, and A. Sudjianto. 2000. Algorithmic construction of optimal symmetric latin hypercube designs. Journal of Statistical Planning and Inference 90 (1):145–59.
   Web of Science ®Google Scholar