{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T18:31:41Z","timestamp":1779388301828,"version":"3.53.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"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":["12301397"],"award-info":[{"award-number":["12301397"]}],"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":["12271127"],"award-info":[{"award-number":["12271127"]}],"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":["62176073"],"award-info":[{"award-number":["62176073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2022FRFK0600XX"],"award-info":[{"award-number":["2022FRFK0600XX"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["MOE-2019-T3-1-010"],"award-info":[{"award-number":["MOE-2019-T3-1-010"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2023M730876"],"award-info":[{"award-number":["2023M730876"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10107-024-02103-1","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T07:02:14Z","timestamp":1719990134000},"page":"273-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models"],"prefix":"10.1007","volume":"212","author":[{"given":"Wenjing","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4252-047X","authenticated-orcid":false,"given":"Wei","family":"Bian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"issue":"2","key":"2103_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TBDATA.2016.2541167","volume":"2","author":"JD West","year":"2016","unstructured":"West, J.D., Wesley-Smith, I., Bergstrom, C.T.: A recommendation system based on hierarchical clustering of an article-level citation network. IEEE Trans. Big Data 2(2), 113\u2013123 (2016)","journal-title":"IEEE Trans. Big Data"},{"key":"2103_CR2","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/090755436","volume":"31","author":"Z Liu","year":"2009","unstructured":"Liu, Z., Vandenberghe, L.: Interior-point method for nuclear norm approximation with application to system identification. SIAM J. Matrix Anal. Appl. 31, 1235\u20131256 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2103_CR3","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1109\/TIP.2015.2503238","volume":"25","author":"Q Liu","year":"2016","unstructured":"Liu, Q., Lai, Z., Zhou, Z., Kuang, F., Jin, Z.: A truncated nuclear norm regularization method based on weighted residual error for matrix completion. IEEE Trans. Image Process. 25(1), 316\u2013330 (2016)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"2103_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/TPAMI.2014.2343234","volume":"37","author":"R Cabral","year":"2015","unstructured":"Cabral, R., Torre, F.D., Costeira, J.P., Bernardino, A.: Matrix completion for weakly-supervised multi-label image classification. IEEE Trans. Pattern Anal. Mach. Intell. 37(1), 121\u2013135 (2015)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"2103_CR5","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/TNNLS.2019.2909686","volume":"31","author":"J Fan","year":"2020","unstructured":"Fan, J., Chow, T.W.S.: Exactly robust kernel principal component analysis. IEEE Trans. Neural Netw. Learn. Syst. 31(3), 749\u2013761 (2020)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"1","key":"2103_CR6","first-page":"799","volume":"5","author":"PJ Huber","year":"1973","unstructured":"Huber, P.J.: Robust regression: asymptotics, conjectures and Monte Carlo. Ann. Stat. 5(1), 799\u2013821 (1973)","journal-title":"Ann. Stat."},{"issue":"4","key":"2103_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1257\/jep.15.4.143","volume":"15","author":"R Koenker","year":"2001","unstructured":"Koenker, R., Kevin, F.H.: Quantile regression. J. Econ. Perspect. 15(4), 143\u2013156 (2001)","journal-title":"J. Econ. Perspect."},{"key":"2103_CR8","doi-asserted-by":"crossref","unstructured":"Srebro, N., Shraibman, A.: Rank, trace-norm and max-norm. In: Learning theory, pp. 545\u2013560. Springer, Berlin (2005)","DOI":"10.1007\/11503415_37"},{"key":"2103_CR9","doi-asserted-by":"crossref","unstructured":"Gu, S., Zhang, L., Zuo, W., Feng, X.: Weighted nuclear norm minimization with application to image denoising. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2862\u20132869 (2014)","DOI":"10.1109\/CVPR.2014.366"},{"issue":"9","key":"2103_CR10","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2013","unstructured":"Hu, Y., Zhang, D., Ye, J., Li, X., He, X.: Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans. Pattern Anal. Mach. Intell. 35(9), 2117\u20132130 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2103_CR11","doi-asserted-by":"crossref","unstructured":"Shang, F., Liu, Y., Cheng, J.: Scalable algorithms for tractable schatten quasi-norm minimization. In Proceedings of AAAI conference on artificial intelligence, 2016\u20132022 (2016)","DOI":"10.1609\/aaai.v30i1.10266"},{"issue":"4","key":"2103_CR12","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"issue":"15","key":"2103_CR13","first-page":"615","volume":"6","author":"K-C Toh","year":"2010","unstructured":"Toh, K.-C., Yun, S.: An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac. J. Optim. 6(15), 615\u2013640 (2010)","journal-title":"Pac. J. Optim."},{"issue":"6","key":"2103_CR14","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"2103_CR15","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1214\/16-EJS1147","volume":"10","author":"TT Cai","year":"2016","unstructured":"Cai, T.T., Zhou, W.-X.: Matrix completion via max-norm constrained optimization. Electron. J. Stat. 10(1), 1493\u20131525 (2016)","journal-title":"Electron. J. Stat."},{"issue":"1","key":"2103_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-017-1159-y","volume":"167","author":"EX Fang","year":"2018","unstructured":"Fang, E.X., Liu, H., Toh, K.-C., Zhou, W.-X.: Max-norm optimization for robust matrix recovery. Math. Program. 167(1), 5\u201335 (2018)","journal-title":"Math. Program."},{"key":"2103_CR17","first-page":"1","volume":"23","author":"R Salakhutdinov","year":"2010","unstructured":"Salakhutdinov, R., Srebro, N.: Collaborative filtering in a non-uniform world: learning with the weighted trace norm. Adv. Neural Inf. Process. Syst. 23, 1 (2010)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"11","key":"2103_CR18","doi-asserted-by":"publisher","first-page":"2628","DOI":"10.1109\/TPAMI.2018.2858249","volume":"41","author":"Q Yao","year":"2018","unstructured":"Yao, Q., Kwok, J.T., Wang, T., Liu, T.-Y.: Large-scale low-rank matrix learning with nonconvex regularizers. IEEE Trans. Pattern Anal. Mach. Intell. 41(11), 2628\u20132643 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2103_CR19","unstructured":"Fan, J., Ding, L., Chen, Y., Udell, M.: Factor group-sparse regularization for efficient low-rank matrix recovery. In: Advances in Neural Information Processing Systems, vol. 32. Curran Associates, Inc. (2019)"},{"issue":"2","key":"2103_CR20","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/20M136205X","volume":"32","author":"T Tao","year":"2022","unstructured":"Tao, T., Qian, Y., Pan, S.: Column $$\\ell _{2,0}$$-norm regularized factorization model of low-rank matrix recovery and its computation. SIAM J. Optim. 32(2), 959\u2013988 (2022)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2103_CR21","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.sigpro.2007.08.015","volume":"88","author":"D Peleg","year":"2008","unstructured":"Peleg, D., Meir, R.: A bilinear formulation for vector sparsity optimization. Signal Process. 88(2), 375\u2013389 (2008)","journal-title":"Signal Process."},{"issue":"456","key":"2103_CR22","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 nonconvave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"2103_CR23","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"1","key":"2103_CR24","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(1), 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"2103_CR25","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"HA Le Thi","year":"2015","unstructured":"Le Thi, H.A., Pham Dinh, T., Le, H.M., Vo, X.T.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1), 26\u201346 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2103_CR26","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1137\/21M1443455","volume":"32","author":"W Li","year":"2022","unstructured":"Li, W., Bian, W., Toh, K.-C.: Difference-of-convex algorithms for a class of sparse group $$\\ell _0$$ regularized optimization problems. SIAM J. Optim. 32(3), 1614\u20131641 (2022)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2103_CR27","doi-asserted-by":"publisher","first-page":"2034","DOI":"10.1137\/16M1059333","volume":"27","author":"E Soubies","year":"2017","unstructured":"Soubies, E., Blanc-F\u00e9raud, L., Aubert, G.: A unified view of exact continuous penalties for $$\\ell _2$$-$$\\ell _0$$ minimization. SIAM J. Optim. 27(3), 2034\u20132060 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"2103_CR28","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"2103_CR29","doi-asserted-by":"publisher","first-page":"1756","DOI":"10.1137\/16M1064064","volume":"9","author":"T Pock","year":"2016","unstructured":"Pock, T., Sabach, S.: Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems. SIAM J. Imaging Sci. 9, 1756\u20131787 (2016)","journal-title":"SIAM J. Imaging Sci."},{"key":"2103_CR30","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s10915-017-0376-0","volume":"72","author":"Y Xu","year":"2017","unstructured":"Xu, Y., Yin, W.: A globally convergent algorithm for nonconvex optimization based on block coordinate update. J. Sci. Comput. 72, 700\u2013734 (2017)","journal-title":"J. Sci. Comput."},{"key":"2103_CR31","unstructured":"Phan, D.N., Le\u00a0Thi, H.A.: DCA based algorithm with extrapolation for nonconvex nonsmooth optimization (2021). arXiv:2106.04743v1"},{"key":"2103_CR32","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.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"2103_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation I: Basic Theory","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I: Basic Theory. Springer, Berlin (2006)"},{"issue":"2","key":"2103_CR34","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"2103_CR35","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss\u2013Seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"2103_CR36","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841059","volume-title":"Nonlinear Optimization","author":"A Ruszczy\u0144ski","year":"2006","unstructured":"Ruszczy\u0144ski, A.: Nonlinear Optimization. Princeton University Press, Princeton (2006)"},{"issue":"4","key":"2103_CR37","doi-asserted-by":"publisher","first-page":"3402","DOI":"10.1137\/17M1130113","volume":"28","author":"L Yang","year":"2018","unstructured":"Yang, L., Pong, T.K., Chen, X.: A non-monotone alternating updating method for a class of matrix factorization problems. SIAM J. Optim. 28(4), 3402\u20133430 (2018)","journal-title":"SIAM J. Optim."},{"key":"2103_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4538-8","volume-title":"Calculus without Derivatives","author":"J-P Penot","year":"2013","unstructured":"Penot, J.-P.: Calculus without Derivatives. Springer, New York (2013)"},{"issue":"1","key":"2103_CR39","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"J-S Pang","year":"2017","unstructured":"Pang, J.-S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1), 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"2103_CR40","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1\u20132), 5\u201316 (2009)","journal-title":"Math. Program."},{"key":"2103_CR41","unstructured":"Yu, Y.-L.: On decomposing the proximal map. In: Burges, C.J., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 26, pp. 91\u201399. Curran Associates, Inc. (2013)"},{"issue":"1","key":"2103_CR42","first-page":"3367","volume":"16","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Mazumder, R., Lee, J.D., Zadeh, R.: Matrix completion and low-rank SVD via fast alternating least squares. J. Mach. Learn. Res. 16(1), 3367\u20133402 (2015)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02103-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02103-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02103-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:02:47Z","timestamp":1750176167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02103-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2103"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02103-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,3]]},"assertion":[{"value":"18 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}