, 6E-04) 3.22E-03 (1.7E-03) 6.58E-03 (5.3E-04), -03) 9E+05 9

, 4E-04) 1.33E-03 (1.3E-04) 4E+05 6.56E-03 (6.6E-04) 1.98E-03 (1.5E-04) 4, Bucket Bucket F 1E+05, vol.3

, 2E-03) 4.84E-03 (1.8E-03) 6, pp.44-47

, 6E-04) 5.96E-03 (5.4E-04) 3.18E-03 (3.0E-04) 5, pp.65-68

M. Barlaud, W. Belhajali, P. L. Combettes, and L. Fillatre, Note that the difference in color does not take into account the value, only the position in the ordering References 1, both tables, the color gradient from red to green shows the running time ordering from worst to best, vol.65, pp.4635-4644, 2017.

E. J. Candès and T. Tao, Decoding by linear programming, IEEE Trans. Inf. Theory, vol.51, issue.12, pp.4203-4215, 2005.

L. Condat, Fast projection onto the simplex and the 1 ball, Math. Program. Ser. A, vol.158, issue.1, pp.575-585, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01056171

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, vol.6, 2001.

D. L. Donoho, De-noising by soft-thresholding, IEEE Trans. Inf. Theory, vol.41, issue.3, pp.613-627, 1995.

D. L. Donoho and M. Elad, Optimally sparse representation in general (nonorthogonal) dictionaries via 1 minimization, Proc. Natl. Acad. Sci, vol.100, issue.5, pp.2197-2202, 2003.

J. Duchi, S. Shalev-shwartz, Y. Singer, and T. Chandra, Efficient projections onto the 1 -ball for learning in high dimensions, Proceedings of the 25th International Conference on Machine Learning, pp.272-279, 2008.

M. Held, P. Wolfe, and H. P. Crowder, Validation of subgradient optimization, Math. Program, vol.6, issue.1, pp.62-88, 1974.

K. C. Kiwiel, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Math. Program, vol.112, issue.2, pp.473-491, 2008.

C. Michelot, A finite algorithm for finding the projection of a point onto the canonical simplex of R n, J. Optim. Theory Appl, vol.50, issue.1, pp.195-200, 1986.

B. Natarajan, Sparse approximate solutions to linear systems, SIAM J. Comput, vol.24, issue.2, pp.227-234, 1995.

G. Perez, M. Barlaud, . Fillatre, and J. Régin, A filtered bucket-clustering method for Projection onto the Simplex and the 1 ball, XXVIème Colloque Gretsi, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01562642

R. Tibshirani, Regression shrinkage and selection via the lasso, J. R. Stat. Soc. Ser. B (Methodol.), pp.267-288, 1996.

R. Tibshirani, The lasso method for variable selection in the COX model, Stat. Med, 1997.

. Van-den, E. Berg, and M. P. Friedlander, Probing the pareto frontier for basis pursuit solutions, SIAM J. Sci. Comput, vol.31, issue.2, pp.890-912, 2008.

, Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations