Physical Sciences and Mathematics Commons^™

The Smallest Intersecting Ball Problem, Daniel J. Giles, Mau Nam Nguyen

Student Research Symposium

The smallest intersecting ball problem involves finding the minimal radius necessary to intersect a collection of closed convex sets. This poster discusses relevant tools of convex optimization and explores three methods of finding the optimal solution: the subgradient method, log-exponential smoothing, and an original approach using target set expansion. A fourth algorithm based on weighted projections is given, but its convergence is yet unproven. Numerical tests and comparison between methods are also presented.