Further notes on convergence of the Weiszfeld algorithm
From MaRDI portal
Publication:4928199
DOI10.2298/YJOR0302199BzbMath1274.90207OpenAlexW2020546119MaRDI QIDQ4928199
Publication date: 10 June 2013
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/yjor0302199b
Related Items (9)
On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) ⋮ A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ A generalized Weiszfeld method for the multi-facility location problem ⋮ A geometric perspective of the Weiszfeld algorithm for solving the Fermat−Weber problem ⋮ On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems ⋮ \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
This page was built for publication: Further notes on convergence of the Weiszfeld algorithm
