On the smallest enclosing balls

DOI10.4310/CIS.2006.v6.n2.a3zbMath1213.90195OpenAlexW1968728275MaRDI QIDQ934329

Daizhan Cheng, Clyde F. Martin, Xiao-ming Hu

Publication date: 29 July 2008

Published in: Communications in Information and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/cis.2006.v6.n2.a3

zbMATH Keywords

smallest enclosing ball\(k\)-dimensional large circlecircumscribing ball

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (6)

The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems ⋮ An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions ⋮ On the geometry of the smallest circle enclosing a finite set of points ⋮ Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls ⋮ Solving \(k\)-center problems involving sets based on optimization techniques

This page was built for publication: On the smallest enclosing balls