Solving a continuous multifacility location problem by DC algorithms

DOI10.1080/10556788.2020.1771335zbMath1501.90052arXiv1906.10331OpenAlexW3028885494MaRDI QIDQ5038184

Boris S. Mordukhovich, Anuj Bajaj, Nguyen Mau Nam, T. Tran

Publication date: 29 September 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

DCAdifference of convex functionsmixed integer programmingmultifacility locationNesterov's smoothing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80) Convexity of real functions of several variables, generalizations (26B25)

Uses Software

• Matlab
• UCI-ml

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
• Lectures on convex optimization
• New and efficient DCA based algorithms for minimum sum-of-squares clustering
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Convergence analysis of difference-of-convex algorithm with subanalytic data
• Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
• The Fermat--Torricelli problem in normed planes and spaces
• Minimizing differences of convex functions with applications to facility location and clustering
• A Generalized Sylvester Problem and a Generalized Fermat-Torricelli Problem
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Variational Analysis and Applications
• Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems