Clustering and multifacility location with constraints via distance function penalty methods and dc programming. (2nd November 2018)

• Record Type: Journal Article
• Authors: Nam, Nguyen Mau; An, Nguyen Thai; Reynolds, Sam; Tran, Tuyen
• Is Part Of: Optimization. Volume 67:Number 11(2018)
• Page Start: 1869
• Page End: 1894
• Publication Date: 2018-11-02
• Subjects: Clustering -- DC programming -- Nesterov's smoothing techniques -- k-mean algorithm; 49J52 -- 49J53 -- 90C31; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2018.1510498
• Languages: English
• ISSNs: 0233-1934

Abstract

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.