References
- An LTH, Belghiti MT, Tao PD. A new efficient algorithm based on DC programming and DCA for clustering. J Glob Optim. 2007;27:503–608.
- An LTH, Minh LH, Tao PD. New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recognit. 2014;47:388–401. doi: 10.1016/j.patcog.2013.07.012
- Nam NM, Geremew W, Reynolds S, et al. The nesterov smoothing technique and minimizing differences of convex functions for hierarchical clustering. Optim Lett. 2018;12:455–473. submitted. doi: 10.1007/s11590-017-1183-0
- Nam NM, Rector RB, Giles D. Minimizing differences of convex functions with applications to facility location and clustering. J Optim Theory Appl. 2017;173:255–278. submitted. doi: 10.1007/s10957-017-1075-6
- Hiriart-Urruty JB, Lemaréchal C. Funndamental of convex analysis. Berlin: Springer-Verlag; 2001.
- Mordukhovich BS, Nam NM. An easy path to convex analysis and applications. San Rafael, CA: Morgan & Claypool Publishers; 2014.
- Rockafellar RT. Convex analysis. Princeton, NJ: Princeton University Press; 1970.
- Tao PD, An LTH. Convex analysis approach to D.C. programming: theory algorithms and applications. Acta Math Vietnam. 1997;22:289–355.
- Tao PD, An LTH. A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J Optim. 1998;8:476–505. doi: 10.1137/S1052623494274313
- Chi E, Zhou H, Lange K. Distance majorization and its applications. Math Program Series A. 2014;146:409–436. doi: 10.1007/s10107-013-0697-1
- Nocedal J, Wright SJ. Numerical optimization. 2nd Edition. New York: Springer; 2006.
- Mordukhovich BS, Nam NM. Geometric approach to convex subdifferential calculus. Optim. 2017;66:839–873. doi: 10.1080/02331934.2015.1105225
- Reinelt G. TSPLIB: A traveling salesman problem library. ORSA J Comput. 1991;3:376–384. doi: 10.1287/ijoc.3.4.376
- United States Cities Database. Simple Maps: Geographic Data Products, 2017, http://simplemaps.com/data/us-cities.