In this paper, we develop algorithms to solve generalized Fermat–Torricelli problems with both positive and negative weights and multifacility location problems involving distances generated by Minkowski gauges. We also introduce a new model of clustering based on squared distances to convex sets. Using the Nesterov smoothing technique and an algorithm for minimizing differences of convex functions introduced by Tao and An, we develop effective algorithms for solving these problems. We demonstrate the algorithms with a variety of numerical examples.
['Nguyen Mau Nam', 'R. Blake Rector', 'Daniel Morillo Giles']
Minimizing Differences of Convex Functions and Applications to Facility Location and Clustering