Show simple item record

dc.contributor.authorLi, Yuyingen_US
dc.description.abstractThe Weiszfeld algorithm for continuous location problems can be considered as an iteratively reweighted least squares method. It exhibits linear convergence. In this paper, a Newton type algorithm with similar simplicity is proposed to solve a continuous multifacility location problem with Euclidean distance measure. Similar to the Weiszfeld algorithm, at each iteration the main computation can be solving a weighted least squares problem. A Cholesky factorization of a symmetric positive definite band matrix, typically with a relatively small band width (e.g., a band width of two for a Euclidean location problem on a plane) is required. 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 also suggests that the proposed algorithm performs remarkably well in the presence of degeneracy and near degeneracy. In addition, it is proven to be globally convergent. Although the local convergence analysis is still under investigation, computation results suggest that it is typically superlinearly convergent.en_US
dc.format.extent231463 bytes
dc.format.extent181807 bytes
dc.publisherCornell Universityen_US
dc.subjecttheory centeren_US
dc.subjectlocation problemen_US
dc.subjectEuclidean distanceen_US
dc.subjectWeiszfeld methoden_US
dc.subjectNewton methoden_US
dc.titleA Newton Acceleration of the Weiszfeld Algorithm for Minimizing the Sum of Euclidean Distancesen_US
dc.typetechnical reporten_US

Files in this item


This item appears in the following Collection(s)

Show simple item record