Minimizing differences of convex functions with applications to facility location and clustering

DOI10.1007/s10957-017-1075-6zbMath1388.90097arXiv1511.07595OpenAlexW2172376568MaRDI QIDQ2401517

R. Blake Rector, Nguyen Mau Nam, Daniel Giles

Publication date: 1 September 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.07595

zbMATH Keywords

DCAdifference of convex functionsFermat-Torricelli problemmultifacility locationNesterov smoothing techniqueset clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Continuous location (90B85) Nonconvex programming, global optimization (90C26)

Related Items

Solving a continuous multifacility location problem by DC algorithms ⋮ Unnamed Item ⋮ Clustering and multifacility location with constraints via distance function penalty methods and dc programming ⋮ Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering ⋮ A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique ⋮ Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems ⋮ Solving \(k\)-center problems involving sets based on optimization techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• Minsum location extended to gauges and to convex sets
• Applications of variational analysis to a generalized Fermat-Torricelli problem
• On the convergence of the generalized Weiszfeld algorithm
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• The Fermat--Torricelli problem in normed planes and spaces
• The Fermat-Weber location problem revisited
• A new efficient algorithm based on DC programming and DCA for clustering
• Subdifferentials of a minimum time function in Banach spaces
• A Generalized Sylvester Problem and a Generalized Fermat-Torricelli Problem
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems
• Convex Analysis
• A note on Fermat's problem