On the global convergence of a generalized iterative procedure for the minisum location problem with l p distances for p > 2

• 成果类型: Article
• 署名作者: Rodriguez-Chia, A. M.; Valero-Franco, C.
• 署名单位: Universidad de Cadiz
• 刊物名称: MATHEMATICAL PROGRAMMING
• ISSN/ISSBN: 0025-5610
• DOI: 10.1007/s10107-011-0501-z
• 发表日期: 2013
• 页码: 477-502
• 关键词: weiszfeld algorithm; single facility; WEBER; models

摘要

This paper presents a procedure to solve the classical location median problem where the distances are measured with l(p)-norms with p > 2. In order to do that we consider an approximated problem. The global convergence of the sequence generated by this iterative scheme is proved. Therefore, this paper closes the still open question of giving a modification of the Weiszfeld algorithm that converges to an optimal solution of the median problem with l(p) norms and p is an element of (2, infinity). The paper ends with a computational analysis of the different provided iterative schemes.