{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T07:06:52Z","timestamp":1769843212722,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:00Z","timestamp":1557878400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:00Z","timestamp":1557878400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10107-019-01401-3","type":"journal-article","created":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:30:59Z","timestamp":1557959459000},"page":"445-464","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A filtered bucket-clustering method for projection onto the simplex and the $$\\ell _1$$ ball"],"prefix":"10.1007","volume":"182","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6473-583X","authenticated-orcid":false,"given":"Guillaume","family":"Perez","sequence":"first","affiliation":[]},{"given":"Michel","family":"Barlaud","sequence":"additional","affiliation":[]},{"given":"Lionel","family":"Fillatre","sequence":"additional","affiliation":[]},{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,15]]},"reference":[{"issue":"17","key":"1401_CR1","doi-asserted-by":"publisher","first-page":"4635","DOI":"10.1109\/TSP.2017.2709262","volume":"65","author":"M Barlaud","year":"2017","unstructured":"Barlaud, M., Belhajali, W., Combettes, P.L., Fillatre, L.: Classification and regression using an outer approximation projection-gradient method. IEEE Trans. Signal Process. 65(17), 4635\u20134644 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"12","key":"1401_CR2","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1401_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0946-6","volume":"158","author":"L Condat","year":"2016","unstructured":"Condat, L.: Fast projection onto the simplex and the $$\\ell _1$$ ball. Math. Program. Ser. A 158(1), 575\u2013585 (2016)","journal-title":"Math. Program. Ser. A"},{"key":"1401_CR4","volume-title":"Introduction to Algorithms.","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms., vol. 6. MIT Press, Cambridge (2001)"},{"issue":"3","key":"1401_CR5","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/18.382009","volume":"41","author":"DL Donoho","year":"1995","unstructured":"Donoho, D.L.: De-noising by soft-thresholding. IEEE Trans. Inf. Theory 41(3), 613\u2013627 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1401_CR6","doi-asserted-by":"publisher","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"DL Donoho","year":"2003","unstructured":"Donoho, D.L., Elad, M.: Optimally sparse representation in general (nonorthogonal) dictionaries via $$\\ell _1$$ minimization. Proc. Natl. Acad. Sci. 100(5), 2197\u20132202 (2003)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1401_CR7","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the $$\\ell _1$$-ball for learning in high dimensions. In: Proceedings of the 25th International Conference on Machine Learning. ACM (2008), pp. 272\u2013279"},{"issue":"1","key":"1401_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M Held","year":"1974","unstructured":"Held, M., Wolfe, P., Crowder, H.P.: Validation of subgradient optimization. Math. Program. 6(1), 62\u201388 (1974)","journal-title":"Math. Program."},{"issue":"2","key":"1401_CR9","doi-asserted-by":"publisher","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. 112(2), 473\u2013491 (2008)","journal-title":"Math. Program."},{"issue":"1","key":"1401_CR10","doi-asserted-by":"publisher","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$$. J. Optim. Theory Appl. 50(1), 195\u2013200 (1986)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1401_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"B Natarajan","year":"1995","unstructured":"Natarajan, B.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"1401_CR12","unstructured":"Perez, G., Barlaud, M., Fillatre, l., R\u00e9gin, J.-C.: A filtered bucket-clustering method for Projection onto the Simplex and the $$\\ell _1$$ ball. In: XXVI\u00e8me Colloque Gretsi, Juan-Les-Pins (2017)"},{"key":"1401_CR13","doi-asserted-by":"crossref","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 267\u2013288 (1996)","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"1401_CR14","doi-asserted-by":"crossref","unstructured":"Tibshirani, R.: The lasso method for variable selection in the COX model. Stat. Med. (1997)","DOI":"10.1002\/(SICI)1097-0258(19970228)16:4<385::AID-SIM380>3.0.CO;2-3"},{"issue":"2","key":"1401_CR15","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E Van Den Berg","year":"2008","unstructured":"Van Den Berg, E., Friedlander, M.P.: Probing the pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31(2), 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-019-01401-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01401-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01401-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T15:16:29Z","timestamp":1592925389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01401-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,15]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["1401"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01401-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,15]]},"assertion":[{"value":"30 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}