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.