# Projection onto the capped simplex

arXiv: https://arxiv.org/abs/1503.01002 · HTML: https://mlsanity.com/paper/1503.01002/

## Key facts

- Cited by 15 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Mar 2015.

## Built on by (most cited first, 15 of 15)

- [Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondences](https://mlsanity.com/paper/2205.15075/) (2022)
- [No-Regret Caching via Online Mirror Descent](https://mlsanity.com/paper/2101.12588/) (2021)
- [Optimistic No-regret Algorithms for Discrete Caching](https://mlsanity.com/paper/2208.06414/) (2022)
- [Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm](https://mlsanity.com/paper/2106.11577/) (2021)
- [Online Caching with no Regret: Optimistic Learning via Recommendations](https://mlsanity.com/paper/2204.09345/) (2022)
- [Fast Projection onto the Capped Simplex with Applications to Sparse Regression in Bioinformatics](https://mlsanity.com/paper/2110.08471/) (2021)
- [Graphmax for Text Generation](https://mlsanity.com/paper/2101.00153/) (2021)
- [TERM Model: Tensor Ring Mixture Model for Density Estimation](https://mlsanity.com/paper/2312.08075/) (2023)
- [Semi-supervised Symmetric Non-negative Matrix Factorization with Low-Rank Tensor Representation](https://mlsanity.com/paper/2405.02688/) (2024)
- [Robust Phi-Divergence MDPs](https://mlsanity.com/paper/2205.14202/) (2022)
- [An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guarantees](https://mlsanity.com/paper/2405.01263/) (2024)
- [Online Subset Selection using α-Core with no Augmented Regret](https://mlsanity.com/paper/2209.14222/) (2022)
- [Probabilistically Aligned View-unaligned Clustering with Adaptive Template Selection](https://mlsanity.com/paper/2409.14882/) (2024)
- [GimmBO: Interactive Generative Image Model Merging via Bayesian Optimization](https://mlsanity.com/paper/2601.18585/) (2026)
- [Accelerated Relax-and-Round for Concave Coverage Problems](https://mlsanity.com/paper/2605.06900/) (2026)

## Abstract (arXiv)

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.