A primal algorithm for the weighted minimum covering ball problem in $$\mathbb {R}^n$$ R n

Abstract

The nonlinear programming problem of finding the minimum covering ball of a finite set of points in \(\mathbb {R}^n\), with a positive weight corresponding to each point, is solved by a directional search method. At each iteration, the search path is either a ray or the arc of a circle and is determined by bisectors of points. Each step size along the search path is determined explicitly. The primal algorithm is shown to search along the farthest point Voronoi diagram of the given points. We provide computational results that show the efficiency of the algorithm when compared to general convex nonlinear optimization solvers.