Papers › Projection onto the probability simplex: An efficient algorithm with a simple proof,...

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

6 Sep 2013arXiv:1309.1541archive 2025-07-28

Weiran Wang, Miguel Á. Carreira-Perpiñán

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.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

jlyx417353617/hadamard_response mentioned on GitHubSyntology: not harvested report
mehdisebbar/clustering-models mentioned on GitHubSyntology: not harvested report
zitengsun/hadamard_response mentioned on GitHubSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Clustering

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections