A generalized Sylvester problem and a generalized Fermat-Torricelli problem

MaRDI QIDQ2850727zbMATH OpenFDO

Authors Nguyen Mau Nam, Nguyen Hoang

Publication date 30 September 2013

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

Full work available at URL https://arxiv.org/abs/1203.3200, http://www.heldermann.de/JCA/JCA20/JCA203/jca20038.htm

zbMATH Keywords

Fermat-Torricelli problemsmallest enclosing ball problemsmallest intersecting ball problemSylvester smallest enclosing circle problem

Mathematics Subject Classification ID

Methods involving semicontinuity and convergence; relaxation (49J45) Nonsmooth analysis (49J52) Sensitivity, stability, parametric optimization (90C31)

Abstract: In this paper, we introduce and study the following problem and its further generalizations: given two finite collections of sets in a normed space, find a ball whose center lies in a given constraint set with the smallest radius that encloses all the sets in the first collection and intersects all the sets in the second one. This problem can be considered as a generalized version of the Sylvester smallest enclosing circle problem introduced in the 19th century by Sylvester which asks for the circle of smallest radius enclosing a given set of finite points in the plane. We also consider a generalized version of the Fermat-Torricelli problem: given two finite collections of sets in a normed space, find a point in a given constraint set that minimizes the sum of the farthest distances to the sets in the first collection and shortest distances (distances) to the sets in the second collection.

Recommendations

• Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls
• The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
• scientific article; zbMATH DE number 510764
• Applications of convex analysis to the smallest intersecting ball problem
• Minsum location extended to gauges and to convex sets

Cited in

(15)

• Uniqueness of circumcenters in generalized Minkowski spaces
• Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls
• 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
• Minimizing differences of convex functions with applications to facility location and clustering
• The generalized Fermat-Torricelli problem in Hilbert spaces
• The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
• Applications of convex analysis to the smallest intersecting ball problem
• On Newton's method for the Fermat-Weber location problem
• Generalized Fermat–Torricelli Problem: An Algorithm
• Minsum location extended to gauges and to convex sets
• Solving a continuous multifacility location problem by DC algorithms
• The minimal time function associated with a collection of sets
• Directional variational principles and applications to the existence study in optimization
• The MDM algorithm and the Sylvester problem

This page was built for publication: A generalized Sylvester problem and a generalized Fermat-Torricelli problem

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