Projection onto the capped simplex
read the original abstract
We provide a simple and efficient algorithm for computing the Euclidean projection of a point onto the capped simplex---a simplex with an additional uniform bound on each coordinate---together with an elementary proof. Both the MATLAB and C++ implementations of the proposed algorithm can be downloaded at https://eng.ucmerced.edu/people/wwang5.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Smooth Partial Lotteries for Stable Randomized Selection
The Clipped Linear Lottery formalizes smoothness via a Lipschitz condition and achieves near-optimal worst-case regret while outperforming prior partial lotteries on stability and utility in both theory and real peer-...
-
Accelerated Relax-and-Round for Concave Coverage Problems
An accelerated relax-and-round algorithm for concave coverage problems achieves Õ(mn ε^{-1}) runtime and a 0.827-approximation ratio for the logarithmic reward function.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.