Abstract.
In this work we analyze the paper “Brimberg, J. (1995): The Fermat-Weber location problem revisited. Mathematical Programming 71, 71–76” which claims to close the question on the conjecture posed by Chandrasekaran and Tamir in 1989 on the convergence of the Weiszfeld algorithm. Some counterexamples are shown to the proofs showed in Brimberg’s paper.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: January 1999 / Accepted: December 2001¶Published online April 12, 2002
RID="*"
ID="*"Partially supported by PB/11/FS/97 of Fundación Séneca of the Comunidad Autónoma de la Región de Murcia
RID="**"
ID="**"Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica (I+I+D), project TIC2000-1750-C06-06
RID="*"
RID="**"
Rights and permissions
About this article
Cite this article
Cánovas, L., Cañavate, R. & Marín, A. On the convergence of the Weiszfeld algorithm. Math. Program. 93, 327–330 (2002). https://doi.org/10.1007/s101070200297
Issue Date:
DOI: https://doi.org/10.1007/s101070200297