Dearing, P.; Smith, Andrea - In: Journal of Global Optimization 55 (2013) 2, pp. 261-278
The nonlinear convex programming problem of finding the minimum covering weighted ball of a given finite set of points in <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${\mathbb{R}^n}$$</EquationSource> </InlineEquation> is solved by generating a finite sequence of subsets of the points and by finding the minimum covering weighted ball of each subset in the sequence until...</equationsource></inlineequation>