Accelerating convergence in the Fermat-Weber location problem

Jack Brimberg, Reuven Chen, Doron Chen

Research output: Contribution to journalArticlepeer-review

Abstract

This paper presents a simple procedure for accelerating convergence in a generalized Fermat-Weber problem with lp distances. The main idea is to multiply the predetermined step size of the Weiszfeld algorithm by a factor which is a function of the parameter p. The form of this function is derived from the local convergence properties of the iterative sequence. Computational results are obtained which demonstrate that the total number of iterations to meet a given stopping criterion will be reduced substantially by the new step size, with the most dramatic results being observed for values of p close to 1.

Original languageEnglish
Pages (from-to)151-157
Number of pages7
JournalOperations Research Letters
Volume22
Issue number4-5
DOIs
StatePublished - 1998

Keywords

  • Convergence
  • Minisum location problem
  • Single facility
  • l norm

Fingerprint

Dive into the research topics of 'Accelerating convergence in the Fermat-Weber location problem'. Together they form a unique fingerprint.

Cite this