On the convergence of the Weiszfeld algorithm
type: Item
instance of: scholarly article
title: On the convergence of the Weiszfeld algorithm
zbMATH Open document ID: 1065.90054
author: Alfredo Marín
author: Lázaro Cánovas
author: Roberto J. Cañavate
published in: Mathematical Programming. Series A. Series B
publication date: 2002-01-01T00:00:00Z
review text: The Weiszfeld algorithm is an iterative algorithm to solve the Fermat-Weber problem. \textit{R. Chandrasekaran} and \textit{A. Tamir} [Math. Program., Ser. A 44, No. 3, 293--295 (1989; Zbl 0683.90026)] stated the following conjecture: If the convex hull of the set of vertices is of full dimension, then the set of initial points for which the sequence generated by the Weiszfeld algorithm yields in a vertex is denumerable. \textit{J. Brimberg} [Math. Program. 71, No. 1 (A), 71--76 (1995; Zbl 0855.90075)] claimed to prove the conjecture and extends it to a necessary and sufficient condition. The authors show in this paper that Brimberg's proof is not correct. Moreover, they show by examples that the conjecture cannot be extended to a necessary and sufficient condition.
reviewed by: S. Nickel
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1942743
zbMATH Keywords: continuous location
zbMATH Keywords: Weiszfeld algorithm
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: s101070200297
OpenAlex ID: W49320045
DOI: 10.1007/S101070200297
description: scientific article; zbMATH DE number 1942743