139
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Solving a continuous multifacility location problem by DC algorithms

, , &
Pages 338-360 | Received 29 Jun 2019, Accepted 14 May 2020, Published online: 29 May 2020

References

  • N.T. An and N.M. Nam, Convergence analysis of a proximal point algorithm for minimizing differences of functions, Optim. 66 (2017), pp. 129–147. doi: 10.1080/02331934.2016.1253694
  • L.T.H. An and P.D. Tao, Minimum sum-of-squares clustering by DC programming and DCA, International Conference on Intelligent Computing, 2009, pp. 327–340.
  • L.T.H. An, L.H. Minh, and P.D. Tao, New and efficient DCA based algorithms for minimum sum-of-squares clustering, Pattern Recogn. 47 (2014), pp. 388–401. doi: 10.1016/j.patcog.2013.07.012
  • L.T.H. An, H.V. Ngai, and P.D. Tao, Convergence analysis of difference-of-convex algorithm with subanalytic data, J. Optim. Theory Appl. 179 (2018), pp. 103–126. doi: 10.1007/s10957-018-1345-y
  • T. Jahn, Y.S. Kupitz, H. Martini, and C. Richter, Minsum location extended to gauges and to convex sets, J. Optim. Theory Appl. 166 (2015), pp. 711–746. doi: 10.1007/s10957-014-0692-6
  • J.-B. Hiriart-Urruty and C. Lemaréchal, Fundamentals of Convex Analysis, Springer, Berlin, 2001.
  • H. Martini, K.J. Swanepoel, and G. Weiss, The Fermat-Torricelli problem in normed planes and spaces, J. Optim. Theory Appl. 115 (2002), pp. 283–314. doi: 10.1023/A:1020884004689
  • B.S. Mordukhovich, Variational Analysis and Applications, Springer, Cham, 2018.
  • B.S. Mordukhovich and N.M. Nam, Applications of variational analysis to a generalized Fermat-Torricelli problem, J. Optim. Theory Appl. 148 (2011), pp. 431–454. doi: 10.1007/s10957-010-9761-7
  • B.S. Mordukhovich and N.M. Nam, An Easy Path to Convex Analysis and Applications, Morgan & Claypool Publishers, San Rafael, 2014.
  • B.S. Mordukhovich and N.M. Nam, The Fermat-Torricelli problem and Weiszfeld's algorithm in the light of convex analysis, J. Appl. Numer. Optim. 1 (2019), pp. 205–215.
  • N.M. Nam and N. Hoang, A generalized Sylvester problem and a generalized Fermat-Torricelli problem, J. Convex Anal. 20 (2013), pp. 669–687.
  • N.M. Nam, N.T. An, R.B. Rector, and J. Sun, Nonsmooth algorithms and Nesterov's smoothing technique for generalized Fermat-Torricelli problems, SIAM J. Optim. 24 (2014), pp. 1815–1839. doi: 10.1137/130945442
  • N.M. Nam, R.B. Rector, and D. Giles, Minimizing differences of convex functions with applications to facility location and clustering, J. Optim. Theory Appl. 173 (2017), pp. 255–278. doi: 10.1007/s10957-017-1075-6
  • N.M. Nam, W. Geremew, S. Reynolds, and T. Tran, Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering, Optim. Lett. 12 (2018), pp. 455–473. doi: 10.1007/s11590-017-1183-0
  • Yu. Nesterov, A method for unconstrained convex minimization problem with the rate of convergence O(1/k2), Soviet Math. Dokl. 269 (1983), pp. 543–547.
  • Yu. Nesterov, Smooth minimization of nonsmooth functions, Math. Program. 103 (2005), pp. 127–152. doi: 10.1007/s10107-004-0552-5
  • Yu. Nesterov, Lectures on Convex Optimization, 2nd ed., Springer, Cham, 2018.
  • R.T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
  • P.D. Tao and L.T.H. An, Convex analysis approach to D.C. programming: Theory, algorithms and applications, Acta Math. Vietnam. 22 (1997), pp. 289–355.
  • P.D. Tao and L.T.H. An, A D.C. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim. 8 (1998), pp. 476–505. doi: 10.1137/S1052623494274313
  • UCI Machine Learning Repository, Available at https://archive.ics.uci.edu/ml/datasets/wine.
  • United States Cities Database, Simple Maps: Geographic Data Products, 2017, Available at http://simplemaps.com/data/us-cities.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.