Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls

DOI10.1007/s10957-013-0366-9zbMath1318.90073arXiv1210.3142MaRDI QIDQ2251551

Nguyen Mau Nam, Nguyen Thai An, Nguyen Dinh Hoang

Publication date: 14 July 2014

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.3142

zbMATH Keywords

optimization; convex analysis; generalized differentiation; Fermat-Torricelli problem; smallest enclosing circle problem

Mathematics Subject Classification ID

90C47: Minimax problems in mathematical programming

52A41: Convex functions and convex programs in convex geometry

26B25: Convexity of real functions of several variables, generalizations

51M05: Euclidean geometries (general) and generalizations

51N20: Euclidean analytic geometry

Related Items

Minsum location extended to gauges and to convex sets, A dual simplex-type algorithm for the smallest enclosing ball of balls, A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Fermat-Torricelli problem. I: A discrete gradient-method approach
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II.
• Applications of variational analysis to a generalized Fermat-Torricelli problem
• An extension of the Fermat-Torricelli problem
• Convex analysis and nonlinear optimization. Theory and examples.
• On the smallest enclosing balls
• On the point for which the sum of the distances to \(n\) given points is minimum
• Geometric methods and optimization problems
• The Fermat--Torricelli problem in normed planes and spaces
• Minimal time functions and the smallest intersecting ball problem with unbounded dynamics
• On the geometry of the smallest circle enclosing a finite set of points
• Constrained optimization and image space analysis. Vol. 1: Separation of sets and optimality conditions
• A Generalized Sylvester Problem and a Generalized Fermat-Torricelli Problem
• Applications of Convex Analysis to the Smallest Intersecting Ball Problem
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization
• Convex Analysis