{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:28:45Z","timestamp":1759332525772,"version":"3.41.0"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000057","name":"National Institute of General Medical Sciences","doi-asserted-by":"publisher","award":["R01GM107639"],"award-info":[{"award-number":["R01GM107639"]}],"id":[{"id":"10.13039\/100000057","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["SFB 823","Teilprojekt C2"],"award-info":[{"award-number":["SFB 823","Teilprojekt C2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s11222-017-9741-y","type":"journal-article","created":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T22:44:49Z","timestamp":1490309089000},"page":"441-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Adaptive grid semidefinite programming for finding optimal designs"],"prefix":"10.1007","volume":"28","author":[{"given":"Belmiro P. M.","family":"Duarte","sequence":"first","affiliation":[]},{"given":"Weng Kee","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Holger","family":"Dette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,23]]},"reference":[{"key":"9741_CR1","unstructured":"Andersen, E., Jensen, B., Jensen, J., Sandvik, R., Wors\u00f8e, U.: Mosek version 6. Tech. rep., Technical Report TR-2009-3, MOSEK (2009)"},{"key":"9741_CR2","volume-title":"Mathematical Programming in Statistics","author":"TS Arthanari","year":"1993","unstructured":"Arthanari, T.S., Dodge, Y.: Mathematical Programming in Statistics. A Wiley-Interscience publication. Wiley, Hoboken (1993)"},{"issue":"3","key":"9741_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/biomet\/76.3.515","volume":"76","author":"AC Atkinson","year":"1989","unstructured":"Atkinson, A.C., Donev, A.N.: The construction of exact $$D$$-optimum experimental designs with application to blocking response surface designs. Biometrika 76(3), 515\u2013526 (1989)","journal-title":"Biometrika"},{"key":"9741_CR4","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":"9741_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.S.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Society for Industrial and Applied Mathematics, Philadelphia (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"9741_CR6","doi-asserted-by":"crossref","unstructured":"Berger, M.J.: Adaptive mesh refinement for hyperbolic partial differential equations. Ph.D. Dissertation, Department of Computer Science, Stanford University, Stanford, CA, USA (1982)","DOI":"10.21236\/ADA130162"},{"key":"9741_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/9780470746912","volume-title":"An Introduction to Optimal Designs for Social and Biomedical Research","author":"MPF Berger","year":"2009","unstructured":"Berger, M.P.F., Wong, W.K.: An Introduction to Optimal Designs for Social and Biomedical Research. Wiley, Chichester (2009)"},{"key":"9741_CR8","doi-asserted-by":"crossref","unstructured":"Bischof, C.H., B\u00fccker, H.M., Lang, B., Rasch, A., Vehreschild, A.: Combining source transformation and operator overloading techniques to compute derivatives for Matlab programs. In: Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2002), pp. 65\u201372. IEEE Computer Society, Los Alamitos, CA, USA (2002)","DOI":"10.1109\/SCAM.2002.1134106"},{"issue":"1","key":"9741_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/00401706.1965.10490223","volume":"7","author":"GEP Box","year":"1965","unstructured":"Box, G.E.P., Hunter, W.G.: The experimental study of physical mechanisms. Technometrics 7(1), 23\u201342 (1965)","journal-title":"Technometrics"},{"key":"9741_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. University Press, Cambridge (2004)"},{"issue":"4","key":"9741_CR11","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/S1052623497325107","volume":"9","author":"RH Byrd","year":"1999","unstructured":"Byrd, R.H., Hribar, M.E., Nocedal, J.: An interior point algorithm for large-scale nonlinear programming. SIAM J. Optim. 9(4), 877\u2013900 (1999)","journal-title":"SIAM J. Optim."},{"key":"9741_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0378-3758(89)90004-9","volume":"59","author":"K Chaloner","year":"1989","unstructured":"Chaloner, K., Larntz, K.: Optimal Bayesian design applied to logistic regression experiments. J. Stat. Plan. Inference 59, 191\u2013208 (1989)","journal-title":"J. Stat. Plan. Inference"},{"issue":"5","key":"9741_CR13","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. Stat. Comput. 25(5), 975\u2013988 (2015)","journal-title":"Stat. Comput."},{"issue":"340","key":"9741_CR14","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1080\/01621459.1972.10481287","volume":"67","author":"A Coale","year":"1972","unstructured":"Coale, A., McNeil, D.: The distribution by age of the frequency of first marriage in a female cohort. J. Am. Stat. Assoc. 67(340), 743\u2013749 (1972)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"9741_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01582221","volume":"67","author":"TF Coleman","year":"1994","unstructured":"Coleman, T.F., Li, Y.: On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds. Math. Program. 67(2), 189\u2013224 (1994)","journal-title":"Math. Program."},{"issue":"3","key":"9741_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1080\/00401706.1980.10486162","volume":"22","author":"R Cook","year":"1980","unstructured":"Cook, R., Nachtsheim, C.: Comparison of algorithms for constructing $$D$$-optimal design. Technometrics 22(3), 315\u2013324 (1980)","journal-title":"Technometrics"},{"issue":"4","key":"9741_CR17","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1214\/14-AOS1241","volume":"42","author":"H Dette","year":"2014","unstructured":"Dette, H., Grigoriev, Y.: E-optimal designs for second-order response surface models. Ann. Stat. 42(4), 1635\u20131656 (2014)","journal-title":"Ann. Stat."},{"issue":"2","key":"9741_CR18","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.csda.2008.10.002","volume":"53","author":"H Dette","year":"2008","unstructured":"Dette, H., Pepelyshev, A., Zhigljavsky, A.A.: Improving updating rules in multiplicative algorithms for computing $$D$$-optimal designs. Comput. Stat. Data Anal. 53(2), 312\u2013320 (2008)","journal-title":"Comput. Stat. Data Anal."},{"issue":"1","key":"9741_CR19","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176349034","volume":"21","author":"H Dette","year":"1993","unstructured":"Dette, H., Studden, W.J.: Geometry of $$E$$-optimality. Ann. Stat. 21(1), 416\u2013433 (1993)","journal-title":"Ann. Stat."},{"key":"9741_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF02591747","volume":"31","author":"A Drud","year":"1985","unstructured":"Drud, A.: CONOPT: a GRG code for large sparse dynamic nonlinear optimization problems. Math. Program. 31, 153\u2013191 (1985)","journal-title":"Math. Program."},{"issue":"2","key":"9741_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/ijoc.6.2.207","volume":"6","author":"A Drud","year":"1994","unstructured":"Drud, A.: CONOPT\u2014a large-scale GRG code. ORSA J. Comput. 6(2), 207\u2013216 (1994)","journal-title":"ORSA J. Comput."},{"issue":"6","key":"9741_CR22","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. Stat. Comput. 24(6), 1063\u20131080 (2014)","journal-title":"Stat. Comput."},{"issue":"2","key":"9741_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1111\/insr.12073","volume":"83","author":"BPM Duarte","year":"2015","unstructured":"Duarte, B.P.M., Wong, W.K.: Finding Bayesian optimal designs for nonlinear models: a semidefinite programming-based approach. Int. Stat. Rev. 83(2), 239\u2013262 (2015)","journal-title":"Int. Stat. Rev."},{"key":"9741_CR24","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.jmva.2014.11.006","volume":"135","author":"BP Duarte","year":"2015","unstructured":"Duarte, B.P., Wong, W.K., Atkinson, A.C.: A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination. J. Multivar. Anal. 135, 11\u201324 (2015)","journal-title":"J. Multivar. Anal."},{"key":"9741_CR25","volume-title":"Theory of Optimal Experiments","author":"VV Fedorov","year":"1972","unstructured":"Fedorov, V.V.: Theory of Optimal Experiments. Academic Press, Cambridge (1972)"},{"key":"9741_CR26","volume-title":"Optimal Design for Nonlinear Response Models","author":"VV Fedorov","year":"2014","unstructured":"Fedorov, V.V., Leonov, S.L.: Optimal Design for Nonlinear Response Models. Chapman and Hall\/CRC Press, Boca Raton (2014)"},{"key":"9741_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0378-3758(89)90021-9","volume":"21","author":"J Fellman","year":"1989","unstructured":"Fellman, J.: An empirical study of a class of iterative searches for optimal designs. J. Stat. Plan. Inference 21, 85\u201392 (1989)","journal-title":"J. Stat. Plan. Inference"},{"issue":"1","key":"9741_CR28","first-page":"109","volume":"64","author":"L Filov\u00e1","year":"2011","unstructured":"Filov\u00e1, L., Trnovsk\u00e1, M., Harman, R.: Computing maximin efficient experimental designs using the methods of semidefinite programming. Metrika 64(1), 109\u2013119 (2011)","journal-title":"Metrika"},{"key":"9741_CR29","doi-asserted-by":"crossref","unstructured":"Gaivoronski, A.: Linearization methods for optimization of functionals which depend on probability measures. In: Pr\u00e9kopa, A., Wets, R.J.B. (eds.) Stochastic Programming 84 Part II, Mathematical Programming Studies, vol. 28, pp. 157\u2013181. Springer, Berlin Heidelberg (1986)","DOI":"10.1007\/BFb0121130"},{"issue":"1","key":"9741_CR30","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"key":"9741_CR31","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":"9741_CR32","unstructured":"Grant, M., Boyd, S., Ye, Y.: cvx Users guide for cvx version 1.22. CVX Research, Inc., 1104 Claire Ave., Austin, TX 78703-2502 (2012)"},{"issue":"2","key":"9741_CR33","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. Comput. Stat. Data Anal. 53(2), 247\u2013254 (2008)","journal-title":"Comput. Stat. Data Anal."},{"key":"9741_CR34","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 non-optimal support points in $$D$$-optimum design algorithms. Stat. Probab. Lett. 77, 90\u201394 (2007)","journal-title":"Stat. Probab. Lett."},{"key":"9741_CR35","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1080\/00224065.2004.11980273","volume":"36","author":"A Heredia-Langner","year":"2004","unstructured":"Heredia-Langner, A., Montgomery, D.C., Carlyle, W.M., Borror, C.M.: Model-robust optimal designs: a genetic algorithm approach. J. Qual. Technol. 36, 263\u2013279 (2004)","journal-title":"J. Qual. Technol."},{"issue":"Suppl","key":"9741_CR36","first-page":"4","volume":"40","author":"A Hill","year":"1910","unstructured":"Hill, A.: The possible effects of the aggregation of the molecules of haemoglobin on its dissociation curves. J Physiol 40(Suppl), 4\u20137 (1910)","journal-title":"J Physiol"},{"key":"9741_CR37","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1111\/j.2517-6161.1959.tb00338.x","volume":"21","author":"JC Kiefer","year":"1959","unstructured":"Kiefer, J.C.: Optimum experimental designs. J. R. Stat. Soc. Ser. B 21, 272\u2013319 (1959)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"9741_CR38","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1214\/aos\/1176342810","volume":"2","author":"J Kiefer","year":"1974","unstructured":"Kiefer, J.: General equivalence theory for optimum design (approximate theory). Ann. Stat. 2, 849\u2013879 (1974)","journal-title":"Ann. Stat."},{"key":"9741_CR39","doi-asserted-by":"publisher","first-page":"363","DOI":"10.4153\/CJM-1960-030-4","volume":"12","author":"J Kiefer","year":"1960","unstructured":"Kiefer, J., Wolfowitz, J.: The equivalence of two extremum problem. Can. J. Math. 12, 363\u2013366 (1960)","journal-title":"Can. J. Math."},{"issue":"12","key":"9741_CR40","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1016\/j.jspi.2008.01.014","volume":"138","author":"J L\u00f3pez-Fidalgo","year":"2008","unstructured":"L\u00f3pez-Fidalgo, J., Tommasi, C., Trandafir, P.C.: Optimal designs for discriminating between some extensions of the Michaelis\u2013Menten model. J. Stat. Plan. Inference 138(12), 3797\u20133804 (2008)","journal-title":"J. Stat. Plan. Inference"},{"key":"9741_CR41","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1016\/j.jspi.2004.08.005","volume":"136","author":"S Mandal","year":"2006","unstructured":"Mandal, S., Torsney, B.: Construction of optimal designs using a clustering approach. J. Stat. Plan. Inference 136, 1120\u20131134 (2006)","journal-title":"J. Stat. Plan. Inference"},{"key":"9741_CR42","first-page":"755","volume-title":"Handbook of Design and Analysis of Experiments, chap 21","author":"A Mandal","year":"2015","unstructured":"Mandal, A., Wong, W.K., Yu, Y.: Algorithmic searches for optimal designs. Handbook of Design and Analysis of Experiments, chap 21, pp. 755\u2013786. CRC Press, New York (2015)"},{"key":"9741_CR43","doi-asserted-by":"publisher","unstructured":"Masoudi, E., Holling, H., Wong, W.K.: Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs. Comput. Stat. Data Anal. (in press). doi: 10.1016\/j.csda.2016.06.014","DOI":"10.1016\/j.csda.2016.06.014"},{"key":"9741_CR44","unstructured":"Melas, V.: Functional Approach to Optimal Experimental Design, Lecture Notes in Statistics. Springer (2006)"},{"key":"9741_CR45","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":"9741_CR46","first-page":"203","volume":"16","author":"TJ Mitchell","year":"1974","unstructured":"Mitchell, T.J.: An algorithm for the construction of $$D$$-optimal experimental designs. Technometrics 16, 203\u2013210 (1974)","journal-title":"Technometrics"},{"key":"9741_CR47","unstructured":"Mitchell, T.J., Miller Jr., F.L.: Use of design repair to construct designs for special linear models. Technical report, Oak Ridge National Laboratory, 130\u2013131 (1970)"},{"key":"9741_CR48","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/A:1014878317736","volume":"12","author":"I Molchanov","year":"2002","unstructured":"Molchanov, I., Zuyev, S.: Steepest descent algorithm in a space of measures. Stat. Comput. 12, 115\u2013123 (2002)","journal-title":"Stat. Comput."},{"key":"9741_CR49","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":"9741_CR50","volume-title":"Foundations of Optimum Experimental Design (Mathematics and its Applications)","author":"A P\u00e1zman","year":"1986","unstructured":"P\u00e1zman, A.: Foundations of Optimum Experimental Design (Mathematics and its Applications). Springer, Netherlands (1986)"},{"issue":"2","key":"9741_CR51","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/0021-9991(87)90093-3","volume":"72","author":"J Peraire","year":"1987","unstructured":"Peraire, J., Vahdati, M., Morgan, K., Zienkiewicz, O.: Adaptive remeshing for compressible flow computations. J. Comput. Phys. 72(2), 449\u2013466 (1987)","journal-title":"J. Comput. Phys."},{"issue":"3","key":"9741_CR52","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0167-7152(03)00081-6","volume":"63","author":"L Pronzato","year":"2003","unstructured":"Pronzato, L.: Removing non-optimal support points in $$D$$-optimum design algorithms. Stat. Probab. Lett. 63(3), 223\u2013228 (2003)","journal-title":"Stat. Probab. Lett."},{"key":"9741_CR53","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.automatica.2007.05.016","volume":"44","author":"L Pronzato","year":"2008","unstructured":"Pronzato, L.: Optimal experimental design and some related control problems. Automatica 44, 303\u2013325 (2008)","journal-title":"Automatica"},{"key":"9741_CR54","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":"9741_CR55","volume-title":"Optimal Design of Experiments","author":"F Pukelsheim","year":"1993","unstructured":"Pukelsheim, F.: Optimal Design of Experiments. SIAM, Philadelphia (1993)"},{"issue":"3","key":"9741_CR56","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1214\/aos\/1176348265","volume":"19","author":"F Pukelsheim","year":"1991","unstructured":"Pukelsheim, F., Torsney, B.: Optimal weights for experimental designs on linearly independent support points. Ann. Stat. 19(3), 1614\u20131625 (1991)","journal-title":"Ann. Stat."},{"key":"9741_CR57","doi-asserted-by":"publisher","first-page":"3117","DOI":"10.1016\/j.jspi.2011.03.033","volume":"141","author":"H Qi","year":"2011","unstructured":"Qi, H.: A semidefinite programming study of the Elfving theorem. J. Stat. Plan. Inference 141, 3117\u20133130 (2011)","journal-title":"J. Stat. Plan. Inference"},{"key":"9741_CR58","doi-asserted-by":"crossref","unstructured":"Ruszczy\u0144ski, A.P.: Nonlinear optimization, No. vol. 13. In: Nonlinear Optimization. Princeton University Press, Princeton (2006)","DOI":"10.1515\/9781400841059"},{"issue":"5","key":"9741_CR59","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1016\/j.jspi.2010.11.031","volume":"141","author":"G Sagnol","year":"2011","unstructured":"Sagnol, G.: Computing optimal designs of multiresponse experiments reduces to second-order cone programming. J. Stat. Plan. Inference 141(5), 1684\u20131708 (2011)","journal-title":"J. Stat. Plan. Inference"},{"issue":"10","key":"9741_CR60","doi-asserted-by":"publisher","first-page":"2829","DOI":"10.1016\/j.laa.2013.08.021","volume":"439","author":"G Sagnol","year":"2013","unstructured":"Sagnol, G.: On the semidefinite representation of real functions applied to symmetric matrices. Linear Algebra Appl. 439(10), 2829\u20132843 (2013)","journal-title":"Linear Algebra Appl."},{"key":"9741_CR61","doi-asserted-by":"crossref","unstructured":"Sagnol, G., Harman, R.: Computing exact $$D$$-optimal designs by mixed integer second order cone programming. Ann. Stat. 43(5), 2198\u20132224 (2015)","DOI":"10.1214\/15-AOS1339"},{"key":"9741_CR62","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-5912-5","volume-title":"Optimal Design","author":"SD Silvey","year":"1980","unstructured":"Silvey, S.D.: Optimal Design. Chapman and Hall, London (1980)"},{"key":"9741_CR63","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J Sturm","year":"1999","unstructured":"Sturm, J.: Using SeDuMi 1.02, a Matlab toolbox for optimization oversymmetric cones. Optim Methods Softw. 11, 625\u2013653 (1999)","journal-title":"Optim Methods Softw."},{"key":"9741_CR64","unstructured":"Titterington, D.M.: Algorithms for computing $$D$$-optimal design on finite design spaces. In: Proceedings of the 1976 Conference on Information Science and Systems, 3, John Hopkins University, 213\u2013216 (1976)"},{"issue":"3","key":"9741_CR65","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1016\/j.csda.2006.05.014","volume":"51","author":"B Torsney","year":"2006","unstructured":"Torsney, B., Mandal, S.: Two classes of multiplicative algorithms for constructing optimizing distributions. Comput. Stat. Data Anal. 51(3), 1591\u20131601 (2006)","journal-title":"Comput. Stat. Data Anal."},{"issue":"12","key":"9741_CR66","doi-asserted-by":"publisher","first-page":"3947","DOI":"10.1016\/j.jspi.2009.05.007","volume":"139","author":"B Torsney","year":"2009","unstructured":"Torsney, B., Mart\u00edn-Mart\u00edn, R.: Multiplicative algorithms for computing optimum designs. J. Stat. Plan. Inference 139(12), 3947\u20133961 (2009)","journal-title":"J. Stat. Plan. Inference"},{"key":"9741_CR67","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"8","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 8, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"9741_CR68","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0168-9274(98)00098-1","volume":"29","author":"L Vandenberghe","year":"1999","unstructured":"Vandenberghe, L., Boyd, S.: Applications of semidefinite programming. Appl. Numer. Math. 29, 283\u2013299 (1999)","journal-title":"Appl. Numer. Math."},{"issue":"1","key":"9741_CR69","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2005","unstructured":"W\u00e4chter, A., Biegler, T.L.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"9741_CR70","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1080\/00949658208810560","volume":"15","author":"WJ Welch","year":"1982","unstructured":"Welch, W.J.: Algorithmic complexity: three NP-hard problems in computational statistics. J. Stat. Comput. Simul. 15(1), 17\u201325 (1982)","journal-title":"J. Stat. Comput. Simul."},{"key":"9741_CR71","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1111\/j.2517-6161.1973.tb00944.x","volume":"35","author":"P Whittle","year":"1973","unstructured":"Whittle, P.: Some general points in the theory of optimal experimental design. J. R. Stat. Soc. Ser. B 35, 123\u2013130 (1973)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"1","key":"9741_CR72","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/00949650802445367","volume":"80","author":"DC Woods","year":"2010","unstructured":"Woods, D.C.: Robust designs for binary data: applications of simulated annealing. J. Stat. Comput. Simul. 80(1), 29\u201341 (2010)","journal-title":"J. Stat. Comput. Simul."},{"issue":"6","key":"9741_CR73","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. Ann. Stat. 6(6), 1286\u20131301 (1978)","journal-title":"Ann. Stat."},{"issue":"6","key":"9741_CR74","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1214\/aos\/1176344373","volume":"6","author":"CF Wu","year":"1978","unstructured":"Wu, C.F., Wynn, H.P.: The convergence of general step-length algorithms for regular optimum design criteria. Ann. Stat. 6(6), 1273\u20131285 (1978)","journal-title":"Ann. Stat."},{"issue":"5","key":"9741_CR75","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1214\/aoms\/1177696809","volume":"41","author":"HP Wynn","year":"1970","unstructured":"Wynn, H.P.: The sequential generation of $$D$$-optimum experimental designs. Ann. Math. Stat. 41(5), 1655\u20131664 (1970)","journal-title":"Ann. Math. Stat."},{"key":"9741_CR76","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1111\/j.2517-6161.1972.tb00896.x","volume":"34","author":"HP Wynn","year":"1972","unstructured":"Wynn, H.P.: Results in the theory and construction of $$D$$-optimum experimental designs. J. R. Stat. Soc. Ser. B 34, 133\u2013147 (1972)","journal-title":"J. R. Stat. Soc. Ser. B"},{"issue":"504","key":"9741_CR77","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. J. Am. Stat. Assoc. 108(504), 1411\u20131420 (2013)","journal-title":"J. Am. Stat. Assoc."},{"issue":"4","key":"9741_CR78","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s11222-010-9183-2","volume":"21","author":"Y Yu","year":"2010","unstructured":"Yu, Y.: $$D-$$optimal designs via a cocktail algorithm. Stat. Comput. 21(4), 475\u2013481 (2010a)","journal-title":"Stat. Comput."},{"issue":"3","key":"9741_CR79","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1214\/09-AOS761","volume":"38","author":"Y Yu","year":"2010","unstructured":"Yu, Y.: Monotonic convergence of a general algorithm for computing optimal designs. Ann. Stat. 38(3), 1593\u20131606 (2010b)","journal-title":"Ann. Stat."},{"key":"9741_CR80","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.csda.2010.01.026","volume":"54","author":"Y Yu","year":"2010","unstructured":"Yu, Y.: Strict monotonicity and convergence rate of Titterington\u2019s algorithm for computing $$D$$-optimal designs. Comput. Stat. Data. Anal. 54, 1419\u20131425 (2010c)","journal-title":"Comput. Stat. Data. Anal."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-017-9741-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-017-9741-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-017-9741-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:39:20Z","timestamp":1750178360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-017-9741-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,23]]},"references-count":80,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["9741"],"URL":"https:\/\/doi.org\/10.1007\/s11222-017-9741-y","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2017,3,23]]},"assertion":[{"value":"30 July 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}