A note on Fermat's problem

@article{Kuhn1973ANO,
  title={A note on Fermat's problem},
  author={Harold W. Kuhn},
  journal={Mathematical Programming},
  year={1973},
  volume={4},
  pages={98-107}
}
  • H. Kuhn
  • Published 1 December 1973
  • Mathematics, Computer Science
  • Mathematical Programming
The General Fermat Problem asks for the minimum of the weighted sum of distances fromm points inn-space. Dozens of papers have been written on variants of this problem and most of them have merely reproduced known results. This note calls attention to the work of Weiszfeld in 1937, who may have been the first to propose an iterative algorithm. Although the same algorithm has been rediscovered at least three times, there seems to be no completely correct treatment of its properties in the… 
Local convergence in Fermat's problem
  • I. Katz
  • Mathematics, Computer Science
    Math. Program.
  • 1974
TLDR
It is shown that although convergence is global, the rapidity of convergence depends strongly upon whether or not  is a destination, and locally convergence is always linear with upper and lower asymptotic convergence boundsλ andλ′.
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
TLDR
It is demonstrated that Kuhn's convergence theorem is not always correct and it is conjecture that if this algorithm is initiated at the affine subspace spanned by them given points, the convergence is ensured for all but a denumerable number of starting points.
A Note on Weighted Fermat Problem in Lp Space
In this paper, we begin by introducing a well-known geometry concept: the Fermat point in a triangle. Then, we generalize the problem and propose an iterative algorithm based on gradient descent to
A Characterization of the Fermat Point in Hilbert Spaces
This paper studies the Fermat point in Hilbert spaces for a system of n distinct points. We prove the existence of the Fermat point and we determine its location in the convex hull of the given
ON CONVERGENCE OF THE WEISZFELD ALGORITHM
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In his previous work, Brimberg (1995) attempts to resolve a conjecture posed by Chandrasekaran and
Convergence and Descent in the Fermat Location Problem
The Fermat location problem is to find a point whose sum of weighted distances from m given points vertices is a minimum. The best known method of solution is an iterative scheme devised by Weiszfeld
Median problems in location science
In this chapter we are concerned with problems of the following type: Given a finite set of weighted points in Euclidean n-space, n ≥ 2, we are interested in the location of an additonal point such
FURTHER NOTES ON CONVERGENCE OF THE WEISZFELD ALGORITHM
The Fermat-Weber problem is one of the most widely studied problems in classical location theory. In his previous work, Brimberg (1995) attempts to resolve a conjecture posed by Chandrasekaran and
The Fermat—Weber location problem revisited
  • J. Brimberg
  • Mathematics, Computer Science
    Math. Program.
  • 1995
TLDR
It is proved that Weiszfeld's algorithm converges to the unique optimal solution for all but a denumerable set of starting points if, and only if, the convex hull of the given points is of dimensionN.
A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
TLDR
This paper generalizes earlier work by the first author by introducing an asymmetric Euclidean distance in which, at each destination, the x-component is weighted differently from the y-component.
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Link-Length Minimization in Networks
Three general methods are described for attacking link-length minimization problems. All methods assume a system of fixed points that are to be interconnected by a network of links the sum of whose
Location-Allocation Problems
The calculational aspects of solving certain classes of location-allocation problems are presented. Both exact extremal equations and a heuristic method are presented for solving these problems.