Search

Abstract: Consider the problem of computing the smallest enclosing ball of a set of m balls in . This problem arises in many applications such as location analysis, military operations, and pattern recognition, etc. In this paper, we reformulate this problem as an unconstrained convex optimization problem involving the maximum function max{0, t}, and then develop a simple algorithm particularly suitable for problems in high dimensions. This algorithm could efficiently handle problems of dimension n up to 10,000 under a moderately large m, as well as problems of dimension m up to 10,000 under a moderately large n. Numerical results are given to show the efficiency of algorithm. [Copyright &y& Elsevier]