{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T09:43:30Z","timestamp":1770975810687,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,5,23]],"date-time":"2016-05-23T00:00:00Z","timestamp":1463961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministerio de Ciencia e Innovacion of Spain","award":["ECO2011-30198"],"award-info":[{"award-number":["ECO2011-30198"]}]},{"name":"Consejer\u00eda de Educaci\u00f3n, Comunidad Aut\u00f3noma de Madrid, Spain","award":["S2009\/ESP-1594"],"award-info":[{"award-number":["S2009\/ESP-1594"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s11222-016-9658-x","type":"journal-article","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T06:01:09Z","timestamp":1464069669000},"page":"845-863","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Exact optimal experimental designs with constraints"],"prefix":"10.1007","volume":"27","author":[{"given":"Mercedes","family":"Esteban-Bravo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agata","family":"Leszkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose M.","family":"Vidal-Sanz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,23]]},"reference":[{"issue":"1","key":"9658_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/00401706.1962.10489986","volume":"4","author":"S Addelman","year":"1962","unstructured":"Addelman, S.: Symmetrical and asymmetrical fractional factorial plans. Technometrics 4(1), 47\u201358 (1962)","journal-title":"Technometrics"},{"key":"9658_CR2","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)"},{"issue":"2","key":"9658_CR3","doi-asserted-by":"crossref","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(2), 342\u2013352 (1973)","journal-title":"Ann. Stat."},{"issue":"6","key":"9658_CR4","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1214\/aos\/1176343647","volume":"4","author":"CL Atwood","year":"1976","unstructured":"Atwood, C.L.: Convergent design sequences, for sufficiently regular optimality criteria. Ann. Stat. 4(6), 1124\u20131138 (1976)","journal-title":"Ann. Stat."},{"issue":"4","key":"9658_CR5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B Borchers","year":"1994","unstructured":"Borchers, B., Mitchell, J.E.: An improved branch and bound algorithm for mixed integer nonlinear programs. Comput. Oper. Res. 21(4), 359\u2013367 (1994)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"9658_CR6","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/S0305-0548(97)00002-6","volume":"24","author":"B Borchers","year":"1997","unstructured":"Borchers, B., Mitchell, J.E.: A computational comparison of branch and bound and outer approximation algorithms for 0\u20131 mixed integer nonlinear programs. Comput. Oper. Res. 24(8), 699\u2013701 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9658_CR7","doi-asserted-by":"crossref","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."},{"issue":"5","key":"9658_CR8","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1137\/0724076","volume":"24","author":"RH Byrd","year":"1987","unstructured":"Byrd, R.H., Schnabel, R.B., Shultz, G.A.: A trust region algorithm for nonlinearly constrained optimization. SIAM J. Numer. Anal. 24(5), 1152\u20131170 (1987)","journal-title":"SIAM J. Numer. Anal."},{"key":"9658_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/wics.1284","volume":"25","author":"RB Chen","year":"2014","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, 1\u201314 (2014)","journal-title":"Stat. Comput."},{"issue":"2","key":"9658_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/02331889508802474","volume":"26","author":"D Cook","year":"1995","unstructured":"Cook, D., Fedorov, V.: Constrained optimization of experimental design. Statistics 26(2), 129\u2013178 (1995)","journal-title":"Statistics"},{"issue":"3","key":"9658_CR11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1080\/00401706.1980.10486162","volume":"22","author":"RD Cook","year":"1980","unstructured":"Cook, R.D., Nachtsheim, C.J.: A comparison of algorithms for constructing exact D-optimal designs. Technometrics 22(3), 315\u2013324 (1980)","journal-title":"Technometrics"},{"key":"9658_CR12","first-page":"168","volume":"16","author":"JE Dennis Jr","year":"1996","unstructured":"Dennis Jr., J.E., Schnabel, R.B.: Numerical methods for unconstrained optimization and nonlinear equations. SIAM 16, 168\u2013174 (1996)","journal-title":"SIAM"},{"key":"9658_CR13","volume-title":"Theory of Optimal Experiments","author":"VV Fedorov","year":"1972","unstructured":"Fedorov, V.V.: Theory of Optimal Experiments. Academic Press, New York (1972)"},{"issue":"3","key":"9658_CR14","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1137\/S1052623499357258","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Gould, N.I.M., Leyffer, S., Toint, P.L., Wachter, A.: Global convergence of a trust-region sqp-filter algorithm for general nonlinear programming. SIAM J. Optim. 13(3), 635 (2002)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9658_CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91(2), 239 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"9658_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10287-008-0090-3","volume":"6","author":"J Gondzio","year":"2009","unstructured":"Gondzio, J., Grothey, A.: Exploiting structure in parallel implementation of interior point methods for optimization. Comput. Manag. Sci. 6(2), 135\u2013160 (2009)","journal-title":"Comput. Manag. Sci."},{"key":"9658_CR17","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1016\/j.csda.2013.02.021","volume":"71","author":"R Harman","year":"2014","unstructured":"Harman, R., Filov\u00e1, L.: Computing efficient exact designs of experiments using integer quadratic programming. Comput. Stat. Data Anal. 71, 1159\u20131167 (2014)","journal-title":"Comput. Stat. Data Anal."},{"issue":"3","key":"9658_CR18","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s101070050107","volume":"86","author":"M Heinkenschloss","year":"1999","unstructured":"Heinkenschloss, M., Ulbrich, M., Ulbrich, S.: Superlinear and quadratic convergence of affine-scaling interior-point newton methods for problems with simple bounds without strict complementarity assumption. Math. Program. 86(3), 615\u2013635 (1999)","journal-title":"Math. Program."},{"issue":"3","key":"9658_CR19","first-page":"271","volume":"25","author":"ME Johnson","year":"1983","unstructured":"Johnson, M.E., Nachtsheim, C.J.: Some guidelines for constructing exact D-optimal designs on convex design spaces. Technometrics 25(3), 271\u2013277 (1983)","journal-title":"Technometrics"},{"issue":"4","key":"9658_CR20","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1214\/aoms\/1177699361","volume":"37","author":"S Karlin","year":"1966","unstructured":"Karlin, S., Studden, W.J.: Optimal experimental designs. Ann. Math. Stat. 37(4), 783\u2013815 (1966)","journal-title":"Ann. Math. Stat."},{"issue":"2","key":"9658_CR21","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. R. Stat. Soc. Ser. B Stat. Methodol. 21(2), 272\u2013319 (1959)","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"issue":"2","key":"9658_CR22","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1214\/aoms\/1177706252","volume":"30","author":"J Kiefer","year":"1959","unstructured":"Kiefer, J., Wolfowitz, J.: Optimum designs in regression problems. Ann. Math. Stat. 30(2), 271\u2013294 (1959)","journal-title":"Ann. Math. Stat."},{"key":"9658_CR23","doi-asserted-by":"crossref","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 problems. Can. J. Math. 12, 363\u2013366 (1960)","journal-title":"Can. J. Math."},{"issue":"4","key":"9658_CR24","doi-asserted-by":"crossref","first-page":"545","DOI":"10.2307\/3151882","volume":"31","author":"WF Kuhfeld","year":"1994","unstructured":"Kuhfeld, W.F., Tobias, R.D., Garratt, M.: Efficient experimental design with marketing research applications. J. Mark. Res. 31(4), 545\u2013557 (1994)","journal-title":"J. Mark. Res."},{"issue":"2","key":"9658_CR25","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/qre.1591","volume":"31","author":"CD Lin","year":"2015","unstructured":"Lin, C.D., Anderson-Cook, C.M., Hamada, M.S., Moore, L.M., Sitter, R.R.: Using genetic algorithms to design experiments: a review. Qual. Reliab. Eng. Int. 31(2), 155\u2013167 (2015)","journal-title":"Qual. Reliab. Eng. Int."},{"key":"9658_CR26","volume-title":"Matrix Differential Calculus with Applications in Statistics and Econometrics","author":"JR Magnus","year":"1999","unstructured":"Magnus, J.R., Neudecker, H.: Matrix Differential Calculus with Applications in Statistics and Econometrics. Wiley, New York (1999)"},{"key":"9658_CR27","volume-title":"Handbook of Design and Analysis of Experiments","author":"A Mandal","year":"2015","unstructured":"Mandal, A., Wong, W.K., Yu, Y.: Algorithmic searches for optimal designs. In: Dean, A., Morris, M., Stufken, J., Bingham, D. (eds.) Handbook of Design and Analysis of Experiments. Chapman and Hall\/CRC, Boca Raton (2015)"},{"issue":"2","key":"9658_CR28","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1198\/004017005000000526","volume":"48","author":"A Mandal","year":"2006","unstructured":"Mandal, A., Wu, C.J., Johnson, K.: Selc: sequential elimination of level combinations by means of modified genetic algorithms. Technometrics 48(2), 273\u2013283 (2006)","journal-title":"Technometrics"},{"issue":"2","key":"9658_CR29","first-page":"203","volume":"16","author":"TJ Mitchell","year":"1974","unstructured":"Mitchell, T.J.: An algorithm for the construction of \u201cD-optimal\u201d experimental designs. Technometrics 16(2), 203\u2013210 (1974)","journal-title":"Technometrics"},{"issue":"4","key":"9658_CR30","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/0167-9473(92)90064-M","volume":"14","author":"NK Nguyen","year":"1992","unstructured":"Nguyen, N.K., Miller, A.J.: A review of some exchange algorithms for constructing discrete d-optimal designs. Comput. Stat. Data Anal. 14(4), 489\u2013498 (1992)","journal-title":"Comput. Stat. Data Anal."},{"key":"9658_CR31","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (2006)"},{"issue":"5","key":"9658_CR32","doi-asserted-by":"crossref","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":"1","key":"9658_CR33","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1080\/00401706.1975.10489266","volume":"17","author":"RC St.\u00a0John","year":"1975","unstructured":"St.\u00a0John, R.C., Draper, N.R.: D-optimality for regression designs: a review. Technometrics 17(1), 15\u201323 (1975)","journal-title":"Technometrics"},{"issue":"5","key":"9658_CR34","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.1214\/aoms\/1177693160","volume":"42","author":"WJ Studden","year":"1971","unstructured":"Studden, W.J.: Elfving\u2019s theorem and optimal designs for quadratic loss. Ann. Math. Stat. 42(5), 1613\u20131621 (1971)","journal-title":"Ann. Math. Stat."},{"key":"9658_CR35","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-1-4757-3226-9_24","volume-title":"Nonlinear Optimization and Related Topics","author":"P Tseng","year":"2000","unstructured":"Tseng, P.: Error bounds and superlinear convergence analysis of some newton-type methods in optimization. In: Pillo, G., Giannessi, F. (eds.) Nonlinear Optimization and Related Topics, pp. 445\u2013462. Springer, New York (2000)"},{"issue":"2","key":"9658_CR36","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s10107-003-0477-4","volume":"100","author":"M Ulbrich","year":"2004","unstructured":"Ulbrich, M., Ulbrich, S., Vicente, L.N.: A globally convergent primal-dual interior-point filter method for nonlinear programming. Math. Program. 100(2), 379\u2013410 (2004)","journal-title":"Math. Program."},{"issue":"3","key":"9658_CR37","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/A:1019798502851","volume":"22","author":"LN Vicente","year":"2002","unstructured":"Vicente, L.N., Wright, S.J.: Local convergence of a primal-dual method for degenerate nonlinear programming. Comput. Optim. Appl. 22(3), 311\u2013328 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"9658_CR38","unstructured":"Whittle, P.: Some general points in the theory of optimal experimental design. J. R. Stat. Soc. Ser. B Stat. Methodol. 35(1), 123\u2013130 (1973)"},{"issue":"1","key":"9658_CR39","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/00949650802445367","volume":"80","author":"D Woods","year":"2010","unstructured":"Woods, D.: 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":"3","key":"9658_CR40","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1287\/moor.27.3.585.312","volume":"27","author":"SJ Wright","year":"2002","unstructured":"Wright, S.J., Orban, D.: Properties of the log-barrier function on degenerate nonlinear programs. Math. Oper. Res. 27(3), 585\u2013613 (2002)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"9658_CR41","doi-asserted-by":"crossref","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."},{"issue":"2","key":"9658_CR42","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1214\/aos\/1176346496","volume":"12","author":"HP Wynn","year":"1984","unstructured":"Wynn, H.P.: Jack Kiefer\u2019s contributions to experimental design. Ann. Stat. 12(2), 416\u2013423 (1984)","journal-title":"Ann. Stat."},{"issue":"4","key":"9658_CR43","doi-asserted-by":"crossref","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. Stat. Comput. 21(4), 475\u2013481 (2011)","journal-title":"Stat. Comput."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-016-9658-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-016-9658-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-016-9658-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-016-9658-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T02:18:51Z","timestamp":1718590731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-016-9658-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,23]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["9658"],"URL":"https:\/\/doi.org\/10.1007\/s11222-016-9658-x","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,23]]}}}