{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:42:23Z","timestamp":1740181343145,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T00:00:00Z","timestamp":1696636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T00:00:00Z","timestamp":1696636800000},"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":["CCF Trans. HPC"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s42514-023-00164-w","type":"journal-article","created":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T14:01:40Z","timestamp":1696687300000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["BSPADMM: block splitting proximal ADMM for sparse representation with strong scalability"],"prefix":"10.1007","volume":"6","author":[{"given":"Yidong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingshan","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zidong","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonghong","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1554-8429","authenticated-orcid":false,"given":"Zhonghua","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Noise modeling and representation based classification methods for face recognition. Neurocomputing. 148 , 420\u2013429 (2015)","key":"164_CR1","DOI":"10.1016\/j.neucom.2014.07.058"},{"doi-asserted-by":"crossref","unstructured":"Edoardo Amaldi, A., Viggo Kann, B.: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoretical Computer Science. 209(1\u20132), 237\u2013260 (1998)","key":"164_CR2","DOI":"10.1016\/S0304-3975(97)00115-1"},{"doi-asserted-by":"crossref","unstructured":"Bao, C., Ji, H., Quan, Y., Shen, Z.: L0 Norm based dictionary learning by proximal methods with global convergence. In 2014 IEEE Conference on Computer Vision and Pattern Recognition. pp. 3858\u20133865 (2014)","key":"164_CR3","DOI":"10.1109\/CVPR.2014.493"},{"doi-asserted-by":"crossref","unstructured":"Bao, C., Wu, Y., Ling, H., Ji, H.: Real time robust L1 tracker using accelerated proximal gradient approach. In 2012 IEEE Conference on Computer Vision and Pattern Recognition. pp. 1830\u20131837 (2012)","key":"164_CR4","DOI":"10.1109\/CVPR.2012.6247881"},{"doi-asserted-by":"crossref","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and trends in machine learning. 3, (1): 1\u2013122 (2011)","key":"164_CR5","DOI":"10.1561\/2200000016"},{"issue":"1","key":"164_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10589-016-9860-y","volume":"66","author":"Xingju Cai","year":"2017","unstructured":"Cai, Xingju, Han, Deren, Yuan, Xiaoming: On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function. Comput Optim Appl. 66(1), 39\u201373 (2017)","journal-title":"Comput Optim Appl."},{"unstructured":"NVIDIA Corporation. NVIDAM CuSolver. NVIDIA. https:\/\/developer.nvidia.com\/cusolver (2015)","key":"164_CR7"},{"issue":"3","key":"164_CR8","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1093\/imanum\/drl006","volume":"26","author":"Y-H Dai","year":"2006","unstructured":"Dai, Y.-H., Hager, W.W., Schittkowski, K., Zhang, H.: The cyclic Barzilai-C\u0308Borwein method for unconstrained optimization. IMA J. Numer. Anal. 26(3), 604\u2013627 (2006)","journal-title":"IMA J. Numer. Anal."},{"issue":"2017","key":"164_CR9","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"Damek Davis","year":"2017","unstructured":"Davis, Damek: A three-operator splitting scheme and its optimization applications. Set-Valued Var Anal 25(2017), 829\u2013858 (2017)","journal-title":"Set-Valued Var Anal"},{"key":"164_CR10","doi-asserted-by":"publisher","first-page":"120694","DOI":"10.1109\/ACCESS.2020.3006500","volume":"8","author":"X Deng","year":"2020","unstructured":"Deng, X., Liu, F., Huang, F.: Linear convergence rate of splitting algorithms for multi-block constrained convex minimizations. IEEE Access. 8, 120694\u2013120700 (2020)","journal-title":"IEEE Access."},{"doi-asserted-by":"crossref","unstructured":"For most large underdetermined systems of linear equations the minimal $$l_{1}$$-norm solution is also the sparsest solution. Commun Pure Appl Math. 59(6), 797\u2013829 (2006)","key":"164_CR11","DOI":"10.1002\/cpa.20132"},{"doi-asserted-by":"crossref","unstructured":"Donoho, D.L., Tsaig, Y.: Fast solution of $$\\ell _{1}$$ -norm minimization problems when the solution may be sparse. IEEE Trans Inf Theory. 54(11), 4789\u20134812 (2008)","key":"164_CR12","DOI":"10.1109\/TIT.2008.929958"},{"doi-asserted-by":"crossref","unstructured":"Elgabli, A., Elghariani, A., Aggarwal, V., Bennis, M., Bell, M.: A proximal Jacobian ADMM approach for fast massive MIMO signal detection in low-latency communications. IEEE. pp. 1\u20136 (2019)","key":"164_CR13","DOI":"10.1109\/ICC.2019.8761844"},{"issue":"12","key":"164_CR14","doi-asserted-by":"publisher","first-page":"2379","DOI":"10.1364\/JOSAA.4.002379","volume":"4","author":"JD Field","year":"1987","unstructured":"Field, J.D.: Relations between the statistics of natural images and the response properties of cortical cells. J Opt Soc Am A-Opt Image Sci Vis. 4(12), 2379\u20132394 (1987)","journal-title":"J Opt Soc Am A-Opt Image Sci Vis."},{"unstructured":"Gropp, W., Smith, B., McInnes, L.C.: PETSC 2.0. Portable Extensible Toolkit for Scientific Computation. United States (1995)","key":"164_CR15"},{"issue":"1","key":"164_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10957-012-0003-z","volume":"155","author":"D Han","year":"2012","unstructured":"Han, D., Yuan, X.: A note on the alternating direction method of multipliers. J Optim Theory Appl. 155(1), 227\u2013238 (2012)","journal-title":"J Optim Theory Appl."},{"doi-asserted-by":"crossref","unstructured":"He, B., Yuan, X..: On non-ergodic convergence rate of Douglas\u2014Rachford alternating direction method of multipliers. Numer. Math. 130, (3): 567C\u0308577 (2015)","key":"164_CR17","DOI":"10.1007\/s00211-014-0673-6"},{"doi-asserted-by":"crossref","unstructured":"Hong, M., Luo, Z-Q.: On the linear convergence of the alternating direction method of multipliers. Math. Program. 162, 1C\u03082 (2017), 165C\u0308199 (2017)","key":"164_CR18","DOI":"10.1007\/s10107-016-1034-2"},{"issue":"2","key":"164_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.scib.2020.06.025","volume":"66","author":"W Hu","year":"2021","unstructured":"Hu, W., Qin, X., Jiang, Q., Chen, J., An, H., Jia, W., Yang, C., Wang, L., Yang, C., Lin, L.: High performance computing of DGDFT for tens of thousands of atoms using millions of cores on Sunway TaihuLight. Sci Bull. 66(2), 111\u2013119 (2021)","journal-title":"Sci Bull."},{"doi-asserted-by":"crossref","unstructured":"Huang, K., Aviyente, S.: Sparse Representation for signal classification. In Proceedings of the 19th International Conference on Neural Information Processing Systems (Canada) (NIPS\u201906). MIT Press, Cambridge. pp. 609C\u0308616 (2006)","key":"164_CR20","DOI":"10.7551\/mitpress\/7503.003.0081"},{"issue":"3","key":"164_CR21","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1113\/jphysiol.1959.sp006308","volume":"148","author":"DH Hubel","year":"1959","unstructured":"Hubel, D.H., Wiesel, T.N.: Receptive fields of single neurones in the cat\u2019s striate cortex. J Physiol. 148(3), 574\u2013591 (1959)","journal-title":"J Physiol."},{"unstructured":"Jenatton, R., Mairal, J., Obozinski, G., Bach, F..: Proximal methods for sparse hierarchical dictionary learning. Proceedings of the International Conference on Machine Learning (ICML). pp. 487\u2013494 (2010)","key":"164_CR22"},{"issue":"2017","key":"164_CR23","first-page":"342","volume":"309","author":"JW Jin","year":"2017","unstructured":"Jin, J.W., Wen, S.: An algorithm twisted from generalized ADMM for multi-block separable convex minimization models. J. Comput. Appl. Math. 309(2017), 342\u2013358 (2017)","journal-title":"J. Comput. Appl. Math."},{"unstructured":"Krause, A., Cevher, V..: Submodular dictionary selection for sparse representation. In Proceedings of the 27th International Conference on International Conference on Machine Learning (Haifa, Israel) (ICML\u201910). Omnipress, Madison. pp. 567C\u0308574. 9781605589077 (2010)","key":"164_CR24"},{"unstructured":"LAPACK.: LAPACK linear system solver. LAPACK. https:\/\/netlib.org\/lapack\/ (2000)","key":"164_CR25"},{"unstructured":"Lazebnik, S., Schmid, C., Ponce, J.: A sparse texture representation using affine-invariant regions. In 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. 2, 109\u2013123 (2003)","key":"164_CR26"},{"key":"164_CR27","doi-asserted-by":"publisher","first-page":"1550024","DOI":"10.1142\/S0217595915500244","volume":"32","author":"M Li","year":"2015","unstructured":"Li, M., Sun, D., Toh, K.-C.: A Convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block. Asia-Pacific J Operat Res. 32, 1550024 (2015)","journal-title":"Asia-Pacific J Operat Res."},{"issue":"3","key":"164_CR28","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1137\/140971178","volume":"25","author":"T Lin","year":"2015","unstructured":"Lin, T., Ma, S., Zhang, S.: On the global linear convergence of the ADMM with multiblock variables. SIAM J Optim. 25(3), 1478\u20131497 (2015)","journal-title":"SIAM J Optim."},{"issue":"1","key":"164_CR29","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s10915-016-0182-0","volume":"69","author":"T Lin","year":"2016","unstructured":"Lin, T., Ma, S., Zhang, S.: Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity. J Sci Comput. 69(1), 52\u201381 (2016)","journal-title":"J Sci Comput."},{"doi-asserted-by":"crossref","unstructured":"Lin, T., Ma, S., Zhang, S.: Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity. J. Sci. Comput. 69(1): 52C\u030881 (2016b)","key":"164_CR30","DOI":"10.1007\/s10915-016-0182-0"},{"issue":"4","key":"164_CR31","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/LSP.2013.2245893","volume":"20","author":"H Liu","year":"2013","unstructured":"Liu, H., Song, B., Qin, H., Qiu, Z.: An adaptive-ADMM algorithm with support and signal value detection for compressed sensing. IEEE Signal Process Lett. 20(4), 315\u2013318 (2013). https:\/\/doi.org\/10.1109\/LSP.2013.2245893","journal-title":"IEEE Signal Process Lett."},{"doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Excessive gap technique in nonsmooth convex minimization. SIAM J. Optim. 16(1): 235C\u0308249. 1052-6234 (2005)","key":"164_CR32","DOI":"10.1137\/S1052623403422285"},{"doi-asserted-by":"crossref","unstructured":"Patel, VM., Chellappa, R.: Sparse representations, compressive sensing and dictionaries for pattern recognition. In The First Asian Conference on Pattern Recognition. pp. 325\u2013329 (2011)","key":"164_CR33","DOI":"10.1109\/ACPR.2011.6166711"},{"issue":"7","key":"164_CR34","doi-asserted-by":"publisher","first-page":"3408","DOI":"10.1109\/TIP.2019.2896541","volume":"28","author":"G-J Peng","year":"2019","unstructured":"Peng, G.-J.: Adaptive ADMM for dictionary learning in convolutional sparse representation. IEEE Trans Image Process. 28(7), 3408\u20133422 (2019). https:\/\/doi.org\/10.1109\/TIP.2019.2896541","journal-title":"IEEE Trans Image Process."},{"doi-asserted-by":"crossref","unstructured":"Plumbley, MD.: Recovery of sparse representations by polytope faces Pursuit. In Proceedings of the 6th International Conference on Independent Component Analysis and Blind Signal Separation (Charleston, SC) (ICA\u201906). Springer-Verlag, Berlin, Heidelberg. pp. 206C\u0308213. 3540326308 (2006)","key":"164_CR35","DOI":"10.1007\/11679363_26"},{"issue":"2021","key":"164_CR36","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.apnum.2020.09.016","volume":"160","author":"Y Shen","year":"2021","unstructured":"Shen, Y., Zuo, Y., Yu, A.: A partially proximal S-ADMM for separable convex optimization with linear constraints. Appl. Numer. Math. 160(2021), 65\u201383 (2021)","journal-title":"Appl. Numer. Math."},{"issue":"1","key":"164_CR37","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.csda.2008.06.022","volume":"53","author":"Z Shurong","year":"2008","unstructured":"Shurong, Z.: Selection of components and degrees of smoothing via lasso in high dimensional nonparametric additive models. Comput Stat Data Anal 53(1), 164\u2013175 (2008)","journal-title":"Comput Stat Data Anal"},{"doi-asserted-by":"crossref","unstructured":"Sun, H, Wang, J, Deng, T: On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models. J Inequal Appli. pp. 1\u201314 (2016)","key":"164_CR38","DOI":"10.1186\/s13660-016-1173-2"},{"key":"164_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.2019.0990","volume":"45","author":"R Sun","year":"2020","unstructured":"Sun, R., Luo, Z.-Q., Ye, Y.: On the efficiency of random permutation for ADMM and coordinate descent. Math Operat Res. 45, 1\u201314 (2020)","journal-title":"Math Operat Res."},{"issue":"3","key":"164_CR40","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.1467-9868.2011.00771.x","volume":"73","author":"R Tibshirani","year":"2011","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso: a retrospective. J R Stat Soc: Series B (Stat Methodol). 73(3), 267\u2013288 (2011)","journal-title":"J R Stat Soc: Series B (Stat Methodol)."},{"issue":"10","key":"164_CR41","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"JA Tropp","year":"2004","unstructured":"Tropp, J.A.: Greed is good: algorithmic results for sparse approximation. IEEE Trans Inf Theory 50(10), 2231\u20132242 (2004)","journal-title":"IEEE Trans Inf Theory"},{"doi-asserted-by":"crossref","unstructured":"Wang, J., Yang, J., Yu, K., Lv, F., Huang, T., Gong, Y.: Locality-constrained linear coding for image classification. In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. pp. 3360\u20133367. (2010) https:\/\/doi.org\/10.1109\/CVPR.2010.5540018","key":"164_CR42","DOI":"10.1109\/CVPR.2010.5540018"},{"doi-asserted-by":"crossref","unstructured":"Wright, SJ., Nowak, RD., Figueiredo, MAT.: Sparse reconstruction by separable approximation. Trans. Sig. Proc. 57(7): 2479C\u03082493 (2009)","key":"164_CR43","DOI":"10.1109\/TSP.2009.2016892"},{"doi-asserted-by":"crossref","unstructured":"Xu, Z., Figueiredo, MT., Yuan, X., Studer, C., Goldstein, T.: Adaptive relaxed ADMM: convergence theory and practical implementation. In 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). pp. 7234\u20137243 (2017)","key":"164_CR44","DOI":"10.1109\/CVPR.2017.765"},{"key":"164_CR45","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/TPAMI.2008.79","volume":"31","author":"AY Yang","year":"2009","unstructured":"Yang, A.Y., Ma, Y., Wright, J., Ganesh, A., Sastry, S.: Robust face recognition via sparse representation. IEEE Trans Pattern Anal Mach Intell. 31, 210\u2013227 (2009)","journal-title":"IEEE Trans Pattern Anal Mach Intell."},{"doi-asserted-by":"crossref","unstructured":"Yang, J., Wright, J., Huang, T., Ma, Y.: Image super-resolution as sparse representation of raw image patches. In 2008 IEEE Conference on Computer Vision and Pattern Recognition. pp. 1\u20138 (2008)","key":"164_CR46","DOI":"10.1109\/CVPR.2008.4587647"},{"key":"164_CR47","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1109\/ACCESS.2015.2430359","volume":"3","author":"Z Zhang","year":"2015","unstructured":"Zhang, Z., Xu, Y., Yang, J., Li, X., Zhang, D.: A survey of sparse representation: algorithms and applications. IEEE Access. 3, 490\u2013530 (2015). https:\/\/doi.org\/10.1109\/ACCESS.2015.2430359","journal-title":"IEEE Access."}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-023-00164-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-023-00164-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-023-00164-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:16:41Z","timestamp":1730279801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-023-00164-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,7]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["164"],"URL":"https:\/\/doi.org\/10.1007\/s42514-023-00164-w","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"type":"print","value":"2524-4922"},{"type":"electronic","value":"2524-4930"}],"subject":[],"published":{"date-parts":[[2023,10,7]]},"assertion":[{"value":"11 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declared that they have no conflicts of interest to this work. We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}