Applications of convex analysis to the smallest intersecting ball problem

MaRDI QIDQ2903490zbMATH OpenFDO

Authors Nguyen Mau Nam, Thai An Nguyen, Juan Salinas

Publication date 10 August 2012

Published in Journal of Convex Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1105.2132, http://www.heldermann.de/JCA/JCA19/JCA192/jca19027.htm

zbMATH Keywords

convex analysisconvex optimizationgeneralized differentiationsmallest enclosing ball problemsmallest intersecting ball problemsubgradient-type algorithms

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Sensitivity, stability, parametric optimization (90C31) Geometric methods (93B27)

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 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.

Recommendations

• The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
• Minimal time functions and the smallest intersecting ball problem with unbounded dynamics
• A generalized Sylvester problem and a generalized Fermat-Torricelli problem
• Relations between several problems of estimating convex compacta by balls
• On the smallest enclosing balls

Cited in

(11)

• Minimal time functions and the smallest intersecting ball problem with unbounded dynamics
• A dual simplex-type algorithm for the smallest enclosing ball of balls
• Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls
• Smallest enclosing ball multidistance
• Solving \(k\)-center problems involving sets based on optimization techniques
• The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
• A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality
• The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
• A generalized Sylvester problem and a generalized Fermat-Torricelli problem
• Convexity of nonlinear image of a small ball with applications to optimization
• On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls

This page was built for publication: Applications of convex analysis to the smallest intersecting ball problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903490)