Projection onto the capped simplex

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.

References in corpus (1)

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

Cited by in corpus (8)

• Convex Sparse Spectral Clustering: Single-view to Multi-view
• Structured decentralized control of positive systems with applications to combination drug therapy and leader selection in directed networks
• Non-smooth Variable Projection
• Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization
• No-Regret Caching via Online Mirror Descent
• Learning to Cache With No Regrets
• Graphmax for Text Generation
• Gradient Projection for Solving Quadratic Programs with Standard Simplex Constraints