کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4637268 | 1340738 | 2006 | 13 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
An efficient algorithm for the smallest enclosing ball problem in high dimensions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Consider the problem of computing the smallest enclosing ball of a set of m balls in Rn. 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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 172, Issue 1, 1 January 2006, Pages 49-61
Journal: Applied Mathematics and Computation - Volume 172, Issue 1, 1 January 2006, Pages 49-61
نویسندگان
Shaohua Pan, Xingsi Li,