A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
From MaRDI portal
Publication:1273427
DOI10.1023/A:1018333422414zbMath0912.90197MaRDI QIDQ1273427
Publication date: 25 May 1999
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Related Items (6)
On Newton's method for the Fermat-Weber location problem ⋮ Rotation averaging ⋮ The optimal solution set of the multi-source Weber problem ⋮ A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem ⋮ New models for locating a moving service facility ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
This page was built for publication: A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
