Minimal Time Functions and the Smallest Intersecting Ball Problem with Unbounded Dynamics
https://link.springer.com/article/10.1007%2Fs10957-012-0048-zPublisher, magazine: ,
Publication year: 2012
Lưu Trích dẫn Chia sẻAbstract
The smallest enclosing circle problem introduced in the nineteenth century by Sylvester asks for the circle of smallest radius enclosing a given set of finite points in the plane. An extension of this problem, called the smallest intersecting ball problem, was also considered recently: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that intersects all of the sets. In this paper, we initiate the study of minimal time functions generated by unbounded dynamics and discuss their applications to further extensions of the smallest enclosing circle problem. This approach continues our effort in applying convex and nonsmooth analysis to the well-established field of facility location.
Tags: Minimal time functions, Subdifferential, Subgradient method, Smallest intersecting ball problem, 1-Center problem
Các bài viết liên quan đến tác giả Nguyễn Mậu Nam
Relationships between approximate Jacobians and coderivatives
Frechet subdifferential calculus and optimality conditions in nondifferentiable programming
Subgradients of marginal functions in parametric mathematical programming
A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets
Solving k-center problems involving sets based on optimization techniques
Convergence analysis of a proximal point algorithm for minimizing differences of functions
Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems