Applications of Convex Analysis to the Smallest Intersecting Ball Problem
From MaRDI portal
Publication:2903490
zbMath1257.49017arXiv1105.2132MaRDI QIDQ2903490
Nguyen Mau Nam, Juan Jun. Salinas, Thai An Nguyen
Publication date: 10 August 2012
Full work available at URL: https://arxiv.org/abs/1105.2132
convex optimizationconvex analysisgeneralized differentiationsubgradient-type algorithmssmallest intersecting ball problemsmallest enclosing ball problem
Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Geometric methods (93B27)
Related Items
The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems ⋮ 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 proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality ⋮ Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ Solving \(k\)-center problems involving sets based on optimization techniques
This page was built for publication: Applications of Convex Analysis to the Smallest Intersecting Ball Problem
