{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T18:59:23Z","timestamp":1776452363088,"version":"3.51.2"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,9,19]],"date-time":"2015-09-19T00:00:00Z","timestamp":1442620800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"LabEx PERSYVAL-Lab","award":["ANR-11-LABX-0025"],"award-info":[{"award-number":["ANR-11-LABX-0025"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10107-015-0946-6","type":"journal-article","created":{"date-parts":[[2015,9,19]],"date-time":"2015-09-19T02:50:10Z","timestamp":1442631010000},"page":"575-585","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":254,"title":["Fast projection onto the simplex and the $$\\pmb {l}_\\mathbf {1}$$ l 1 ball"],"prefix":"10.1007","volume":"158","author":[{"given":"Laurent","family":"Condat","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,19]]},"reference":[{"issue":"11","key":"946_CR1","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"JL Bentley","year":"1993","unstructured":"Bentley, J.L., McIlroy, M.D.: Engineering a sort function. Softw. Pract. Exp. 23(11), 1249\u20131265 (1993)","journal-title":"Softw. Pract. Exp."},{"issue":"2","key":"946_CR2","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/JSTARS.2012.2194696","volume":"5","author":"JM Bioucas-Dias","year":"2012","unstructured":"Bioucas-Dias, J.M., Plaza, A., Dobigeon, N., Parente, M., Du, Q., Gader, P., Chanussot, J.: Hyperspectral unmixing overview: geometrical, statistical, and sparse regression-based approaches. IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens. 5(2), 354\u2013379 (2012)","journal-title":"IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens."},{"key":"946_CR3","doi-asserted-by":"crossref","unstructured":"Blondel, M., Fujino, A., Ueda, N.: Large-scale multiclass support vector machine training via Euclidean projection onto the simplex. In: Proceedings of the 22th International Conference on Pattern Recognition (ICPR), pp. 1289\u20131294 (2014)","DOI":"10.1109\/ICPR.2014.231"},{"issue":"4","key":"946_CR4","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"issue":"30","key":"946_CR5","doi-asserted-by":"crossref","first-page":"12267","DOI":"10.1073\/pnas.0904287106","volume":"106","author":"J Brodie","year":"2009","unstructured":"Brodie, J., Daubechies, I., Mol, C.D., Giannone, D., Loris, I.: Sparse and stable Markowitz portfolios. Proc. Natl. Acad. Sci. 106(30), 12267\u201312272 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"946_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s12532-014-0066-y","volume":"6","author":"R Cominetti","year":"2014","unstructured":"Cominetti, R., Mascarenhas, W.F., Silva, P.J.S.: A Newton\u2019s method for the continuous quadratic knapsack problem. Math. Program. Comp. 6, 151\u2013169 (2014)","journal-title":"Math. Program. Comp."},{"key":"946_CR7","doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the $$\\ell _1$$ \u2113 1 -ball for learning in high dimensions. In: Proceedings of the 25th International Conference on Machine learning (ICML) (2008)","DOI":"10.1145\/1390156.1390191"},{"issue":"3","key":"946_CR8","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1109\/TIP.2010.2072512","volume":"20","author":"J Fadili","year":"2011","unstructured":"Fadili, J., Peyr\u00e9, G.: Total variation projection with first order schemes. IEEE Trans. Image Process. 20(3), 657\u2013669 (2011)","journal-title":"IEEE Trans. Image Process."},{"key":"946_CR9","doi-asserted-by":"crossref","first-page":"2754","DOI":"10.1016\/j.neucom.2011.02.019","volume":"74","author":"P Gong","year":"2011","unstructured":"Gong, P., Gai, K., Zhang, C.: Efficient Euclidean projections via piecewise root finding and its application in gradient projection. Neurocomputing 74, 2754\u20132766 (2011)","journal-title":"Neurocomputing"},{"key":"946_CR10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held, M., Wolfe, P., Crowder, H.: Validation of subgradient optimization. Math. Program. 6, 62\u201388 (1974)","journal-title":"Math. Program."},{"key":"946_CR11","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.tcs.2005.06.032","volume":"347","author":"KC Kiwiel","year":"2005","unstructured":"Kiwiel, K.C.: On Floyd and Rivest\u2019s SELECT algorithm. Theor. Comput. Sci. 347, 214\u2013238 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"946_CR12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10107-006-0050-z","volume":"112","author":"KC Kiwiel","year":"2008","unstructured":"Kiwiel, K.C.: Breakpoint searching algorithms for the continuous quadratic knapsack problem. Math. Program. Ser. A 112, 473\u2013491 (2008)","journal-title":"Math. Program. Ser. A"},{"key":"946_CR13","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10957-007-9317-7","volume":"136","author":"KC Kiwiel","year":"2008","unstructured":"Kiwiel, K.C.: Variable fixing algorithms for the continuous quadratic knapsack problem. J. Optim. Theory Appl. 136, 445\u2013458 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"946_CR14","first-page":"232","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 2, 3rd edn, p. 232. Addison-Wesley, Boston (1998)","edition":"3"},{"key":"946_CR15","doi-asserted-by":"crossref","unstructured":"Lellmann, J., Kappes, J.H., Yuan, J., Becker, F., Schn\u00f6rr, C.: Convex multi-class image labeling by simplex-constrained total variation. In: Proceedings of Scale Space and Variational Methods in Computer Vision (SSVM), vol. 5567, pp. 150\u2013162 (2009)","DOI":"10.1007\/978-3-642-02256-2_13"},{"key":"946_CR16","doi-asserted-by":"crossref","unstructured":"Liu, J., Ye, J.: Efficient Euclidean projections in linear time. In: Proceedings of the 26th International Conference Machine Learning (ICML) (2009)","DOI":"10.1145\/1553374.1553459"},{"issue":"1","key":"946_CR17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00938486","volume":"50","author":"C Michelot","year":"1986","unstructured":"Michelot, C.: A finite algorithm for finding the projection of a point onto the canonical simplex of $${\\mathbb{R}}^n$$ R n . J. Optim. Theory Appl. 50(1), 195\u2013200 (1986)","journal-title":"J. Optim. Theory Appl."},{"key":"946_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2006.12.006","volume":"185","author":"M Patriksson","year":"2008","unstructured":"Patriksson, M.: A survey on the continuous nonlinear resource allocation problem. Eur. J. Oper. Res. 185, 1\u201346 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"946_CR19","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.ejor.2015.01.029","volume":"243","author":"M Patriksson","year":"2015","unstructured":"Patriksson, M., Str\u00f6mberg, C.: Algorithms for the continuous nonlinear resource allocation problem\u2014new implementations and numerical studies. Eur. J. Oper. Res. 243(3), 703\u2013722 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"946_CR20","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E Berg van den","year":"2008","unstructured":"van den Berg, E., Friedlander, M.P.: Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31, 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0946-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0946-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0946-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:08Z","timestamp":1559109608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0946-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,19]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["946"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0946-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,19]]}}}