# Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem

```@article{Chandrasekaran1989OpenQC,
title={Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem},
author={Ramaswamy Chandrasekaran and Arie Tamir},
journal={Mathematical Programming},
year={1989},
volume={44},
pages={293-295}
}```
• Published 1 May 1989
• Mathematics, Computer Science
• Mathematical Programming
The Fermat—Weber location problem is to find a point in ℝn that minimizes the sum of the weighted Euclidean distances fromm given points in ℝn. A popular iterative solution method for this problem was first introduced by Weiszfeld in 1937. In 1973 Kuhn claimed that if them given points are not collinear then for all but a denumerable number of starting points the sequence of iterates generated by Weiszfeld's scheme converges to the unique optimal solution. We demonstrate that Kuhn's convergence…

## Topics from this paper

The Fermat—Weber location problem revisited
• J. Brimberg
• Mathematics, Computer Science
Math. Program.
• 1995
It is proved that Weiszfeld's algorithm converges to the unique optimal solution for all but a denumerable set of starting points if, and only if, the convex hull of the given points is of dimensionN.
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
Local convergence in a generalized Fermat-Weber problem
• Mathematics, Computer Science
Ann. Oper. Res.
• 1992
A generalized version of the Fermat-Weber problem, where distances are measured by anlp norm and the parameterp takes on a value in the closed interval, which permits the choice of a continuum of distance measures from rectangular to Euclidean.
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.
Noniterative Solution of Some Fermat-Weber Location Problems
• Reuven Chen
• Mathematics, Computer Science
• 2011
This work describes a noniterative direct alternative to the iterative process of solving Fermat-Weber problems, based on the insight that the gradient components of the individual demand points can be considered as pooling forces with respect to the solution point.
Accelerating convergence in the Fermat-Weber location problem
• Mathematics, Computer Science
Oper. Res. Lett.
• 1998
Computer results are obtained which demonstrate that the total number of iterations to meet a given stopping criterion will be reduced substantially by the new step size, with the most dramatic results being observed for values of p close to 1.
A Weiszfeld-like algorithm for a Weber location problem constrained to a closed and convex set
The Weber problem consists of finding a point in \$\mathbbm{R}^n\$ that minimizes the weighted sum of distances from \$m\$ points in \$\mathbbm{R}^n\$ that are not collinear. An application that motivated
ON CONVERGENCE OF THE WEISZFELD ALGORITHM
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In his previous work, Brimberg (1995) attempts to resolve a conjecture posed by Chandrasekaran and
FURTHER NOTES ON CONVERGENCE OF THE WEISZFELD ALGORITHM
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In his previous work, Brimberg (1995) attempts to resolve a conjecture posed by Chandrasekaran and
On the convergence of the generalized Weiszfeld algorithm
• Z. Drezner
• Mathematics, Computer Science
Ann. Oper. Res.
• 2009
It is proved that a Weiszfeld-like iterative procedure for the solution of Weber-like location problems converges to a local minimum when three conditions are met.

## References

SHOWING 1-7 OF 7 REFERENCES
Local convergence in Fermat's problem
• I. Katz
• Mathematics, Computer Science
Math. Program.
• 1974
It is shown that although convergence is global, the rapidity of convergence depends strongly upon whether or not  is a destination, and locally convergence is always linear with upper and lower asymptotic convergence boundsλ andλ′.
A note on Fermat's problem
• H. Kuhn
• Mathematics, Computer Science
Math. Program.
• 1973
This note calls attention to the work of Weiszfeld in 1937, who may have been the first to propose an iterative algorithm for the General Fermat Problem.
A quadratically convergent method for minimizing a sum of euclidean norms
• M. Overton
• Mathematics, Computer Science
Math. Program.
• 1983
A new method is presented which, at each iteration, computes a direction of search by solving the Newton system of equations, projected, if necessary, into a linear manifold along which F is locally differentiable, and has quadratic convergence to a solutionx under given conditions.
A subgradient algorithm for certain minimax and minisum problems
• Mathematics, Computer Science
Math. Program.
• 1978
Convergence of the algorithm to an epsilon-optimal solution is proven and its effectiveness is demonstrated by solving a number of location problems and linear approximation problems.
On Solving Multifacility Location Problems using a Hyperboloid Approximation Procedure
• Mathematics
• 1973
Abstract An iterative solution method is presented for solving multifacility location problems involving rectilinear and/or Euclidean distances. The iterative procedure is based on the use of an
A second-order method for solving the continuous multifacility location problem
• Mathematics
• 1982
A unified and numerically stable second-order approach to the continuous multifacility location problem is presented. Although details are initially given for only the unconstrained Euclidean norm
Time Bounds for Selection
• Computer Science, Mathematics
J. Comput. Syst. Sci.
• 1973
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm-PICK. Specifically, no more than