On the elimination of inessential points in the smallest enclosing ball problem

References

• S.D. Ahipaşaoğlu, P. Sun, and M.J. Todd, Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids, Optim. Methods Softw. 23 (2008), pp. 5–19. doi: 10.1080/10556780701589669
   Web of Science ®Google Scholar
• S.D. Ahipaşaoğlu and E.A. Yildirim, Identification and elimination of interior points for the minimum enclosing ball problem, SIAM J. Optim. 19(3) (2008), pp. 1392–1396. doi: 10.1137/080727208
   Web of Science ®Google Scholar
• C.L. Atwood, Sequences converging to D-optimal designs of experiments, Ann. Statist. 1(2) (1973), pp. 342–352. doi: 10.1214/aos/1176342371
   Web of Science ®Google Scholar
• M. Bădoiu and K.L. Clarkson, Optimal core-sets for balls, Comput. Geom. 40(1) (2008), pp. 14–22. doi: 10.1016/j.comgeo.2007.04.002
   Web of Science ®Google Scholar
• N.D. Botkin and V.L. Turova-Botkina, An algorithm for finding the Chebyshev center of a convex polyhedron, Appl. Math. Optim. 29 (1994), pp. 211–222. doi: 10.1007/BF01204183
   Web of Science ®Google Scholar
• K.M. Clarkson, Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm, ACM Trans. Algorithms 6(4) (2010), p. 63. doi: 10.1145/1824777.1824783
   Web of Science ®Google Scholar
• D.J. Elzinga and D.W. Hearn, The minimum covering sphere problem, Manag. Sci. 19 (1972), pp. 96–104. doi: 10.1287/mnsc.19.1.96
   Web of Science ®Google Scholar
• V.V. Fedorov, Theory of Optimal Experiments, Academic Press, New York, 1972.
   Google Scholar
• B. Gärtner, Fast and Robust Smallest Enclosing Balls, in Proc. 7th Annual European Symposium on Algorithms (ESA), J. Nesetril, ed., LNCS 1643, Springer, Berlin, 1999, pp. 325–338.
   Google Scholar
• D. Goldfarb and A. Idnani, A numerically stable dual method for solving strictly convex quadratic programs, Math. Program. 27(1) (1983), pp. 1–33. doi: 10.1007/BF02591962
   Web of Science ®Google Scholar
• R. Harman and L. Pronzato, Improvements on removing non-optimal support points in D-optimum design algorithms, Statist. Probab. Lett. 77 (2007), pp. 90–94. doi: 10.1016/j.spl.2006.05.014
   Web of Science ®Google Scholar
• J. Kiefer and J. Wolfowitz, The equivalence of two extremum problems, Canad. J. Math. 12 (1960), pp. 363–366. doi: 10.4153/CJM-1960-030-4
   Google Scholar
• H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, SIAM, Philadelphia, 1992.
   Google Scholar
• A. Pázman, Foundations of Optimum Experimental Design, Reidel (Kluwer group), Dordrecht (co-pub. VEDA, Bratislava), 1986.
   Google Scholar
• L. Pronzato, A delimitation of the support of optimal designs for Kiefer's φp-class of criteria, Statist. Probab. Lett. 83 (2013), pp. 2721–2728. doi: 10.1016/j.spl.2013.09.009
   Google Scholar
• L. Pronzato, Minimax and maximin space-filling designs: Some properties and methods for construction, Journal de la Société Française de Statistique 158(1) (2017), pp. 7–36.
   Google Scholar
• L. Pronzato and A. Pázman, Design of Experiments in Nonlinear Models. Asymptotic Normality, Optimality Criteria and Small-Sample Properties, LNS, vol. 212, Springer, New York, 2013.
   Google Scholar
• F. Pukelsheim, Optimal Experimental Design, Wiley, New York, 1993.
   Google Scholar
• R. Sibson, Discussion on a paper by H.P. Wynn, J. R. Stat. Soc. B 34 (1972), pp. 181–183.
   Google Scholar
• S.D. Silvey and D.M. Titterington, A geometric approach to optimal design theory, Biometrika 60(1) (1973), pp. 21–32. doi: 10.1093/biomet/60.1.21
   Web of Science ®Google Scholar
• D.M. Titterington, Optimal design: Some geometrical espects of D-optimality, Biometrika 62(2) (1975), pp. 313–320. doi: 10.1093/biomet/62.2.313
   Web of Science ®Google Scholar
• D.M. Titterington, Algorithms for computing D-optimal designs on a finite design space, in Proc. of the 1976 Conference on Information Science and Systems, Dept. of Electronic Engineering, John Hopkins University, Baltimore, 1976, pp. 213–216.
   Google Scholar
• D.M. Titterington, Estimation of correlation coefficients by ellipsoidal trimming, J. Roy. Statist. Soc. Ser. C 27(3) (1978), pp. 227–234.
   Google Scholar
• M.J. Todd, Minimum-Volume Ellipsoids. Theory and Algorithms, SIAM, Philadelphia, 2016.
   Google Scholar
• M.J. Todd and E.A. Yildirim, On Khachiyan's algorithm for the computation of minimum volume enclosing ellipsoids, Discrete Appl. Math. 155 (2007), pp. 1731–1744. doi: 10.1016/j.dam.2007.02.013
   Web of Science ®Google Scholar
• E. Welzl, Smallest Enclosing Disks (Balls and Ellipsoids), Lecture Notes in Computer Science, vol. 555. Springer, Heidelberg, 1991, pp. 359–370.
   Google Scholar
• C.F.J. Wu, Some algorithmic aspects of the theory of optimal designs, Ann. Statist. 6(6) (1978), pp. 1286–1301. doi: 10.1214/aos/1176344374
   Web of Science ®Google Scholar
• E.A. Yildirim, Two algorithms for the minimum enclosing ball problem, SIAM J. Optim. 19(3) (2008), pp. 1368–1391. doi: 10.1137/070690419
   Web of Science ®Google Scholar
• Y. Yu, Monotonic convergence of a general algorithm for computing optimal designs, Ann. Statist. 38(3) (2010), pp. 1593–1606. doi: 10.1214/09-AOS761
   Web of Science ®Google Scholar