{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:44:54Z","timestamp":1762508694399},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T00:00:00Z","timestamp":1641945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10898-021-01124-w","type":"journal-article","created":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:02:36Z","timestamp":1641949356000},"page":"347-371","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Solution sets of three sparse optimization problems for multivariate regression"],"prefix":"10.1007","volume":"87","author":[{"given":"Xiaojun","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lili","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naihua","family":"Xiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,12]]},"reference":[{"key":"1124_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10208-013-9161-0","volume":"14","author":"HH Bauschke","year":"2014","unstructured":"Bauschke, H.H., Luke, D.R., Phan, H.M., Wang, X.: Restricted normal cones and sparsity optimization with affine constraints. Found. Comput. Math. 14, 63\u201383 (2014)","journal-title":"Found. Comput. Math."},{"key":"1124_CR2","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Eldar, Y.C.: Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM J. Optim. 23, 1480\u20131509 (2013)","journal-title":"SIAM J. Optim."},{"key":"1124_CR3","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/moor.2015.0722","volume":"41","author":"A Beck","year":"2015","unstructured":"Beck, A., Hallak, N.: On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms. Math. Oper. Res. 41, 196\u2013223 (2015)","journal-title":"Math. Oper. Res."},{"key":"1124_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1023\/A:1014813701864","volume":"22","author":"EG Belousov","year":"2002","unstructured":"Belousov, E.G., Klatte, D.: A Frank-Wolfe type theorem for convex polynomial programs. Comput. Optim. Appl. 22, 37\u201348 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"1124_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, 813\u2013852 (2016)","journal-title":"Ann. Stat."},{"key":"1124_CR6","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, 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"1124_CR7","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian, W., Chen, X.: A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J. Numer. Anal. 58, 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"key":"1124_CR8","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1016\/j.acha.2019.04.003","volume":"48","author":"JD Blanchard","year":"2020","unstructured":"Blanchard, J.D., Leedy, C., Wu, Y.: On rank awareness, thresholding, and MUSIC for joint sparse recovery. Appl. Comput. Harmon. Anal. 48, 482\u2013495 (2020)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1124_CR9","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1137\/15M1028054","volume":"26","author":"X Chen","year":"2016","unstructured":"Chen, X., Lu, Z., Pong, T.K.: Penalty methods for a class of non-Lipschitz optimization problems. SIAM J. Optim. 26, 1465\u20131492 (2016)","journal-title":"SIAM J. Optim."},{"key":"1124_CR10","doi-asserted-by":"publisher","first-page":"4634","DOI":"10.1109\/TSP.2006.881263","volume":"54","author":"J Chen","year":"2006","unstructured":"Chen, J., Huo, X.: Theoretical results on sparse representations of multiple-measurement vectors. IEEE Trans. Signal Process. 54, 4634\u20134643 (2006)","journal-title":"IEEE Trans. Signal Process."},{"key":"1124_CR11","doi-asserted-by":"crossref","unstructured":"Elhamifar, E., Sapiro, G., Vidal, R.: See all by looking at a few: Sparse modeling for finding representative objects. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, pp. 1600\u20131607 (2012)","DOI":"10.1109\/CVPR.2012.6247852"},{"key":"1124_CR12","doi-asserted-by":"publisher","first-page":"3239","DOI":"10.1109\/TIP.2012.2190081","volume":"21","author":"E Esser","year":"2012","unstructured":"Esser, E., Moller, M., Osher, S., Sapiro, G., Xin, J.: A convex model for nonnegative matrix factorization and dimensionality reduction on physical space. IEEE Trans. Image Process. 21, 3239\u20133252 (2012)","journal-title":"IEEE Trans. Image Process."},{"key":"1124_CR13","first-page":"7","volume":"25","author":"N Gillis","year":"2017","unstructured":"Gillis, N.: Introduction to nonnegative matrix factorization. SIAG-OPT Views News 25, 7\u201316 (2017)","journal-title":"SIAG-OPT Views News"},{"key":"1124_CR14","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.acha.2014.10.001","volume":"39","author":"Y Jiao","year":"2015","unstructured":"Jiao, Y., Jin, B., Lu, X.: A primal dual active set with continuation algorithm for the $$l_0$$-regularized optimization problem. Appl. Comput. Harmon. Anal. 39, 400\u2013426 (2015)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1124_CR15","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1109\/TSP.2016.2630028","volume":"65","author":"Y Jiao","year":"2017","unstructured":"Jiao, Y., Jin, B., Lu, X.: Group sparse recovery via the $$l_0(l_2)$$ penalty: theory and algorithm. IEEE Trans. Signal Process. 65, 998\u20131012 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"1124_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10107-016-0986-6","volume":"160","author":"M \u010cervinka","year":"2016","unstructured":"\u010cervinka, M., Kanzow, C., Schwartz, A.: Constraint qualifications and optimality conditions for optimization problems with cardinality constraints. Math. Program. 160, 353\u2013377 (2016)","journal-title":"Math. Program."},{"key":"1124_CR17","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s11590-012-0456-x","volume":"7","author":"HY Le","year":"2013","unstructured":"Le, H.Y.: Generalized subdifferentials of the rank function. Optim. Lett. 7, 731\u2013743 (2013)","journal-title":"Optim. Lett."},{"key":"1124_CR18","doi-asserted-by":"publisher","first-page":"3613","DOI":"10.1109\/TIT.2012.2189196","volume":"58","author":"K Lee","year":"2012","unstructured":"Lee, K., Bresler, Y., Junge, M.: Subspace methods for joint sparse recovery. IEEE Trans. Inform. Theory. 58, 3613\u20133641 (2012)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"1124_CR19","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23, 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"key":"1124_CR20","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1109\/TIM.2016.2615449","volume":"66","author":"PR Muduli","year":"2017","unstructured":"Muduli, P.R., Mukherjee, A.: A subspace projection-based joint sparse recovery method for structured biomedical signals. IEEE Trans. Instrum. Measur. 66, 234\u2013242 (2017)","journal-title":"IEEE Trans. Instrum. Measur."},{"key":"1124_CR21","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, 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"key":"1124_CR22","unstructured":"Nguyen, N.\u00a0H., Nasrabadi, N.\u00a0M., Tran, T.\u00a0D.: Robust multi-sensor classification via joint sparse representation. In: 2011 Proceedings of the 14th International Conference on Information Fusion (FUSION), IEEE, pp. 1\u20138 (2011)"},{"key":"1124_CR23","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/11085476X","volume":"6","author":"M Nikolova","year":"2013","unstructured":"Nikolova, M.: Description of the minimizers of least squares regularized with $$\\ell _0 $$-norm: uniqueness of the global minimizer. SIAM J. Imaging Sci. 6, 904\u2013937 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"1124_CR24","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.acha.2015.10.010","volume":"41","author":"M Nikolova","year":"2016","unstructured":"Nikolova, M.: Relationship between the optimal solutions of least squares regularized with $$l_0$$-norm and constrained by $$k$$-sparsity. Appl. Comput. Harmon. Anal. 41, 237\u2013265 (2016)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1124_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s11222-008-9111-x","volume":"20","author":"G Obozinski","year":"2010","unstructured":"Obozinski, G., Taskar, B., Jordan, M.I.: Joint covariate selection and joint subspace selection for multiple classification problems. Stat. Comput. 20, 231\u2013252 (2010)","journal-title":"Stat. Comput."},{"key":"1124_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/09-AOS776","volume":"39","author":"G Obozinski","year":"2011","unstructured":"Obozinski, G., Wainwright, M.J., Jordan, M.I.: Support union recovery in high-dimensional multivariate regression. Ann. Stat. 39, 1\u201347 (2011)","journal-title":"Ann. Stat."},{"key":"1124_CR27","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s11425-016-9010-x","volume":"60","author":"L Pan","year":"2017","unstructured":"Pan, L., Xiu, N., Fan, J.: Optimality conditions for sparse nonlinear programming. Sci. China Math. 60, 759\u2013776 (2017)","journal-title":"Sci. China Math."},{"key":"1124_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/19M1304799","volume":"14","author":"L Pan","year":"2021","unstructured":"Pan, L., Chen, X.: Group sparse optimization for image recovery using capped folded convace functions. SIAM J. Imaging Sci. 14, 1\u201325 (2021)","journal-title":"SIAM J. Imaging Sci."},{"key":"1124_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.: Variational Analysis. Springer, Berlin (1998)"},{"key":"1124_CR30","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"2015","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (2015)"},{"key":"1124_CR31","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.acha.2016.10.001","volume":"43","author":"S Satpathi","year":"2017","unstructured":"Satpathi, S., Chakraborty, M.: On the number of iterations for convergence of CoSaMP and Subspace Pursuit algorithms. Appl. Comput. Harmon. Anal. 43, 568\u2013576 (2017)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1124_CR32","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.acha.2015.03.001","volume":"41","author":"L Shen","year":"2016","unstructured":"Shen, L., Xu, Y., Zheng, X.: Wavelet inpainting with the $$\\ell _0$$ sparse regularization. Appl. Comput. Harmon. Anal. 41, 26\u201353 (2016)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1124_CR33","doi-asserted-by":"crossref","unstructured":"Seneviratne, A.J., Solo, V.: On vector $$l_0$$ penalized multivariate regression. In: Proceedings International Conference on Acoustics Speech Signal Process. (ICASSP), IEEE, pp. 3613\u20133616 (2012)","DOI":"10.1109\/ICASSP.2012.6288698"},{"key":"1124_CR34","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.sigpro.2005.05.031","volume":"86","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A.: Algorithms for simultaneous sparse approximation, Part II: convex relaxation. Signal Process. 86, 589\u2013602 (2006)","journal-title":"Signal Process."},{"issue":"3","key":"1124_CR35","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.sigpro.2005.05.030","volume":"86","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A., Gilbert, A.C., Strauss, M.J.: Algorithms for simultaneous sparse approximation. Part I: greedy pursuit. Signal Process. 86(3), 572\u2013588 (2006)","journal-title":"Signal Process."},{"key":"1124_CR36","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1016\/j.acha.2018.02.002","volume":"47","author":"J Wen","year":"2019","unstructured":"Wen, J., Zhou, Z., Liu, Z., Lai, M., Tang, X.: Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit. Appl. Comput. Harmon. Anal. 47, 948\u2013974 (2019)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1124_CR37","doi-asserted-by":"publisher","first-page":"4349","DOI":"10.1109\/TIP.2012.2205006","volume":"21","author":"X Yuan","year":"2012","unstructured":"Yuan, X., Liu, X., Yan, S.: Visual classification with multitask joint sparse representation. IEEE Trans. Image Process. 21, 4349\u20134360 (2012)","journal-title":"IEEE Trans. Image Process."},{"key":"1124_CR38","doi-asserted-by":"publisher","first-page":"025010","DOI":"10.1088\/1361-6420\/33\/2\/025010","volume":"33","author":"N Zhang","year":"2017","unstructured":"Zhang, N., Li, Q.: On optimal solutions of the constrained $$l_0$$ regularization and its penalty problem. Inverse Probl. 33, 025010 (2017)","journal-title":"Inverse Probl."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01124-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01124-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01124-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T23:52:31Z","timestamp":1698796351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01124-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,12]]},"references-count":38,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1124"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01124-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,12]]},"assertion":[{"value":"17 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}