Mathematical Programming

, Volume 93, Issue 2, pp 327–330

On the convergence of the Weiszfeld algorithm

Authors

  • Lázaro Cánovas
    • Facultad de Matemáticas, Universidad de Murcia, Campus de Espinerado, 30100-Murcia, Spain;e-mail: lcanovas@um.es
  • Roberto Cañavate
    • Departamento de Métodos Cuantitativos e Informáticos, Facultad de Ciencias de la Empresa, Paseo Alfonso XIII, 50, 30203-Cartagena (Murcia), Spain
  • Alfredo Marín
    • Facultad de Matemáticas, Universidad de Murcia, Campus de Espinerado, 30100-Murcia, Spain;e-mail: lcanovas@um.es

DOI: 10.1007/s101070200297

Cite this article as:
Cánovas, L., Cañavate, R. & Marín, A. Math. Program. (2002) 93: 327. doi:10.1007/s101070200297

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.

Download to read the full article text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002