Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 0683.90026
Chandrasekaran, R.; Tamir, A.
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem.
(English)
[J] Math. Program., Ser. A 44, No.3, 293-295 (1989). ISSN 0025-5610; ISSN 1436-4646/e

Summary: The Fermat-Weber location problem is to find a point in ${\bbfR}\sp n$ that minimizes the sum of the weighted Euclidean distances from given points in ${\bbfR}\sp n$. A popular iterative solution method for this problem was first introduced by {\it E. Weiszfeld} [Tôhoku Math. J. 43, 355-386 (1937; Zbl 0017.18007)]. {\it H. W. Kuhn} [Math. Program. 4, 98-107 (1973; Zbl 0255.90063)] claimed that if the 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 theorem is not always correct. We then conjecture that if this algorithm is initiated at the affine subspace spanned by the given points, the convergence is ensured for all but a denumerable number of starting points.
MSC 2000:
*90B85 Continuous location

Keywords: Weiszfeld's iterative algorithm; Fermat-Weber location problem

Citations: Zbl 0017.18007; Zbl 0255.90063; JFM 63.0583.01

Cited in: Zbl 1065.90054

Highlights
Master Server