Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function

Abstract

This paper considers a generalization of the single and multisource Weber problem for the case when the “distance” function is some power K of the usual Ip distance. Properties of the generalized problem are established, and an appropriate generalization of the Weiszfeld iterative approach is given. A convergence proof is supplied for an ϵ-approximation to the original problem, under certain restrictions on p and K.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 75 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.