# On the point for which the sum of the distances to n given points is minimum

```@article{Vazsonyi2009OnTP,
title={On the point for which the sum of the distances to n given points is minimum},
author={Andrew Vazsonyi and Frank Plastria},
journal={Annals of Operations Research},
year={2009},
volume={167},
pages={7-41}
}```
• Published 1 March 2009
• Computer Science, Mathematics
• Annals of Operations Research
Translation with annotations of E. Weiszfeld, Sur le point pour lequel la somme des distances de n points donnés est minimum, Tôhoku Mathematical Journal (first series), 43 (1937) pp. 355–386.A short introduction about the translation is found in Appendix A. Appendix B lists particular notations used by Weiszfeld and their now more conventional equivalents. Numbered footnotes are those of the original paper of Weiszfeld. Boxed numerals are references to observations about the translation and…
190 Citations

## Figures and Topics from this paper

Location of the weighted Fermat–Torricelli point on the K-plane (Part II)
Abstract We obtain the location of the weighted Fermat–Torricelli point A0 for a geodesic triangle △ A1A2A3 on the K-plane (two dimensional sphere SK2 and two dimensional hyperbolic plane HK2) by
The Fermat-Torricelli Problem in the Light of Convex Analysis
• Mathematics
• 2013
In the early 17th century, Pierre de Fermat proposed the following problem: given three points in the plane, find a point such that the sum of its Euclidean distances to the three given points is
The Fermat-Torricelli problem and Weiszfeld’s algorithm in the light of convex analysis
• Mathematics
Journal of Applied and Numerical Optimization
• 2019
In the early 17th century, Pierre de Fermat proposed the following problem: given three points in the plane, find a point such that the sum of its Euclidean distances to the three given points is
A projected Weiszfeld algorithm for the box-constrained Weber location problem
• Mathematics, Computer Science
Appl. Math. Comput.
• 2011
This work proposes a fixed-point iteration with projections on the constraints and demonstrates descending properties and proves that the limit of the sequence generated by the method is a feasible point and satisfies the KKT optimality conditions.
A short review on the theory of generalized conics
Generalized conics are the level sets of functions measuring the average distance from a given set of points. This involves an extension of the concept of conics to the case of infinitely many
Finding Median Point-Set Using Earth Mover's Distance
• Computer Science
AAAI
• 2014
This paper studies a prototype learning problem, called Median Point-Set, whose objective is to construct a prototype for a set of given point- sets so as to minimize the total Earth Mover's Distances between the prototype and the point-sets, and presents the first purely geometric approach.
On solving the planar k-centrum problem with Euclidean distances
• Mathematics, Computer Science
Eur. J. Oper. Res.
• 2010
This paper presents a solution procedure based on a gradient descent method for the k-centrum problem in the plane. The particular framework of this problem for the Euclidean norm leads to bisector
Constrained Fermat-Torricelli-Weber Problem in real Hilbert Spaces
The Fermat-Weber location problem requires finding a point in \$\mathbb{R}^n\$ that minimizes the sum of weighted Euclidean distances to \$m\$ given points. An iterative solution method for this problem
An algorithm for computing Fréchet means on the sphere
• Computer Science
Optim. Lett.
• 2019
This work presents an algorithm for solving a special global problem over the sphere, namely the determination of Fréchet means, which are points minimising the mean distance to a given set of points.
An algorithm for computing Fr\'echet means on the sphere
• Mathematics
• 2018
For most optimisation methods an essential assumption is the vector space structure of the feasible set. This condition is not fulfilled if we consider optimisation problems over the sphere. We

## References

SHOWING 1-10 OF 15 REFERENCES
On the convergence of the Weiszfeld algorithm
• Mathematics, Computer Science
Math. Program.
• 2002
This work analyzes the paper “Brimberg, J. (1995): The Fermat-Weber location problem revisited” which claims to close the question on the conjecture posed by Chandrasekaran and Tamir in 1989 on the convergence of the Weiszfeld algorithm.
A mathematician's apology
Facility location - applications and theory
• Engineering, Computer Science
• 2001
The Weber Problem, a study of location problems in the public sector, and an Efficient Genetic Algorithm for the p-Median Problem, provide insights into the design of location models.
Pure mathematics and the Weiszfeld algorithm
• Decision Line, 33(3), 12–13. http://www.decisionsciences.org/DecisionLine/Vol33/33_3/index.htm.
• 2002