{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,26]],"date-time":"2024-05-26T10:10:02Z","timestamp":1716718202160},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,5,4]],"date-time":"2014-05-04T00:00:00Z","timestamp":1399161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s11222-014-9476-y","type":"journal-article","created":{"date-parts":[[2014,5,3]],"date-time":"2014-05-03T19:49:47Z","timestamp":1399146587000},"page":"1113-1127","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach"],"prefix":"10.1007","volume":"25","author":[{"given":"Selin Damla","family":"Ahipa\u015fao\u011flu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,4]]},"reference":[{"key":"9476_CR1","unstructured":"Ahipa\u015fao\u011flu, S. D.: Solving ellipsoidal inclusion and optimal experimental design problems: Theory and algorithms, Ph.D. thesis, Cornell University, August (2009)"},{"key":"9476_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1080\/10556780701589669","volume":"23","author":"SD Ahipa\u015fao\u011flu","year":"2008","unstructured":"Ahipa\u015fao\u011flu, S.D., Sun, P., Todd, M.J.: Linear convergence of a modified Frank\u2013Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optim. Methods Softw. 23, 5\u201319 (2008)","journal-title":"Optim. Methods Softw."},{"key":"9476_CR3","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1137\/080727208","volume":"19","author":"SD Ahipa\u015fao\u011flu","year":"2008","unstructured":"Ahipa\u015fao\u011flu, S.D., Y\u0131ld\u0131r\u0131m, E.A.: Identification and elimination of interior points for the minimum enclosing ball problem. SIAM J. Optim. 19, 1392\u20131396 (2008)","journal-title":"SIAM J. Optim."},{"key":"9476_CR4","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/j.comgeo.2011.11.004","volume":"46","author":"SD Ahipa\u015fao\u011flu","year":"2013","unstructured":"Ahipa\u015fao\u011flu, S.D., Todd, M.J.: Modified Frank\u2013Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: theory and algorithms. Comput. Geom. 46, 494\u2013519 (2013)","journal-title":"Comput. Geom."},{"issue":"2","key":"9476_CR5","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."},{"key":"9476_CR6","doi-asserted-by":"crossref","first-page":"3947","DOI":"10.1016\/j.jspi.2009.05.007","volume":"139","author":"B Torsney","year":"2009","unstructured":"Torsney, B., Martin-Martin, R.R.: Multiplicative algorithms for computing optimum designs. J. Stat. Plan. Inference 139, 3947\u20133961 (2009)","journal-title":"J. Stat. Plan. Inference"},{"issue":"474","key":"9476_CR7","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1198\/016214505000001087","volume":"101","author":"S Biedermann","year":"2006","unstructured":"Biedermann, S., Dette, H., Zhu, W.: Optimal designs for dose-response models with restricted design spaces. J. Am. Stat. Assoc. 101(474), 747\u2013759 (2006)","journal-title":"J. Am. Stat. Assoc."},{"key":"9476_CR8","first-page":"27","volume":"44","author":"J Fellman","year":"1974","unstructured":"Fellman, J.: On the allocation of linear observations. Comment. Phys. Math. 44, 27\u201378 (1974)","journal-title":"Comment. Phys. Math."},{"key":"9476_CR9","volume-title":"Theory of Optimal Experiments","author":"VV Fedorov","year":"1972","unstructured":"Fedorov, V.V.: Theory of Optimal Experiments. Academic Press, New York (1972)"},{"key":"9476_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"9476_CR11","doi-asserted-by":"crossref","first-page":"1613","DOI":"10.1080\/03610929308831106","volume":"22","author":"LM Haines","year":"1993","unstructured":"Haines, L.M.: Optimal designs for nonlinear regression models. Commun. Stat., Part A - Theory Methods 22, 1613\u20131627 (1993)","journal-title":"Commun. Stat., Part A - Theory Methods"},{"key":"9476_CR12","doi-asserted-by":"crossref","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":"9476_CR13","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1287\/moor.21.2.307","volume":"21","author":"LG Khachiyan","year":"1996","unstructured":"Khachiyan, L.G.: Rounding of polytopes in the real number model of computation. Math. Oper. Res. 21, 307\u2013320 (1996)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"9476_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-005-2653-6","volume":"126","author":"P Kumar","year":"2005","unstructured":"Kumar, P., Y\u0131ld\u0131r\u0131m, E.A.: Minimum volume enclosing ellipsoids and core sets. J. Optim. Theory Appl. 126(1), 1\u201321 (2005)","journal-title":"J. Optim. Theory Appl."},{"key":"9476_CR15","unstructured":"P\u00e1zman, A.: Foundations of Optimum Experimental Design. Reidel, Dordrecht (1986)"},{"key":"9476_CR16","doi-asserted-by":"crossref","unstructured":"Pronzato, L.: A delimitation of the support of optimal designs for Kiefer\u2019s $$\\phi _p$$ \u03d5 p -class of criteria. Stat. Probab. Lett. 83(12), 2721\u20132728 (2013)","DOI":"10.1016\/j.spl.2013.09.009"},{"key":"9476_CR17","volume-title":"Optimal Design of Experiments","author":"F Pukelsheim","year":"1993","unstructured":"Pukelsheim, F.: Optimal Design of Experiments. Wiley, New York (1993)"},{"key":"9476_CR18","doi-asserted-by":"crossref","unstructured":"Pukelsheim, F.: Optimal Design of Experiments. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2006)","DOI":"10.1137\/1.9780898719109"},{"key":"9476_CR19","doi-asserted-by":"crossref","unstructured":"Robinson, S.M.: Generalized equations and their solutions, part II: applications to nonlinear programming. Math. Prog. Study 19, 200\u2013221 (1982)","DOI":"10.1007\/BFb0120989"},{"key":"9476_CR20","unstructured":"Silvey, S.D.: Contribution to discussion of papers by H. P. Wynn and P. J. Laycock. J. R. Stat. Soc. Ser. B 34, 181\u2013183 (1972)"},{"key":"9476_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1093\/biomet\/60.1.21","volume":"60","author":"SD Silvey","year":"1973","unstructured":"Silvey, S.D., Titterington, D.M.: A geometric approach to optimum design theory. Biometrika 60, 21\u201332 (1973)","journal-title":"Biometrika"},{"key":"9476_CR22","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1287\/opre.1040.0115","volume":"52","author":"P Sun","year":"2004","unstructured":"Sun, P., Freund, R.M.: Computation of minimum volume covering ellipsoids. Oper. Res. 52, 690\u2013706 (2004)","journal-title":"Oper. Res."},{"key":"9476_CR23","unstructured":"Titterington, D. M.: Algorithms for computing D-optimal designs on a finite design space, In: Conference on Information Sciences and Systems, Department of Electrical Engineering, Johns Hopkins University of Baltimore, pp. 213\u2013216 (1976)"},{"key":"9476_CR24","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1016\/j.dam.2007.02.013","volume":"155","author":"MJ Todd","year":"2007","unstructured":"Todd, M.J., Y\u0131ld\u0131r\u0131m, E.A.: On Khachiyan\u2019s algorithm for the computation of minimum volume enclosing ellipsoids. Discr. Appl. Math. 155, 1731\u20131744 (2007)","journal-title":"Discr. Appl. Math."},{"key":"9476_CR25","doi-asserted-by":"crossref","unstructured":"Torsney, B.: A moment inequality and monotonicity of an algorithm, In: Kortanek, K. O., Fiacco, A. V. (Eds.), Proceedings of the International Symposium on Semi-Infinite Programming and Applications, Lecture Notes in Economics and Mathematical Systems, University of Texas, Austin, 215, 249\u2013260 (1983)","DOI":"10.1007\/978-3-642-46477-5_17"},{"key":"9476_CR26","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0168-9274(98)00098-1","volume":"29","author":"L Vandenberghe","year":"1998","unstructured":"Vandenberghe, L., Boyd, S.: Applications of semidefinite programming. Appl. Numer. Math. 29, 283\u2013299 (1998)","journal-title":"Appl. Numer. Math."},{"key":"9476_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Programming: Theory, Algorithms, and Applications","author":"H Wolkowicz","year":"2000","unstructured":"Wolkowicz, H., Saigal, R., Vandenrberghe, L.: Handbook of Semidefinite Programming: Theory, Algorithms, and Applications. Springer, USA (2000)"},{"key":"9476_CR28","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 (Methodological) 34, 133\u2013147 (1972)","journal-title":"J. R. Stat. Soc. Ser. B (Methodological)"},{"key":"9476_CR29","doi-asserted-by":"crossref","unstructured":"Yang, M., Biedermann, S., Tang, E.: On optimal designs for nonlinear models: a general and efficient algorithm. J. Am. Stat. Assoc. 108, 1411\u20131420 (2013)","DOI":"10.1080\/01621459.2013.806268"},{"key":"9476_CR30","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1137\/070690419","volume":"19","author":"EA Y\u0131ld\u0131r\u0131m","year":"2008","unstructured":"Y\u0131ld\u0131r\u0131m, E.A.: Two algorithms for the minimum enclosing ball problem. SIAM J. Optim. 19, 1368\u20131391 (2008)","journal-title":"SIAM J. Optim."},{"key":"9476_CR31","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, 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-014-9476-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-014-9476-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-014-9476-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,26]],"date-time":"2024-05-26T09:28:40Z","timestamp":1716715720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-014-9476-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,4]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["9476"],"URL":"https:\/\/doi.org\/10.1007\/s11222-014-9476-y","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,4]]}}}