{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T10:47:31Z","timestamp":1770461251668,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003194","name":"Agent\u00fara Ministerstva \u0160kolstva, Vedy, V\u00fdskumu a \u0160portu SR","doi-asserted-by":"publisher","award":["VEGA 1\/0341\/19"],"award-info":[{"award-number":["VEGA 1\/0341\/19"]}],"id":[{"id":"10.13039\/501100003194","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11222-021-10046-2","type":"journal-article","created":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T03:14:36Z","timestamp":1631502876000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal design of multifactor experiments via grid exploration"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4647-862X","authenticated-orcid":false,"given":"Radoslav","family":"Harman","sequence":"first","affiliation":[]},{"given":"Lenka","family":"Filov\u00e1","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Rosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,13]]},"reference":[{"key":"10046_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199296590.001.0001","volume-title":"Optimum Experimental Designs, with SAS","author":"AC Atkinson","year":"2007","unstructured":"Atkinson, A.C., Donev, A.N., Tobias, R.D.: Optimum Experimental Designs, with SAS. Oxford University Press, Oxford (2007)"},{"key":"10046_CR2","unstructured":"Atkinson, A.C., Woods, D.C. Designs for generalized linear models. Handbook of design and analysis of experiments, pp. 471\u2013514 (2015)"},{"key":"10046_CR3","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1214\/aos\/1176342371","volume":"1","author":"CL Atwood","year":"1973","unstructured":"Atwood, C.L.: Sequences converging to D-optimal designs of experiments. Ann. Stat. 1, 342\u2013352 (1973)","journal-title":"Ann. Stat."},{"key":"10046_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01894766","volume":"33","author":"D B\u00f6hning","year":"1986","unstructured":"B\u00f6hning, D.: A vertex-exchange-method in D-optimal design theory. Metrika 33, 337\u2013347 (1986)","journal-title":"Metrika"},{"key":"10046_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0378-3758(89)90004-9","volume":"21","author":"K Chaloner","year":"1989","unstructured":"Chaloner, K., Larntz, K.: Optimal Bayesian design applied to logistic regression experiments. Journal of Statistical Planning and Inference 21, 191\u2013208 (1989)","journal-title":"J. Stat. Plan. Inference"},{"issue":"5","key":"10046_CR6","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1007\/s11222-014-9466-0","volume":"25","author":"RB Chen","year":"2015","unstructured":"Chen, R.B., Chang, S.P., Wang, W., Tung, H.C., Wong, W.K.: Minimax optimal designs via particle swarm optimization methods. Statistics and Computing 25(5), 975\u2013988 (2015)","journal-title":"Stat. Comput."},{"key":"10046_CR7","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1214\/aoms\/1177728915","volume":"24","author":"H Chernoff","year":"1953","unstructured":"Chernoff, H.: Locally optimal designs for estimating parameters. The Annals of Mathematical Statistics 24, 586\u2013602 (1953)","journal-title":"Ann. Math. Stat."},{"key":"10046_CR8","doi-asserted-by":"publisher","first-page":"4397","DOI":"10.1016\/j.jspi.2005.06.006","volume":"136","author":"H Dette","year":"2006","unstructured":"Dette, H., Martinez Lopez, I., Ortiz Rodriguez, I.M., Pepelyshev, A.: Maximin efficient design of experiment for exponential regression models. Journal of Statistical Planning and Inference 136, 4397\u20134418 (2006)","journal-title":"J. Stat. Plan. Inference"},{"key":"10046_CR9","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1198\/004017006000000318","volume":"48","author":"HA Dror","year":"2006","unstructured":"Dror, H.A., Steinberg, D.M.: Robust Experimental Design for Multivariate Generalized Linear Models. Technometrics 48, 520\u2013529 (2006)","journal-title":"Technometrics"},{"key":"10046_CR10","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/s11222-013-9420-6","volume":"24","author":"BP Duarte","year":"2014","unstructured":"Duarte, B.P., Wong, W.K.: A semi-infinite programming based algorithm for finding minimax optimal designs for nonlinear models. Statistics and Computing 24, 1063\u20131080 (2014)","journal-title":"Stat. Comput."},{"key":"10046_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s11222-017-9741-y","volume":"28","author":"BP Duarte","year":"2018","unstructured":"Duarte, B.P., Wong, W.K., Dette, H.: Adaptive grid semidefinite programming for finding optimal designs. Statistics and Computing 28, 441\u2013460 (2018)","journal-title":"Stat. Comput."},{"key":"10046_CR12","volume-title":"Theory of Optimal Experiments","author":"V Fedorov","year":"1972","unstructured":"Fedorov, V.: Theory of Optimal Experiments. Academic Press, New York (1972)"},{"key":"10046_CR13","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s00180-020-00961-9","volume":"35","author":"L Filov\u00e1","year":"2020","unstructured":"Filov\u00e1, L., Harman, R.: Ascent with quadratic assistance for the construction of exact experimental designs. Comput. Statistics 35, 775\u2013801 (2020)","journal-title":"Comput. Stat."},{"key":"10046_CR14","doi-asserted-by":"publisher","first-page":"106844","DOI":"10.1016\/j.csda.2019.106844","volume":"144","author":"R Garc\u00eda-R\u00f3denas","year":"2020","unstructured":"Garc\u00eda-R\u00f3denas, R., Garc\u00eda-Garc\u00eda, J.C., L\u00f3pez-Fidalgo, J., Mart\u00edn-Baos, J.A., Wong, W.K.: A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs. Comput. Stat. Data Anal. 144, 106844 (2020)","journal-title":"Comput. Stat. Data Anal."},{"key":"10046_CR15","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1137\/0132021","volume":"32","author":"PR Gribik","year":"1977","unstructured":"Gribik, P.R., Kortanek, K.O.: Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems. SIAM J. Appl. Math. 32, 232\u2013259 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"10046_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/9781119974017","volume-title":"Optimal Design of Experiments: A Case Study Approach","author":"P Goos","year":"2011","unstructured":"Goos, P., Jones, B.: Optimal design of experiments: a case study approach. Wiley, New York (2011)"},{"key":"10046_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/asmb.2117","volume":"32","author":"R Harman","year":"2016","unstructured":"Harman, R., Bachrat\u00e1, A., Filov\u00e1, L.: Construction of efficient experimental designs under multiple resource constraints. Applied Stochastic Models in Business and Industry 32, 3\u201317 (2016)","journal-title":"Appl. Stoch. Model. Bus. Ind."},{"key":"10046_CR18","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1080\/01621459.2018.1546588","volume":"115","author":"R Harman","year":"2020","unstructured":"Harman, R., Filov\u00e1, L., Richt\u00e1rik, P.: A randomized exchange algorithm for computing optimal approximate designs of experiments. Journal of the American Statistical Association 115, 348\u2013361 (2020)","journal-title":"J. Am. Stat. Assoc."},{"key":"10046_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.csda.2008.06.023","volume":"53","author":"R Harman","year":"2008","unstructured":"Harman, R., Jur\u00edk, T.: Computing c-optimal experimental designs using the simplex method of linear programming. Computational Statistics & Data Analysis 53, 247\u2013254 (2008)","journal-title":"Comput. Stat. Data Anal."},{"key":"10046_CR20","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.spl.2006.05.014","volume":"77","author":"R Harman","year":"2007","unstructured":"Harman, R., Pronzato, L.: Improvements on removing nonoptimal support points in D-optimum design algorithms. Statistics & Probability Letters 77, 90\u201394 (2007)","journal-title":"Stat. Probab. Lett."},{"key":"10046_CR21","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.orl.2020.01.003","volume":"48","author":"R Harman","year":"2020","unstructured":"Harman, R., Rosa, S.: On greedy heuristics for computing D-efficient saturated subsets. Operations Research Letters 48, 122\u2013129 (2020)","journal-title":"Oper. Res. Lett."},{"key":"10046_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0378-3758(92)90031-M","volume":"31","author":"B Heiligers","year":"1992","unstructured":"Heiligers, B.: Admissible experimental designs in multiple polynomial regression. Journal of Statistical Planning and Inference 31, 219\u2013233 (1992)","journal-title":"J. Stat. Plan. Inference"},{"key":"10046_CR23","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1111\/j.2517-6161.1959.tb00338.x","volume":"21","author":"J Kiefer","year":"1959","unstructured":"Kiefer, J.: Optimum experimental designs. J. Roy. Stat. Soc. Ser. B (Methodol.) 21, 272\u2013304 (1959)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"10046_CR24","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1214\/088342306000000105","volume":"21","author":"AI Khuri","year":"2006","unstructured":"Khuri, A.I., Mukherjee, B., Sinha, B.K., Ghosh, M.: Design issues for generalized linear models: A review. Stat. Sci. 21, 376\u2013399 (2006)","journal-title":"Stat. Sci."},{"key":"10046_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/00401706.2018.1439405","volume":"61","author":"J Lukemire","year":"2019","unstructured":"Lukemire, J., Mandal, A., Wong, W.K.: D-qpso: A quantum-behaved particle swarm technique for finding D-optimal designs with discrete and continuous factors and a binary response. Technometrics 61, 77\u201387 (2019)","journal-title":"Technometrics"},{"issue":"4","key":"10046_CR26","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1080\/10618600.2019.1601097","volume":"28","author":"E Masoudi","year":"2019","unstructured":"Masoudi, E., Holling, H., Duarte, B.P., Wong, W.K.: A metaheuristic adaptive cubature based algorithm to find Bayesian optimal designs for nonlinear models. Journal of Computational and Graphical Statistics 28(4), 861\u2013876 (2019)","journal-title":"J. Comput. Graph. Stat."},{"key":"10046_CR27","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.csda.2016.06.014","volume":"113","author":"E Masoudi","year":"2017","unstructured":"Masoudi, E., Holling, H., Wong, W.K.: Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs. Computational Statistics & Data Analysis 113, 330\u2013345 (2017)","journal-title":"Comput. Stat. Data Anal."},{"key":"10046_CR28","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1080\/00401706.1995.10485889","volume":"37","author":"RK Meyer","year":"1995","unstructured":"Meyer, R.K., Nachtsheim, C.J.: The coordinate-exchange algorithm for constructing exact optimal experimental designs. Technometrics 37, 60\u201369 (1995)","journal-title":"Technometrics"},{"key":"10046_CR29","first-page":"1","volume":"48","author":"C M\u00fcller","year":"1995","unstructured":"M\u00fcller, C., P\u00e1zman, A.: Applications of necessary and sufficient conditions for maximin efficient designs. Metrika 48, 1\u201319 (1995)","journal-title":"Metrika"},{"key":"10046_CR30","volume-title":"Foundations of Optimum Experimental Design","author":"A P\u00e1zman","year":"1986","unstructured":"P\u00e1zman, A.: Foundations of optimum experimental design. Reidel, Dordrecht (1986)"},{"key":"10046_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6363-4","volume-title":"Design of Experiments in Nonlinear Models","author":"L Pronzato","year":"2013","unstructured":"Pronzato, L., P\u00e1zman, A.: Design of Experiments in Nonlinear Models. Springer, New York (2013)"},{"key":"10046_CR32","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.jspi.2014.04.005","volume":"154","author":"L Pronzato","year":"2014","unstructured":"Pronzato, L., Zhigljavsky, A.A.: Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria. J. Stat. Plan. Inference 154, 141\u2013155 (2014)","journal-title":"J. Stat. Plan. Inference"},{"key":"10046_CR33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719109","volume-title":"Optimal Design of Experiments (Classics in Applied Mathematics)","author":"F Pukelsheim","year":"2006","unstructured":"Pukelsheim F (2006). Optimal Design of Experiments (Classics in Applied Mathematics). SIAM, Philadelphia"},{"key":"10046_CR34","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1093\/biomet\/79.4.763","volume":"79","author":"F Pukelsheim","year":"1992","unstructured":"Pukelsheim, F., Rieder, S.: Efficient rounding of approximate designs. Biometrika 79, 763\u2013770 (1992)","journal-title":"Biometrika"},{"key":"10046_CR35","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1080\/01621459.2012.656035","volume":"107","author":"D Papp","year":"2012","unstructured":"Papp, D.: Optimal Designs for Rational Function Regression. J. Am. Stat. Assoc. 107, 400\u2013411 (2012)","journal-title":"J. Am. Stat. Assoc."},{"key":"10046_CR36","volume-title":"R: A Language and Environment for Statistical Computing","author":"R Development Core Team","year":"2020","unstructured":": , (2020)"},{"key":"10046_CR37","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1016\/j.jspi.2010.11.031","volume":"121","author":"G Sagnol","year":"2011","unstructured":"Sagnol, G.: Computing optimal designs of multiresponse experiments reduces to second-order cone programming. Journal of Statistical Planning and Inference 121, 1684\u20131708 (2011)","journal-title":"J. Stat. Plan. Inference"},{"key":"10046_CR38","doi-asserted-by":"publisher","first-page":"2198","DOI":"10.1214\/15-AOS1339","volume":"43","author":"G Sagnol","year":"2015","unstructured":"Sagnol, G., Harman, R.: Computing exact D-optimal designs by mixed integer second order cone programming. The Annals of Statistics 43, 2198\u20132224 (2015)","journal-title":"Ann. Stat."},{"key":"10046_CR39","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1080\/03610927808827719","volume":"7","author":"SD Silvey","year":"1978","unstructured":"Silvey, S.D., Titterington, D.H., Torsney, B.: An algorithm for optimal designs on a design space. Communications in Statistics-Theory and Methods 7, 1379\u20131389 (1978)","journal-title":"Commun. Stat. Theory Methods"},{"key":"10046_CR40","unstructured":"Schwabe, R.: Optimum Designs for Multi-factor Models, vol. 113. Springer, Berlin (2012)"},{"key":"10046_CR41","doi-asserted-by":"publisher","first-page":"103955","DOI":"10.1016\/j.chemolab.2020.103955","volume":"99","author":"Z Stokes","year":"2020","unstructured":"Stokes, Z., Mandal, A., Wong, W.K.: Using Differential Evolution to design optimal experiments. Chemom. Intell. Lab. Syst. 99, 103955 (2020)","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"10046_CR42","first-page":"1765","volume":"22","author":"J Stufken","year":"2012","unstructured":"Stufken, J., Yang, M.: On locally optimal designs for generalized linear models with group effects. Statistica Sinica 22, 1765\u20131786 (2012)","journal-title":"Stat. Sin."},{"key":"10046_CR43","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10898-007-9139-z","volume":"39","author":"D Uci\u0144ski","year":"2007","unstructured":"Uci\u0144ski, D., Patan, M.: D-optimal design of a monitoring network for parameter estimation of distributed systems. Journal of Global Optimization 39, 291\u2013322 (2007)","journal-title":"J. Global Optim."},{"key":"10046_CR44","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/S0895479896303430","volume":"19","author":"L Vandenberghe","year":"1998","unstructured":"Vandenberghe, L., Boyd, S., Wu, S.: Determinant maximization with linear matrix inequality constraints. SIAM J. Matrix Anal. 19, 499\u2013533 (1998)","journal-title":"SIAM J. Matrix Anal."},{"key":"10046_CR45","doi-asserted-by":"crossref","unstructured":"Xu, W., Wong, W.K., Tan, K.C., Xu, J.X.: Finding High-dimensional D-optimal designs for logistic models via differential evolution. IEEE Access 7, 7133\u20137146 (2019)","DOI":"10.1109\/ACCESS.2018.2890593"},{"key":"10046_CR46","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1080\/01621459.2013.806268","volume":"108","author":"M Yang","year":"2013","unstructured":"Yang, M., Biedermann, S., Tang, E.: On optimal designs for nonlinear models: a general and efficient algorithm. Journal of the American Statistical Association 108, 1411\u20131420 (2013)","journal-title":"J. Am. Stat. Assoc."},{"key":"10046_CR47","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s11222-010-9183-2","volume":"21","author":"Y Yu","year":"2011","unstructured":"Yu, Y.: D-optimal designs via a cocktail algorithm. Statistics and Computing 21, 475\u2013481 (2011)","journal-title":"Stat. Comput."},{"key":"10046_CR48","doi-asserted-by":"publisher","first-page":"e0124720","DOI":"10.1371\/journal.pone.0124720","volume":"10","author":"WK Wong","year":"2015","unstructured":"Wong, W.K., Chen, R.B., Huang, C.C., Wang, W.: A modified particle swarm optimization technique for finding optimal designs for mixture models. PLoS ONE 10, e0124720 (2015)","journal-title":"PLoS ONE"},{"key":"10046_CR49","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1214\/aos\/1176344374","volume":"6","author":"CF Wu","year":"1978","unstructured":"Wu, C.F.: Some algorithmic aspects of the theory of optimal designs. The Annals of Statistics 6, 1286\u20131301 (1978)","journal-title":"Ann. Stat."},{"key":"10046_CR50","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1080\/03610927808827721","volume":"7","author":"CF Wu","year":"1978","unstructured":"Wu, C.F.: Some iterative procedures for generating nonsingular optimal designs. Communications in Statistics-Theory and Methods 7, 1399\u20131412 (1978)","journal-title":"Commun. Stat.-Theory Methods"},{"key":"10046_CR51","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s12293-020-00305-6","volume":"12","author":"Z Zhang","year":"2020","unstructured":"Zhang, Z., Wong, W.K., Tan, K.C.: Competitive swarm optimizer with mutated agents for finding optimal designs for nonlinear regression models with multiple interacting factors. Memetic Computing 12, 219\u2013233 (2020)","journal-title":"Memetic Comput."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-021-10046-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-021-10046-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-021-10046-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T07:16:53Z","timestamp":1725779813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-021-10046-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,13]]},"references-count":51,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["10046"],"URL":"https:\/\/doi.org\/10.1007\/s11222-021-10046-2","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,13]]},"assertion":[{"value":"10 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors have no relevant financial or nonfinancial interests to disclose. The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"Computer codes that can be used to replicate the numerical results can be downloaded from the web page of the authors, as provided in the article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"70"}}