Abstract
The Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweighted least squares method. It generally exhibits linear convergence. In this paper, a Newton algorithm with similar simplicity is proposed to solve a continuous multifacility location problem with the Euclidean distance measure. Similar to the Weiszfeld algorithm, the main computation can be solving a weighted least squares problem at each iteration. A Cholesky factorization of a symmetric positive definite band matrix, typically with a small band width (e.g., a band width of two for a Euclidean location problem on a plane) is performed. This new algorithm can be regarded as a Newton acceleration to the Weiszfeld algorithm with fast global and local convergence. The simplicity and efficiency of the proposed algorithm makes it particularly suitable for large-scale Euclidean location problems and parallel implementation. Computational experience suggests that the proposed algorithm often performs well in the absence of the linear independence or strict complementarity assumption. In addition, the proposed algorithm is proven to be globally convergent under similar assumptions for the Weiszfeld algorithm. Although local convergence analysis is still under investigation, computation results suggest that it is typically superlinearly convergent.
Similar content being viewed by others
References
K. D. Anderson, "An efficient newton barrier method for minimizing a sum of Euclidean norms," SIAM Journal on Optimization, (to appear).
J. Brimberg, "The Fermat-Weber location problem revisited," Mathematical Programming, 71, pp. 71-76, 1995.
P. H. Calamai and A. R. Conn, "A stable algorithm for solving the multifacility location problem involving Euclidean distances," SIAM Journal on Scientific and Statistical Computing, vol. 1, pp. 512-526, 1980.
P. H. Calamai and A. R. Conn, "A second-order method for solving the continuous multifacility location problems," in Numerical Analysis: Proceedings of the Ninth Biennial Conference, Dundee, Scotland, 1982, pp. 1-25.
P. H. Calamai and A. R. Conn, "A projected newton method for l p norm location problems," Mathematical Programming, vol. 38, pp. 75-109, 1987.
R. Chandrasekaran and A. Tamir, "Open questions concerning Wiszfeld’s algorithm for the Fermat-Weber location problem," Mathematical Programming, vol. 44, pp. 293-295, 1989.
T. F. Coleman and Y. Li, "A global and quadratically-convergent method for linear l ∞ problems," SIAM Journal on Scientific and Statistical Computing, vol. 29, pp. 1166-1186, 1992.
T. F. Coleman and Y. Li, "A globally and quadratically convergent affine scaling method for linear l 1 problems," Mathematical Programming, vol. 56, pp. 189-222, 1992.
T. F. Coleman and Y. Li, "On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds," Mathematical Programming, vol. 67, pp. 189-224, 1994.
A. R. Conn and M. L. Overton, "A primal-dual interior point method for minimizing a sum of Euclidean distance," preprint, 1994.
I. N. Katz, "Local convergence in Fermat’s problem, Mathematical Programming, vol. 6, pp. 89-104, 1974.
H. W. Kuhn, "A note on Fermat’s problem," Mathematical Programming, vol. 4, pp. 99-107, 1973.
Y. Li, "A globally convergent method for l p problems," SIAM Journal on Optimization, vol. 3, pp. 609-629, 1983.
R. F. Love, J. G. Morris, and G. O. Wesolowsky, Facilities Location Models & Methods, North-Holland, 1988.
E. Miehle, "Link-length minimization in networks," Operation Research, vol. 6, pp. 232-243, 1958.
J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, 1970.
M. L. Overton, "A quadratically convergent method for minimizing a sum of Euclidean norms," Mathematical Programming, pp. 34-63, 1983.
G. W. Stewart, "On scaled projections and pseudoinverse," Linear Algebra and its Applications, vol. 112, pp. 189-193, 1989.
The MathWorks Inc., Matlab Reference guide, The MathWorks: Natick, MA, 1992.
M. J. Todd, "Recent developments and new directions in linear programming," in M. Iri and K. Tanabe, eds., Mathematical Programming: Recent Developments and Applications, Kluwer Academic Publishers: Boston, 1989.
C. Van Loan, "On the method of weighting for equality-constrained least squares problems," SIAM Journal on Numerical Analysis, vol. 22, pp. 851-864, 1985.
S. Vavasis, "Stable numerical algorithm for equilibrium systems," SIAM J. Matrix Anal. Appl., vol. 15, pp. 1108-1131, 1994.
H. Voss and U. Eckhardt, "Linear convergence of generalized Weiszfeld’s method," Computing, vol. 25, pp. 243-251, 1980.
E. Weiszfeld, “Sur le point pour lequel la somme des distances de npoints dennés est minimum”," Tôhoko Mathematics Journal, vol. 43, pp. 355-386, 1937.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Li, Y. A Newton Acceleration of the Weiszfeld Algorithm for Minimizing the Sum of Euclidean Distances. Computational Optimization and Applications 10, 219–242 (1998). https://doi.org/10.1023/A:1018333422414
Issue Date:
DOI: https://doi.org/10.1023/A:1018333422414