On the convergence of the Weiszfeld algorithm

0.00 Avg rating—0 Votes

Article ID:	iaor20032539
Country:	Germany
Volume:	93
Issue:	2
Start Page Number:	327
End Page Number:	330
Publication Date:	Jan 2002
Journal:	Mathematical Programming
Authors:	Cnovas L., Marn A., Caavate R.
Keywords:	location

Abstract:

In this work we analyze the paper ‘Brimberg, J.: The Fermat–Weber location problem revisited’, 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 given in Brimberg's paper.

Reviews

Required fields are marked *. Your email address will not be published.