Year: 2012
Type: article
Abstract: The smallest enclosing circle problem asks for the circle of smallest radius enclosing a given set of finite points on the plane. This problem was introduced in 1857 by J. J. Sylvester. After more than a century, the problem remains very active. This paper is the continuation of our effort in shedding new light to classical geometry problems using advanced tools of convex analysis and optimization. We propose and study the following generalized version of the smallest enclosing circle problem: given a finite number of nonempty closed convex sets in a reflexive Banach space, find a ball with the smallest radius that intersects all of the sets.
Source: Journal of convex analysis
DOI: 10.68381/jca19027
Authors: Nguyen Mau Nam, Thai An Nguyen, Juan Salinas
Institutions: The University of Texas System, Hue University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1594635667