The Convergence of the Weiszfeld algorithm

Computers and Mathematics with Applications

Volumn 40, Issue 4, 2000, Pages 443-451

  Uster H ^a   Love, R F ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645713528     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(00)00172-3     Document Type: Article

References (22)

1. H. Üster and R.F. Love, Application of weighted sum of order p to distance estimation, Technical Report 427, McMaster University, Faculty of Business, Hamilton, Ontario, Canada, (1998).
2. p distance location problems solved via a perturbed problem and Weiszfeld's algorithm, Operations Research 27, 1180-1188, (1979).
3. E. Weiszfeld, Sur le point lequel la somme des distances de n points donnés est minimum, Tôhoku MatheMatical Journal 43, 355-386, (1937).
4. Z. Drezner, The planar two-center and two-median problems, Transportation Science 18, 351-361, (1984).
5. R.f. Love and P.D. Dowling, A new bounding method for single facility location models, Annals of Operations Research 18, 103-112, (1989).
6. H. Juel and R.F. Love, Fixed point optimality criteria for the location problem with arbitrary norms, Journal of the Operational Research Society 32, 891-897, (1981).
7. G.O. Wesolowsky and R.F. Love, A nonlinear approximation method for solving a generalized rectangular distances weber problem, Management Science 18, 656-663, (1972).
8. J.W. Eyster, J.a. White and W.W. Wierwille, On solving multi-facility location problems using a hyperboloid approximation procedure, AIIE Transactions 5, 1-6, (1973).
9. p distances using convex programming, Operations Research 23 (3), 581-587, (1975).
10. W.A. Verdini, On Solving a Class of Location and Location-allocation Problems with Extensions to Clustering, Ph.D. Thesis, Kent State University, Graduate School of Business Administration, (1976).
11. J.G. Morris, Convergence of the Weiszfeld algorithm for weber problems using a generalized "distance" function, Operations Research 29, 37-48, (1981).
12. J. Brimberg and R.F. Love, Local convergence in a generalized fermat-weber problem, Annals of Operations Research 40, 33-66, (1992).
13. p distances, Operations Research 41 (6), 1153-1163, (1993).
14. D.M. Bertsekas, Nonlinear Programming, Athena Scientific, Belmont, MA, (1995).
15. p-norm as an empirical distance measure, Transportation Science 27, 341-349, (1993).
16. bp-norm, European Journal of Operational Research (to appear).
17. H.W. Kuhn, A note on fermat's problem, Mathematical Programming 4, 98-107, (1973).
18. J.m. Ortega and W.C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, (1970).
19. B. Harris, Speeding up iterative algorithms - The generalized weber problem, Journal of Regional Science 16, 411-413, (1978).
20. R. Chen, Location problems with costs being sums of powers of euclidean distances, Computers and Operations Research 11, 285-294, (1984).
21. R. Chen, Solution of location problems with radial cost functions, Computers Math. Applic. 10, 87-94, (1984).
22. L. Cooper, An extension to the generalized weber problem, Journal of Regional Science 8, 181-197, (1968).