Clustering and multifacility location with constraints via distance function penalty methods and dc programming
https://doi.org/10.1080/02331934.2018.1510498Publisher, magazine: ,
Publication year: 2018
Lưu Trích dẫn Chia sẻAbstract
This paper is a continuation of our effort in using mathematical optimization involving DC programming in clustering and multifacility location. We study a penalty method based on distance functions and apply it particularly to a number of problems in clustering and multifacility location in which the centers to be found must lie in some given set constraints. We also provide numerical examples to test our method.
Tags: Clustering, DC programming, Nesterov's smoothing techniques, k-mean algorithm
Các bài viết liên quan đến tác giả Nguyễn Mậu Nam
Relationships between approximate Jacobians and coderivatives
Frechet subdifferential calculus and optimality conditions in nondifferentiable programming
Subgradients of marginal functions in parametric mathematical programming
A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets
Solving k-center problems involving sets based on optimization techniques
Convergence analysis of a proximal point algorithm for minimizing differences of functions
Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems