{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T01:36:10Z","timestamp":1780364170677,"version":"3.54.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T00:00:00Z","timestamp":1409011200000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10898-014-0233-8","type":"journal-article","created":{"date-parts":[[2014,8,25]],"date-time":"2014-08-25T11:56:06Z","timestamp":1408967766000},"page":"351-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Fast algorithms for the minimum volume estimator"],"prefix":"10.1007","volume":"62","author":[{"given":"Selin Damla","family":"Ahipa\u015fao\u011flu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,26]]},"reference":[{"key":"233_CR1","doi-asserted-by":"crossref","unstructured":"Agullo, J.: Exact iterative computation of the multivariate minimum volume ellipsoid estimator with a branch and bound algorithm. In: Prat, A. (ed.) Proceedings in Computational Statistics, pp. 175\u2013180. Physica-Verlag, Heidelberg (1996)","DOI":"10.1007\/978-3-642-46992-3_16"},{"key":"233_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":"233_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":"233_CR4","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":"233_CR5","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1214\/aoms\/1177697374","volume":"40","author":"CL Atwood","year":"1969","unstructured":"Atwood, C.L.: Optimal and efficient designs of experiments. Ann. Math. Stat. 40, 1570\u20131602 (1969)","journal-title":"Ann. Math. Stat."},{"key":"233_CR6","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, 342\u2013352 (1973)","journal-title":"Ann. Stat."},{"key":"233_CR7","doi-asserted-by":"crossref","unstructured":"Bay, S.D., Schwabacher, M.: Mining distance-based outliers in near linear time with randomization and a simple pruning rule. In: Proceedings of Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 29\u201338. Washington, DC, USA (2003)","DOI":"10.1145\/956750.956758"},{"key":"233_CR8","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0167-7152(93)90145-9","volume":"16","author":"RD Cook","year":"1993","unstructured":"Cook, R.D., Hawkins, D.M., Weisberg, S.: Exact iterative computation of the robust multivariate minimum volume ellipsoid estimator. Stat. Prob. Lett. 16, 213\u2013218 (1993)","journal-title":"Stat. Prob. Lett."},{"key":"233_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":"233_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":"233_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-005-3883-8","volume":"34","author":"J Gotoh","year":"2006","unstructured":"Gotoh, J., Konno, H.: Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. J. Glob. Optim. 34, 1\u201314 (2006)","journal-title":"J. Glob. Optim."},{"key":"233_CR12","unstructured":"Grambow, S.C., Stromberg, A.J.: Combining the EID and FSA for Computing Minimum Volume Ellipsoid. Dept. of Stats., University of Kentucky (1998)"},{"key":"233_CR13","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. Prob. Lett. 77, 90\u201394 (2007)","journal-title":"Stat. Prob. Lett."},{"key":"233_CR14","first-page":"95","volume":"8","author":"DM Hawkins","year":"1993","unstructured":"Hawkins, D.M.: A feasible solution for the minimum volume ellipsoid estimator in multivariate data. Comput. Stat. 8, 95\u2013107 (1993)","journal-title":"Comput. Stat."},{"key":"233_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-9473(98)00082-6","volume":"30","author":"DM Hawkins","year":"1999","unstructured":"Hawkins, D.M., Olive, D.J.: Improved feasible solution algorithms for high breakdown estimation. Computat. Stat. Data Anal. 30, 1\u201311 (1999)","journal-title":"Computat. Stat. Data Anal."},{"key":"233_CR16","doi-asserted-by":"crossref","unstructured":"Hendrix, E.M.T., Garca, I., Plaza, J., Plaza, A.: On the minimum volume simplex enclosure problem for estimating a linear mixing model. J. Glob. Optim. (2012). doi: 10.1007\/s10898-012-9876-5","DOI":"10.1007\/s10898-012-9876-5"},{"key":"233_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-88670-1","volume-title":"Introduction to Nonlinear and Global Optimization","author":"EMT Hendrix","year":"2010","unstructured":"Hendrix, E.M.T., Toth, B.G.: Introduction to Nonlinear and Global Optimization. Springer, Cambridge (2010)"},{"key":"233_CR18","doi-asserted-by":"crossref","unstructured":"John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays, Presented to R. Courant on his 60th birthday January 8, 187\u2013204. Interscience, New York (1948) reprinted. In: Moser, J. (ed.) Fritz John, Collected Papers, vol. 2, pp. 543\u2013560. Birkhuser, Boston (1985)","DOI":"10.1007\/978-1-4612-5412-6_25"},{"key":"233_CR19","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":"233_CR20","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":"233_CR21","volume-title":"Foundations of Optimum Experimental Design","author":"A Pazman","year":"1986","unstructured":"Pazman, A.: Foundations of Optimum Experimental Design. Reidel, Dordrecht (1986)"},{"key":"233_CR22","unstructured":"Poston, W.L., Wegman, E.J., Priebe, C.E., Solka, J.L.: A deterministic method for robust estimation of multivariate location and shape. J. Comput. Graph. Stat. 6(3), 300\u2013313 (1997)"},{"key":"233_CR23","doi-asserted-by":"crossref","first-page":"1513","DOI":"10.2514\/3.11419","volume":"15","author":"WL Poston","year":"1992","unstructured":"Poston, W.L., Tolson, R.H.: Maximizing the determinant of the information matrix with the effective independence distribution method. AIAA J. Guid. Control Dyn. 15, 1513\u20131514 (1992)","journal-title":"AIAA J. Guid. Control Dyn."},{"key":"233_CR24","volume-title":"Optimal Design of Experiments","author":"F Pukelsheim","year":"1993","unstructured":"Pukelsheim, F.: Optimal Design of Experiments. Wiley, New York (1993)"},{"key":"233_CR25","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1080\/00401706.1999.10485670","volume":"41","author":"PJ Rousseeuw","year":"1999","unstructured":"Rousseeuw, P.J., Driessen, K.V.: A fast algorithm for the minimum covariance deteriminant estimator. Technometrics 41, 212\u2013223 (1999)","journal-title":"Technometrics"},{"key":"233_CR26","doi-asserted-by":"crossref","DOI":"10.1002\/0471725382","volume-title":"Robust Regression and Outlier Detection","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J., Leroy, A.M.: Robust Regression and Outlier Detection. Wiley, New York (1987)"},{"key":"233_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-5912-5","volume-title":"Optimal Design: An Introduction to the Theory for Parameter Estimation","author":"SD Silvey","year":"1980","unstructured":"Silvey, S.D.: Optimal Design: An Introduction to the Theory for Parameter Estimation. Chapman and Hall, New York (1980)"},{"issue":"14","key":"233_CR28","doi-asserted-by":"crossref","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. Commun. Stat. Theory Methods 7(14), 1379\u20131389 (1978)","journal-title":"Commun. Stat. Theory Methods"},{"issue":"5","key":"233_CR29","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1287\/opre.1040.0115","volume":"52","author":"P Sun","year":"2002","unstructured":"Sun, P., Freund, R.M.: Computation of minimum volume covering ellipsoids. Oper. Res. 52(5), 690\u2013706 (2002)","journal-title":"Oper. Res."},{"key":"233_CR30","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":"233_CR31","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. Discret. Appl. Math. 155, 1731\u20131744 (2007)","journal-title":"Discret. Appl. Math."},{"key":"233_CR32","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. Plann. Inference 139, 3947\u20133961 (2009)","journal-title":"J. Stat. Plann. Inference"},{"key":"233_CR33","doi-asserted-by":"crossref","first-page":"2501","DOI":"10.1016\/j.csda.2012.02.003","volume":"56","author":"F Torti","year":"2012","unstructured":"Torti, F., Perrotta, D., Atkinson, C., Riani, M.: Benchmark testing of algorithms for very robust regression: FS, LMS and LTS. Comput. Stat. Data Anal. 56, 2501\u20132512 (2012)","journal-title":"Comput. Stat. Data Anal."},{"key":"233_CR34","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":"233_CR35","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1080\/10618600.1993.10474600","volume":"2","author":"DL Woodruff","year":"1993","unstructured":"Woodruff, D.L., Rocke, D.R.: Heuristic search algorithms for the minimum volume ellipsoid. Comput. Graph. Stat. 2, 69\u201395 (1993)","journal-title":"Comput. Graph. Stat."},{"key":"233_CR36","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 design. Ann. Math. Stat. 41, 1655\u20131664 (1970)","journal-title":"Ann. Math. Stat."},{"key":"233_CR37","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 (Methodol) 34, 133\u2013147 (1972)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol)"},{"key":"233_CR38","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. doi: 10.1080\/01621459.2013.806268","DOI":"10.1080\/01621459.2013.806268"},{"key":"233_CR39","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":"233_CR40","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":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0233-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0233-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0233-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T21:47:26Z","timestamp":1717278446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0233-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,26]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["233"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0233-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,26]]}}}