{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T01:47:49Z","timestamp":1782092869702,"version":"3.54.5"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301398"],"award-info":[{"award-number":["12301398"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571326"],"award-info":[{"award-number":["12571326"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271278"],"award-info":[{"award-number":["12271278"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Key Project of PCL","award":["PCL2022A05"],"award-info":[{"award-number":["PCL2022A05"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10915-026-03307-7","type":"journal-article","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T14:49:32Z","timestamp":1778510972000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimization Over the $$\\ell _{p}$$ Ball Using A Hybrid First-Order Method"],"prefix":"10.1007","volume":"107","author":[{"given":"Xiangyu","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8821-7260","authenticated-orcid":false,"given":"Hao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yichen","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,11]]},"reference":[{"key":"3307_CR1","doi-asserted-by":"publisher","first-page":"26723","DOI":"10.52202\/068431-1938","volume":"35","author":"JH Alcantara","year":"2022","unstructured":"Alcantara, J.H., Lee, C.P.: Accelerated projected gradient algorithms for sparsity constrained optimization problems. Adv. Neural. Inf. Process. Syst. 35, 26723\u201326735 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"3","key":"3307_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":"3307_CR3","first-page":"807","volume":"14","author":"S Bahmani","year":"2013","unstructured":"Bahmani, S., Raj, B., Boufounos, P.T.: Greedy sparsity-constrained optimization. J. Mach. Learn. Res. 14(1), 807\u2013841 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"3307_CR4","doi-asserted-by":"crossref","unstructured":"Balda, E.R., Behboodi, A., Mathar, R.: Adversarial examples in deep neural networks: An overview. Deep Learning: Algorithms and Applications pp. 31\u201365 (2020)","DOI":"10.1007\/978-3-030-31760-7_2"},{"issue":"2","key":"3307_CR5","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1214\/15-AOS1388","volume":"44","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., King, A., Mazumder, R.: Best subset selection via a modern optimization lens. Ann. Stat. 44(2), 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"key":"3307_CR6","volume-title":"Introduction to linear optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to linear optimization, vol. 6. Athena Scientific Belmont, MA, Nashua, NH, USA (1997)"},{"issue":"3","key":"3307_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":"3307_CR8","doi-asserted-by":"crossref","unstructured":"Bolte, J., Combettes, C.W., Pauwels, E.: The iterates of the Frank\u2013Wolfe algorithm may not converge. Mathematics of Operations Research (2023)","DOI":"10.1287\/moor.2022.0057"},{"key":"3307_CR9","first-page":"16773","volume":"33","author":"D Boob","year":"2020","unstructured":"Boob, D., Deng, Q., Lan, G., Wang, Y.: A feasible level proximal point method for nonconvex sparse constrained optimization. Adv. Neural. Inf. Process. Syst. 33, 16773\u201316784 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"2","key":"3307_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"3307_CR11","unstructured":"Braun, G., Carderera, A., Combettes, C.W., Hassani, H., Karbasi, A., Mokhtari, A., Pokutta, S.: Conditional gradient methods. arXiv preprint arXiv:2211.14103 (2022)"},{"issue":"5","key":"3307_CR12","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J. Fourier Anal. Appl. 14(5), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"3307_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13634-016-0404-5","volume":"2016","author":"RE Carrillo","year":"2016","unstructured":"Carrillo, R.E., Ramirez, A.B., Arce, G.R., Barner, K.E., Sadler, B.M.: Robust compressive sensing of sparse signals: a review. EURASIP Journal on Advances in Signal Processing 2016, 1\u201317 (2016)","journal-title":"EURASIP Journal on Advances in Signal Processing"},{"key":"3307_CR14","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3869\u20133872. IEEE (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"issue":"3","key":"3307_CR15","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1137\/16M1062259","volume":"27","author":"T Chen","year":"2017","unstructured":"Chen, T., Curtis, F.E., Robinson, D.P.: A reduced-space algorithm for minimizing $$\\ell _1$$-regularized convex functions. SIAM J. Optim. 27(3), 1583\u20131610 (2017)","journal-title":"SIAM J. Optim."},{"key":"3307_CR16","unstructured":"Clarke, F.H.: Necessary conditions for nonsmooth problems in optimal control and the calculus of variations. PhD Thesis (1973)"},{"issue":"1","key":"3307_CR17","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), 575\u2013585 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"3307_CR18","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s10589-022-00407-6","volume":"83","author":"A Cristofari","year":"2022","unstructured":"Cristofari, A., De Santis, M., Lucidi, S., Rinaldi, F.: Minimization over the $$\\ell _1$$-ball using an active-set non-monotone projected gradient. Comput. Optim. Appl. 83(2), 693\u2013721 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"456","key":"3307_CR19","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1\u20132","key":"3307_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P., et al.: An algorithm for quadratic programming. Nav. Res. Logist. 3(1\u20132), 95\u2013110 (1956)","journal-title":"Nav. Res. Logist."},{"key":"3307_CR21","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.52202\/068431-0092","volume":"35","author":"J Gallego-Posada","year":"2022","unstructured":"Gallego-Posada, J., Ramirez, J., Erraqabi, A., Bengio, Y., Lacoste-Julien, S.: Controlled sparsity via constrained optimization or: How I learned to stop tuning penalties and love constraints. Adv. Neural. Inf. Process. Syst. 35, 1253\u20131266 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"issue":"5","key":"3307_CR22","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in Hilbert space. Bull. Am. Math. Soc. 70(5), 709\u2013710 (1964)","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"3307_CR23","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10915-021-01443-w","volume":"87","author":"W Guo","year":"2021","unstructured":"Guo, W., Lou, Y., Qin, J., Yan, M.: A novel regularization based on the error function for sparse recovery. J. Sci. Comput. 87(1), 31 (2021)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"3307_CR24","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":"3307_CR25","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In: International Conference on Machine Learning, pp. 427\u2013435. PMLR (2013)"},{"key":"3307_CR26","doi-asserted-by":"crossref","unstructured":"Jain, P., Kar, P., et\u00a0al.: Non-convex optimization for machine learning. Foundations and Trends\u00ae in Machine Learning 10(3-4), 142\u2013363 (2017)","DOI":"10.1561\/2200000058"},{"key":"3307_CR27","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. Journal of Machine Learning Research 11(2) (2010)"},{"key":"3307_CR28","unstructured":"Lacoste-Julien, S.: Convergence rate of Frank-Wolfe for non-convex objectives. arXiv preprint arXiv:1607.00345 (2016)"},{"key":"3307_CR29","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)"},{"issue":"5","key":"3307_CR30","doi-asserted-by":"publisher","first-page":"1324","DOI":"10.1049\/ipr2.12411","volume":"16","author":"Y Liu","year":"2022","unstructured":"Liu, Y., Zhu, Z., Zhang, B.: Improved iteratively reweighted least squares algorithms for sparse recovery problem. IET Image Proc. 16(5), 1324\u20131340 (2022)","journal-title":"IET Image Proc."},{"key":"3307_CR31","doi-asserted-by":"crossref","unstructured":"Lu, H., Freund, R.M.: Generalized stochastic Frank\u2013Wolfe algorithm with stochastic \u201csubstitute\u201d gradient for structured convex optimization. Mathematical Programming pp. 1\u201333 (2020)","DOI":"10.1007\/s10107-020-01480-7"},{"key":"3307_CR32","doi-asserted-by":"crossref","unstructured":"Mordukhovich, B.S., Nam, N.M.: An easy path to convex analysis and applications. Springer (2014)","DOI":"10.1007\/978-3-031-02406-1"},{"issue":"2","key":"3307_CR33","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"3307_CR34","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 Trans. Inf. Theory 64(6), 4129\u20134158 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3307_CR35","unstructured":"Pedregosa, F., Negiar, G., Askari, A., Jaggi, M.: Linearly convergent Frank-Wolfe with backtracking line-search. In: International Conference on Artificial Intelligence and Statistics, pp. 1\u201310. PMLR (2020)"},{"key":"3307_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103683","volume":"306","author":"G Perez","year":"2022","unstructured":"Perez, G., Ament, S., Gomes, C., Barlaud, M.: Efficient projection algorithms onto the weighted $$\\ell _1$$ ball. Artif. Intell. 306, 103683 (2022)","journal-title":"Artif. Intell."},{"key":"3307_CR37","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, vol. 317. Springer, Berlin, Heidelberg, Germany (2009)"},{"key":"3307_CR38","doi-asserted-by":"crossref","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso: a retrospective. Journal of the Royal Statistical Society. Series B (Statistical Methodology) 73(3), 273\u2013282 (2011)","DOI":"10.1111\/j.1467-9868.2011.00771.x"},{"issue":"3","key":"3307_CR39","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10898-021-01093-0","volume":"81","author":"H Wang","year":"2021","unstructured":"Wang, H., Zhang, F., Shi, Y., Hu, Y.: Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods. J. Global Optim. 81(3), 717\u2013748 (2021)","journal-title":"J. Global Optim."},{"issue":"7","key":"3307_CR40","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.: $$\\ell _{1\/2}$$ regularization: A thresholding representation theory and a fast solver. IEEE Transactions on Neural Networks and Learning Systems 23(7), 1013\u20131027 (2012)","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"101","key":"3307_CR41","first-page":"1","volume":"23","author":"X Yang","year":"2022","unstructured":"Yang, X., Wang, J., Wang, H.: Towards an efficient approach for the nonconvex $$\\ell _p$$ ball projection: algorithm and analysis. J. Mach. Learn. Res. 23(101), 1\u201331 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"3307_CR42","doi-asserted-by":"crossref","unstructured":"Zeng, L., Zhang, Y., Li, G., Pong, T.K., Wang, X.: Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems. Mathematical Programming pp. 1\u201345 (2024)","DOI":"10.1007\/s10107-023-02055-y"},{"issue":"2","key":"3307_CR43","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010a)","journal-title":"Ann. Stat."},{"issue":"10","key":"3307_CR44","doi-asserted-by":"publisher","first-page":"2339","DOI":"10.1080\/02331934.2019.1696338","volume":"69","author":"F Zhang","year":"2020","unstructured":"Zhang, F., Wang, H., Wang, J., Yang, K.: Inexact primal-dual gradient projection methods for nonlinear optimization on convex set. Optimization 69(10), 2339\u20132365 (2020)","journal-title":"Optimization"},{"issue":"7","key":"3307_CR45","doi-asserted-by":"publisher","first-page":"3142","DOI":"10.1109\/TIP.2017.2662206","volume":"26","author":"K Zhang","year":"2017","unstructured":"Zhang, K., Zuo, W., Chen, Y., Meng, D., Zhang, L.: Beyond a Gaussian denoiser: Residual learning of deep CNN for image denoising. IEEE Trans. Image Process. 26(7), 3142\u20133155 (2017)","journal-title":"IEEE Trans. Image Process."},{"key":"3307_CR46","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. Journal of Machine Learning Research 11(3) (2010)"},{"issue":"3","key":"3307_CR47","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1111\/rssb.12037","volume":"76","author":"Z Zheng","year":"2014","unstructured":"Zheng, Z., Fan, Y., Lv, J.: High dimensional thresholded regression and shrinkage effect. J. R. Stat. Soc. Ser. B Stat Methodol. 76(3), 627\u2013649 (2014)","journal-title":"J. R. Stat. Soc. Ser. B Stat Methodol."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03307-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-026-03307-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-026-03307-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T01:12:02Z","timestamp":1782090722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-026-03307-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,11]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3307"],"URL":"https:\/\/doi.org\/10.1007\/s10915-026-03307-7","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,11]]},"assertion":[{"value":"10 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"98"}}