Abstract
In 1937, the 16-years-old Hungarian mathematician Endre Weiszfeld, in a seminal paper, devised a method for solving the Fermat–Weber location problem—a problem whose origins can be traced back to the seventeenth century. Weiszfeld’s method stirred up an enormous amount of research in the optimization and location communities, and is also being discussed and used till these days. In this paper, we review both the past and the ongoing research on Weiszfed’s method. The existing results are presented in a self-contained and concise manner—some are derived by new and simplified techniques. We also establish two new results using modern tools of optimization. First, we establish a non-asymptotic sublinear rate of convergence of Weiszfeld’s method, and second, using an exact smoothing technique, we present a modification of the method with a proven better rate of convergence.
Original language | English |
---|---|
Pages (from-to) | 1-40 |
Number of pages | 40 |
Journal | Journal of Optimization Theory and Applications |
Volume | 164 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2014 |
Keywords
- Complexity analysis
- Fermat–Weber problem
- Gradient method
- Localization theory
- Weiszfeld’s method
All Science Journal Classification (ASJC) codes
- Management Science and Operations Research
- Control and Optimization
- Applied Mathematics