A note on Fermat's problem

By H. Kuhn. 1973

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Robust Aggregation for Federated Learning (2019, methodology): “Weiszfeld’s algorithm [85] to compute the geometric median, has received much attention [11, 49, 83].”
Geometric median and robust estimation in Banach spaces (2013, neutral): “Kuhn proved [23] that Weiszfeld’s algorithm con-”
A modified Weiszfeld algorithm for the Fermat-Weber location problem (2001, methodology): “Kuhn (1973) showed that for an initial point y ∈ ∪mi=1 Di , the Weiszfeld algorithm converges monotonically to the unique optimal solution of the Fermat-Weber location problem.”
Weiszfeld’s Method: Old and New Results (2014, methodology): “The arguments used in [14] for proving Theorem 5.”
Location analysis: A synthesis and survey (2005, background): “, Kulcar (1996). A review of solid wastes management from an OR perspective is provided by Liebman (1997) who includes in his review the models which site transfer stations. As Fleischmann et al. (1997) point out, the idea of reverse logistics fits in this schema as well. An early work on the siting”
Local convergence in Fermat's problem (1974, background): “Recently, Kuhn [ 10 ] corrected a proof given in [14] and showed the global convergence of (2) almost always.”
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning (2017, background): “The effect of this singularity issue in algorithm convergence has been extensively studied in the literature, see [29], [39], [41] and [42] for examples.”
On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes (2015, unknown): “, [18, 8, 28].”