Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat-Torricelli Problems
This research was partially supported by the USA National Science Foundation under grant DMS-1411817 and the Simons Foundation under grant 208785.
SIAM Journal of Optimization
Plane geometry, Mathematical optimization, Algorithms, Fermat's theorem
We present algorithms for solving a number of new models of facility location which generalize the classical Fermat--Torricelli problem. Our first approach involves using Nesterov's smoothing technique and the minimization majorization principle to build smooth approximations that are convenient for applying smooth optimization schemes. Another approach uses subgradient-type algorithms to cope directly with the nondifferentiability of the cost functions. Convergence results of the algorithms are proved and numerical tests are presented to show the effectiveness of the proposed algorithms.
Nam, N. M., An, N. T., Rector, R. B., & Sun, J. Nonsmooth algorithms and Nesterov's smoothing technique for generalized Fermat-Torricelli problems. SIAM Journal of Optimization. Vol. 24, No. 4, pp. 1815–1839
This is the publisher's PDF, reproduced here with author and publisher permission. Copyright © 2014 SIAM. Unauthorized reproduction of this article is prohibited.