Fast projection onto the simplex and the $$\pmb {l}_\mathbf {1}$$ l 1 ball
Open accessThe DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches
Bioucas-Dias, J. M., Plaza, A., Dobigeon, N., Parente, M., Du, Q., Gader, P., & Chanussot, J. (2012) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2012.2194696 · Cited by 2,836 · cited 1×
“INTRODUCTION The projection of a vector onto the simplex or the l1 ball appears in imaging problems, such as segmentation [1] and multispectral unmixing [2], in portfolio optimization [3], and in many applications of statistics, operations research and machine learning [4]–[6].”
BackgroundProbing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
Validation of subgradient optimization
Held, M., Wolfe, P., & Crowder, H. P. (1974) · Mathematical Programming · doi:10.1007/bf01580223 · Cited by 1,362
Blum, M., Floyd, R. W., Pratt, V., Rivest, R. L., & Tarjan, R. E. (1973) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(73)80033-9 · Cited by 1,235
Efficient projections onto the l1-ball for learning in high dimensions
Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390191 · Cited by 1,184
Sparse and stable Markowitz portfolios
Brodie, J., Daubechies, I., De Mol, C., Giannone, D., & Loris, I. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0904287106 · Cited by 481
A finite algorithm for finding the projection of a point onto the canonical simplex of ? n
Michelot, C. (1986) · Journal of Optimization Theory and Applications · doi:10.1007/bf00938486 · Cited by 269
A survey on the continuous nonlinear resource allocation problem
Patriksson, M. (2008) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.12.006 · Cited by 211
Bentley, J. L., & McIlroy, M. D. (1993) · Software Practice and Experience · doi:10.1002/spe.4380231105 · Cited by 187
Convex Multi-class Image Labeling by Simplex-Constrained Total Variation
Lellmann, J., Kappes, J. H., Yuan, J. Y., Becker, F., & Schnörr, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02256-2_13 · Cited by 160
Efficient Euclidean projections in linear time
Liu, J., & Ye, J. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553459 · Cited by 155
Total Variation Projection With First Order Schemes
Fadili, J. M., & Peyré, G. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2072512 · Cited by 127
A Newton’s method for the continuous quadratic knapsack problem
Cominetti, R., Mascarenhas, W. F., & Silva, P. J. S. (2014) · Mathematical Programming Computation · doi:10.1007/s12532-014-0066-y · Cited by 39
Gong, P., Gai, K., & Zhang, C. (2011) · Neurocomputing · doi:10.1016/j.neucom.2011.02.019 · Cited by 24
Cited by
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Multiview Consensus Graph Clustering
Zhan, K., Nie, F., Wang, J., & Yang, Y. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2877335 · Cited by 545
Hyperspectral Super-Resolution by Coupled Spectral Unmixing
Lanaras, C., Baltsavias, E., & Schindler, K. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.409 · Cited by 424
Hyperspectral Image Unmixing With Endmember Bundles and Group Sparsity Inducing Mixed Norms
Drumetz, L., Meyer, T. R., Chanussot, J., Bertozzi, A. L., & Jutten, C. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2897254 · Cited by 104
Metadata
- Authors
- Condat, L.
- Venue
- Mathematical Programming
- Published
- 2015-09-19
- Volume
- 158
- Issue
- 1-2
- Pages
- 575-585
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2180180824
- Cited by
- 350
- References
- 16
- FWCI
- 25.39
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.