Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

09/06/2013

∙

by   Weiran Wang, et al.

∙

University of California, Merced

∙

0

∙

share

We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering.