Applications of Convex Analysis to the Smallest Intersecting Ball Problem

Details Applications of Convex Analysis to the Smallest Intersecting Ball Problem Applications of Convex Analysis to the Smallest Intersecting Ball Problem

2011-05-11

arxiv.org/abs/1105.2132v1

Mathematics

Optimization and Control

Scientific paper

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 the 19th century by Sylvester [17]. 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.

Affiliated with

Also associated with

No associations

Rating

Applications of Convex Analysis to the Smallest Intersecting Ball Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Applications of Convex Analysis to the Smallest Intersecting Ball Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applications of Convex Analysis to the Smallest Intersecting Ball Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-611162