Efficient algorithms for the smallest enclosing ball problem

Computational Optimization and Applications

Volumn 30, Issue 2, 2005, Pages 147-160

  Zhou, Guanglu ^a   Tohemail, Kim Chuan ^b   Sun, Jie ^b  

^a CURTIN UNIVERSITY   (Australia)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Computational geometry; Second order cone programming; Smoothing approximation

Indexed keywords

MEMORY REQUIREMENT; OPTIMIZATION PROBLEM; SECOND ORDER CONE PROGRAMMING; SMOOTHING APPROXIMATION;

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DATA STORAGE EQUIPMENT; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; VECTORS;

ALGORITHMS;

EID: 18644375739     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-005-4565-7     Document Type: Article

References (21)

1. R.H. Byrd, P. Lu, J. Nocedal, and C. Zhu, "A limited memory algorithm for bound constrained optimization," SIAM J. Sci. Comput., vol. 16, pp. 1190-1208, 1995.
2. J. Elzinga and D. Hearn, "The minimum covering sphere problem," Management Sci., vol. 19. pp. 96-104, 1972.
3. B. Garter, "Fast and robust smallest enclosing balls," in Algorithms-ESA'99:7th Annual European Symposium Proceedings, J. Nestril (Ed.). Lecture Notes in Computer Science 1643. Springer-Verlag, pp. 325-338.
4. B. Garter, Smallest enclosing ball-Fast and robust in C++. http://www.inf.ethz.ch/personal/gaertner/miniball.html.
5. G.H. Hardy, J.E. Littlewood, and G. Polya, Inequalities. Cambridge University Press, 1952.
6. D.W. Hearn and J. Vijan, "Efficient algorithms for the minimum circle problem." Oper. Res., vol. 30, pp. 777-795, 1982.
7. J.B. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithm. Springer-Verlag: Berlin, Heidelberg, 1993.
8. X.S. Li, "An aggregate function method for nonlinear programming," Sci. China Ser. A, vol. 34. pp. 1467-1473, 1991.
9. 3 and related problems," SIAM J. Comput., vol. 12, pp. 759-776, 1983.
10. Yu. E. Nesterov and A. Nemirovskii, Interior Polynomial Algorithms in Convex Programming. SIAM: Philadelphia, 1994.
11. Yu. E. Nesterov and M.J. Todd, "Self-scaled barriers and interior-point methods for convex programming," Math. Oper. Res., vol. 22, pp. 1-42, 1997.
12. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction. Texts and Monographs in Computer Science, Springer-Verlag: New York, 1985.
13. M.I. Shamos and D. Hoey, "Closest-point problems," in 16th Annual Symposium on Foundations of Computer Science (Berkeley, CA, 1975), IEEE Computer Society, Long Beach, CA, 1975. pp. 151-162.
14. J.F. Sturm, "Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones," Optim. Methods Softw., vol. 11 & 12, pp. 625-653, 1999.
15. P. Sun and R.M. Freund, "Computation of minimum volume covering ellipsoids," MIT Operations Research Center Working Paper OR 064-02, July, 2002.
16. R.H Tüttincü, K.C. Todd, and M.J. Todd, "Solving semidefinite-quadratic-linear programs using SDPT3," Math. Programming, vol. 95, pp. 189-217, 2003.
17. R.J. Vanderbei, "LOQO user's manual-version 3.10," Optim. Methods Softw., vol. 11 & 12, pp. 485-514, 1999.
18. E. Welzl, "Smallest enclosing disks (balls and ellipsoids)," in New Results and New Trends in Computer Science, H. Maurer (Ed.) Springer-Verlag, 1991, pp. 359-370.
19. D. White, Enclosing ball software, http://vision.ucsd.edu/~rdwhite/ball. html.
20. S. Xu, R. Freund, and J. Sun, "Solution methodologies for the smallest enclosing circle problem, "Comput. Optim. Appl.," vol. 25, pp. 283-292, 2003.
21. G.L. Xue and Y.Y. Ye, "An efficient algorithm for minimizing a sum of Euclidean norms with applications," SIAM J. Optim., vol. 7, pp. 1017-1036, 1997.