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

An O ⁡ ( n ) O(n) algorithm for quadratic knapsack problems

P. Brucker · 1984

Earlier work this paper cites.

A finite algorithm for finding the projection of a point onto the canonical simplex of ℝ n \mathbb{R}^{n}

C. Michelot · 1986

Earlier work this paper cites.

An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds

P. M. Pardalos and N. Kovoor · 1990

Earlier work this paper cites.

Convex Optimization

S. Boyd and L. Vandenberghe · 2004

Cited alongside, same era.

Numerical Optimization

J. Nocedal and S. J. Wright · 2006

Cited alongside, same era.

Efficient learning of label ranking by soft projections onto polyhedra

S. Shalev-Shwartz and Y. Singer · 2006

Cited alongside, same era.

The K K -modes algorithm for clustering

Original

M. Á. Carreira-Perpiñán and W. Wang

Cited in the paper.

A simple assignment model with Laplacian smoothing

M. Á. Carreira-Perpiñán and W. Wang

Cited in the paper.

Efficient projections onto the ℓ 1 \ell_{1} -ball for learning in high dimensions

J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra · 2008

Later among the works it cites.

Projection onto a simplex

Original

Y. Chen and X. Ye · 2011

Later among the works it cites.

Laplacian K K -modes clustering

W. Wang and M. Á. Carreira-Perpiñán · 2013

Closest in time.