1. Coordinate Ascent for Convex Clustering

    Tue 23 April 2013

    Convex clustering is the reformulation of k-means clustering as a convex problem. While the two problems are not equivalent, the former can be seen as a relaxation of the latter that allows us to easily find globally optimal solutions (as opposed to only locally optimal ones).

    Suppose we have a …