Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

On the convergence of the Weiszfeld algorithm

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

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

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070200297

Keywords

Navigation