Qualitative properties of the minimum sum-of-squares clustering problem

Abstract

Fundamental qualitative properties of the minimum sum-of-squares clustering problem are established in this paper. We prove that the problem always has a global solution and, under a mild condition, the global solution set is finite. Moreover, the components of each global solution can be computed by an explicit formula. Based on a new concept of non-trivial local solution, we get necessary conditions for a system of centroids to be such a local solution. Interestingly, these necessary conditions are also sufficient ones. Finally, it is proved that the optimal value function is locally Lipschitz, the global solution map is locally upper Lipschitz, and the local solution map has the Aubin property, provided that the original data points are distinct. The obtained complete characterizations of the non-trivial local solutions allow one to understand better the performance of not only the k-means algorithm, but also of other solution methods for the problem in question.