The convergence of the Weiszfeld algorithm

DOI10.1016/S0898-1221(00)00172-3zbMath0978.90066MaRDI QIDQ1586265

Üster, Halit, Love, Robert F.

Publication date: 13 November 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

convergence propertiesWeiszfeld algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30) Discrete location and assignment (90B80)

Related Items (8)

Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ New models for locating a moving service facility ⋮ A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem ⋮ Convex ordered median problem with \(\ell _p\)-norms ⋮ Convergence of a SOR-Weiszfeld Type Algorithm for Incomplete Data Sets ⋮ The convergence of the Weiszfeld algorithm ⋮ A generalization of the rectangular bounding method for continuous location models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of location problems with radial cost functions
• Local convergence in a generalized Fermat-Weber problem
• A new bounding method for single facility location models
• Location problems with costs being sums of powers of Euclidean distances
• The convergence of the Weiszfeld algorithm
• Technical Note—Minisum I_p Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• Fixed Point Optimality Criteria for the Location Problem with Arbitrary Norms
• Technical Note—Solving Constrained Multi-Facility Location Problems Involving l_p Distances Using Convex Programming
• General Considerations on the Use of the Weighted lp Norm as an Empirical Distance Measure
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• A Nonlinear Approximation Method for Solving a Generalized Rectangular Distance Weber Problem
• A note on Fermat's problem
• On the directional bias of the \(\ell_{bp}\)-norm

This page was built for publication: The convergence of the Weiszfeld algorithm