{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T10:32:45Z","timestamp":1747996365947,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T00:00:00Z","timestamp":1662249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T00:00:00Z","timestamp":1662249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT","doi-asserted-by":"crossref","award":["2019R1A2C1007126"],"award-info":[{"award-number":["2019R1A2C1007126"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11590-022-01919-0","type":"journal-article","created":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T14:02:57Z","timestamp":1662300177000},"page":"1133-1159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A unified analysis of convex and non-convex $$\\ell _p$$-ball projection problems"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5597-9557","authenticated-orcid":false,"given":"Joong-Ho","family":"Won","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,4]]},"reference":[{"issue":"3","key":"1919_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A Argyriou","year":"2008","unstructured":"Argyriou, A., Evgeniou, T., Pontil, M.: Convex multi-task feature learning. Mach. Learn. 73(3), 243\u2013272 (2008)","journal-title":"Mach. Learn."},{"issue":"3","key":"1919_CR2","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.acha.2012.07.004","volume":"34","author":"S Bahmani","year":"2013","unstructured":"Bahmani, S., Raj, B.: A unifying analysis of projected gradient descent for $$\\ell _p$$-constrained least squares. Appl. Comput. Harmon. Anal. 34(3), 366\u2013378 (2013)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"1919_CR3","first-page":"2232","volume":"19","author":"A Barbero","year":"2018","unstructured":"Barbero, A., Sra, S.: Modular proximal optimization for multidimensional total-variation regularization. J. Mach. Learn. Res. 19(1), 2232\u20132313 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1919_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"1919_CR5","volume-title":"Nonlinear Programming","author":"D Bertsekas","year":"1999","unstructured":"Bertsekas, D.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont, Mass., USA (1999)","edition":"2"},{"issue":"2","key":"1919_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20(2), 221\u2013246 (1982)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"1919_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.acha.2009.04.002","volume":"27","author":"T Blumensath","year":"2009","unstructured":"Blumensath, T., Davies, M.E.: Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27(3), 265\u2013274 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1919_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge, UK (2004)"},{"issue":"12","key":"1919_CR9","doi-asserted-by":"publisher","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Candes","year":"2005","unstructured":"Candes, E.J., Tao, T.: Decoding by linear programming. IEEE Tran. Inform. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Tran. Inform. Theory"},{"issue":"3","key":"1919_CR10","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/24\/3\/035020","volume":"24","author":"R Chartrand","year":"2008","unstructured":"Chartrand, R., Staneva, V.: Restricted isometry properties and nonconvex compressive sensing. Inverse Prob. 24(3), 035020 (2008)","journal-title":"Inverse Prob."},{"key":"1919_CR11","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Nonconvex sparse regularization and splitting algorithms. In: Splitting Methods in Communication, Imaging, Science, and Engineering, pp. 237\u2013249. Springer (2016)","DOI":"10.1007\/978-3-319-41589-5_7"},{"key":"1919_CR12","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1109\/TETCI.2019.2935747","volume":"5","author":"L Chen","year":"2021","unstructured":"Chen, L., Jiang, X., Liu, X., Kirubarajan, T., Zhou, Z.: Outlier-robust moving object and background decomposition via structured $$\\ell _p$$-regularized low-rank representation. IEEE Trans. Emerg. Topics Comput. Intell. 5, 620\u2013638 (2021)","journal-title":"IEEE Trans. Emerg. Topics Comput. Intell."},{"issue":"3","key":"1919_CR13","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1137\/120871390","volume":"23","author":"X Chen","year":"2013","unstructured":"Chen, X., Niu, L., Yuan, Y.: Optimality conditions and a smoothing trust region newton method for nonlipschitz optimization. SIAM J. Optim. 23(3), 1528\u20131552 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1919_CR14","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. 158(1\u20132), 575\u2013585 (2016)","journal-title":"Math. Program."},{"key":"1919_CR15","doi-asserted-by":"crossref","unstructured":"Das\u00a0Gupta, M., Kumar, S.: Non-convex p-norm projection for robust sparsity. In: Proc. IEEE Int. Conf. Computer Vision, pp. 1593\u20131600 (2013)","DOI":"10.1109\/ICCV.2013.201"},{"issue":"4","key":"1919_CR16","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Tran. Inform. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Tran. Inform. Theory"},{"key":"1919_CR17","doi-asserted-by":"crossref","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Chandra, T.: Efficient projections onto the $$\\ell _1$$-ball for learning in high dimensions. In: Proc. 25th Int. Conf. Mach. Learn., pp. 272\u2013279. ACM (2008)","DOI":"10.1145\/1390156.1390191"},{"issue":"3","key":"1919_CR18","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10618600.1998.10474784","volume":"7","author":"WJ Fu","year":"1998","unstructured":"Fu, W.J.: Penalized regressions: the bridge versus the lasso. J. Comput. Graph. Stat. 7(3), 397\u2013416 (1998)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1","key":"1919_CR19","first-page":"960","volume":"18","author":"Y Hu","year":"2017","unstructured":"Hu, Y., Li, C., Meng, K., Qin, J., Yang, X.: Group sparse optimization via $$\\ell _{p, q}$$ regularization. J. Mach. Learn. Res. 18(1), 960\u20131011 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"1919_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974409","volume-title":"MM Optimization Algorithms","author":"K Lange","year":"2016","unstructured":"Lange, K.: MM Optimization Algorithms. SIAM, Philadelphia, PA, USA (2016)"},{"key":"1919_CR21","doi-asserted-by":"crossref","unstructured":"Liu, H., Palatucci, M., Zhang, J.: Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery. In: Proc. 26th Int. Conf. Mach. Learn., pp. 649\u2013656. ACM (2009)","DOI":"10.1145\/1553374.1553458"},{"key":"1919_CR22","unstructured":"Liu, J., Ji, S., Ye, J.: SLEP: Sparse learning with efficient projections. Tech. rep., Arizona State University (2011). https:\/\/github.com\/jiayuzhou\/SLEP"},{"key":"1919_CR23","unstructured":"Liu, J., Ye, J.: Efficient $$\\ell _1$$\/$$\\ell _q$$ norm regularization. arXiv:1009.4766 (2010)"},{"issue":"1","key":"1919_CR24","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-013-0722-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu, Z.: Iterative reweighted minimization methods for $$\\ell _p$$ regularized unconstrained nonlinear programming. Math. Program. 147(1), 277\u2013307 (2014)","journal-title":"Math. Program."},{"issue":"11","key":"1919_CR25","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1109\/TSP.2012.2212015","volume":"60","author":"G Marjanovic","year":"2012","unstructured":"Marjanovic, G., Solo, V.: On $$\\ell _q$$ optimization and matrix completion. IEEE Trans. Signal Process. 60(11), 5714\u20135724 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1919_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier, L., Van De Geer, S., B\u00fchlmann, P.: The group lasso for logistic regression. J. R. Stat. Soc. Ser. B. Stat. Methodol. 70(1), 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"issue":"6","key":"1919_CR27","doi-asserted-by":"publisher","first-page":"4129","DOI":"10.1109\/TIT.2017.2773497","volume":"64","author":"S Oymak","year":"2017","unstructured":"Oymak, S., Recht, B., Soltanolkotabi, M.: Sharp time-data tradeoffs for linear inverse problems. IEEE Tran. Inform. Theory 64(6), 4129\u20134158 (2017)","journal-title":"IEEE Tran. Inform. Theory"},{"key":"1919_CR28","doi-asserted-by":"crossref","unstructured":"Quattoni, A., Carreras, X., Collins, M., Darrell, T.: An efficient projection for $$\\ell _{1,\\infty }$$ regularization. In: Proc. 26th Int. Conf. Mach. Learn., pp. 857\u2013864. ACM (2009)","DOI":"10.1145\/1553374.1553484"},{"key":"1919_CR29","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TSP.2020.2964216","volume":"68","author":"Y Sattar","year":"2020","unstructured":"Sattar, Y., Oymak, S.: Quickly finding the best linear model in high dimensions via projected gradient descent. IEEE Trans. Signal Process 68, 818\u2013829 (2020)","journal-title":"IEEE Trans. Signal Process"},{"issue":"2","key":"1919_CR30","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s10618-012-0277-7","volume":"25","author":"S Sra","year":"2012","unstructured":"Sra, S.: Fast projections onto mixed-norm balls with applications. Data Min. Knowl. Discov. 25(2), 358\u2013377 (2012)","journal-title":"Data Min. Knowl. Discov."},{"key":"1919_CR31","volume-title":"Statistical Learning with Sparsity: the Lasso and Generalizations","author":"R Tibshirani","year":"2015","unstructured":"Tibshirani, R., Wainwright, M., Hastie, T.: Statistical Learning with Sparsity: the Lasso and Generalizations. Chapman and Hall\/CRC, Boca Raton (2015)"},{"key":"1919_CR32","unstructured":"Vogt, J.E., Roth, V.: A complete analysis of the $$\\ell _{1,p}$$ group-lasso. In: Proc. 29th Int. Conf. Mach. Learn., pp. 1091\u20131098. Omnipress (2012)"},{"issue":"11","key":"1919_CR33","doi-asserted-by":"publisher","first-page":"7255","DOI":"10.1109\/TIT.2011.2159959","volume":"57","author":"M Wang","year":"2011","unstructured":"Wang, M., Xu, W., Tang, A.: On the performance of sparse recovery via $$\\ell _p$$-minimization $$(0 \\le p \\le 1)$$. IEEE Tran. Inform. Theory 57(11), 7255\u20137278 (2011)","journal-title":"IEEE Tran. Inform. Theory"},{"issue":"7","key":"1919_CR34","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $${L}_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23(7), 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1919_CR35","unstructured":"Yang, X., Wang, J., Wang, H.: Towards an efficient approach for the nonconvex $$\\ell _p$$ ball projection: algorithm and analysis. arXiv:2101.01350 (2021)"},{"issue":"1","key":"1919_CR36","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B. Stat. Methodol. 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"key":"1919_CR37","doi-asserted-by":"crossref","unstructured":"Yukawa, M., Amari, S.i.: $$\\ell _p$$-regularized least squares $$(0< p< 1)$$ and critical path. IEEE Trans. Inform. Theory 62(1), 488\u2013502 (2016)","DOI":"10.1109\/TIT.2015.2501362"},{"key":"1919_CR38","unstructured":"Zhang, Y., Yeung, D.Y., Xu, Q.: Probabilistic multi-task feature selection. In: Adv. Neural Inf. Process. Syst., pp. 2559\u20132567 (2010)"},{"key":"1919_CR39","unstructured":"Zhou, Z., Zhang, Q., So, A.M.C.: $$\\ell _{1,p}$$-norm regularization: error bounds and convergence rate analysis of first-order methods. In: Proc. 32nd Int. Conf. Mach. Learn., vol.\u00a037, pp. 1501\u20131510 (2015)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01919-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01919-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01919-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T05:41:50Z","timestamp":1727934110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01919-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,4]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1919"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01919-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,9,4]]},"assertion":[{"value":"21 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}