{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T17:51:41Z","timestamp":1786038701885,"version":"3.56.0"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100011199","name":"FP7 Ideas: European Research Council","doi-asserted-by":"publisher","award":["679515"],"award-info":[{"award-number":["679515"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","award":["O005318F-RG47"],"award-info":[{"award-number":["O005318F-RG47"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10589-022-00394-8","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T18:02:45Z","timestamp":1658253765000},"page":"247-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Inertial alternating direction method of multipliers for non-convex non-smooth optimization"],"prefix":"10.1007","volume":"83","author":[{"given":"Le Thi Khanh","family":"Hien","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Duy Nhat","family":"Phan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6423-6897","authenticated-orcid":false,"given":"Nicolas","family":"Gillis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"issue":"1","key":"394_CR1","doi-asserted-by":"crossref","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), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"394_CR2","doi-asserted-by":"crossref","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","key":"394_CR3","doi-asserted-by":"crossref","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-seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"394_CR4","doi-asserted-by":"publisher","DOI":"10.1561\/2200000015","author":"F Bach","year":"2011","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn. (2011). https:\/\/doi.org\/10.1561\/2200000015","journal-title":"Found. Trends Mach. Learn."},{"key":"394_CR5","doi-asserted-by":"crossref","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23, 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"key":"394_CR6","doi-asserted-by":"crossref","unstructured":"Bochnak, J., Coste, M., Roy, M.F.: Real Algebraic Geometry. Springer (1998)","DOI":"10.1007\/978-3-662-03718-8"},{"issue":"1","key":"394_CR7","doi-asserted-by":"crossref","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), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"394_CR8","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/moor.2019.1008","volume":"45","author":"RI Bot","year":"2020","unstructured":"Bot, R.I., Nguyen, D.K.: The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates. Math. Oper. Res. 45(2), 682\u2013712 (2020)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"394_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"394_CR10","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Proceeding of International Conference on Machine Learning ICML\u201998 (1998)"},{"key":"394_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-019-00839-y","author":"A Buccini","year":"2020","unstructured":"Buccini, A., Dell\u2019Acqua, P., Donatelli, M.: A general framework for admm acceleration. Numer. Algorithms (2020). https:\/\/doi.org\/10.1007\/s11075-019-00839-y","journal-title":"Numer. Algorithms"},{"issue":"3","key":"394_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3), 1\u201337 (2011)","journal-title":"J. ACM"},{"key":"394_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1109\/TPAMI.2017.2689021","volume":"40","author":"L Canyi","year":"2018","unstructured":"Canyi, L., Feng, J., Yan, S., Lin, Z.: A unified alternating direction method of multipliers by majorization minimization. IEEE Trans. Pattern Anal. Mach. Intell. 40, 527\u2013541 (2018). https:\/\/doi.org\/10.1109\/TPAMI.2017.2689021","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"394_CR14","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10898-016-0405-9","volume":"66","author":"E Chouzenoux","year":"2016","unstructured":"Chouzenoux, E., Pesquet, J.C., Repetti, A.: A block coordinate variable metric forward-backward algorithm. J. Glob. Optim. 66, 457\u2013485 (2016)","journal-title":"J. Glob. Optim."},{"key":"394_CR15","doi-asserted-by":"crossref","unstructured":"Deng, W., Yin, W.: On the global and linear convergence of the generalized alternating direction method of multipliers. Rice CAAM tech report TR12-14 66 (2012)","DOI":"10.21236\/ADA567407"},{"issue":"3","key":"394_CR16","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/110853996","volume":"34","author":"M Fazel","year":"2013","unstructured":"Fazel, M., Pong, T.K., Sun, D., Tseng, P.: Hankel matrix rank minimization with applications to system identification and realization. SIAM J. Matrix Anal. Appl. 34(3), 946\u2013977 (2013)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"394_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"issue":"R2","key":"394_CR18","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de dirichlet non lin\u00e9aires. ESAIM Math. Model. Numer. Anal. Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique 9(R2), 41\u201376 (1975)","journal-title":"ESAIM Math. Model. Numer. Anal. Mod\u00e9lisation Math\u00e9matique et Analyse Num\u00e9rique"},{"issue":"3","key":"394_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0167-6377(99)00074-7","volume":"26","author":"L Grippo","year":"2000","unstructured":"Grippo, L., Sciandrone, M.: On the convergence of the block nonlinear gauss-seidel method under convex constraints. Oper. Res. Lett. 26(3), 127\u2013136 (2000)","journal-title":"Oper. Res. Lett."},{"key":"394_CR20","unstructured":"Hien, L.T.K., Gillis, N., Patrinos, P.: Inertial block proximal method for non-convex non-smooth optimization. In: Thirty-Seventh International Conference on Machine Learning ICML 2020 (2020)"},{"key":"394_CR21","unstructured":"Hien, L.T.K., Phan, D.N., Gillis, N.: Inertial block majorization minimization framework for nonconvex nonsmooth optimization (2020). arXiv:2010.12133"},{"issue":"1","key":"394_CR22","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/nav.3800040113","volume":"4","author":"C Hildreth","year":"1957","unstructured":"Hildreth, C.: A quadratic programming procedure. Naval Res. Logist. Q. 4(1), 79\u201385 (1957)","journal-title":"Naval Res. Logist. Q."},{"issue":"3","key":"394_CR23","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/moor.2019.1010","volume":"45","author":"M Hong","year":"2020","unstructured":"Hong, M., Chang, T.H., Wang, X., Razaviyayn, M., Ma, S., Luo, Z.Q.: A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization. Math. Oper. Res. 45(3), 833\u2013861 (2020)","journal-title":"Math. Oper. Res."},{"key":"394_CR24","unstructured":"Huang, F., Chen, S., Huang, H.: Faster stochastic alternating direction method of multipliers for nonconvex optimization. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a097, pp. 2839\u20132848. PMLR (2019). http:\/\/proceedings.mlr.press\/v97\/huang19a.html"},{"key":"394_CR25","unstructured":"Huang, F., Chen, S., Lu, Z.: Stochastic alternating direction method of multipliers with variance reduction for nonconvex optimization (2016). arXiv:1610.02758"},{"issue":"8","key":"394_CR26","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30\u201337 (2009)","journal-title":"Computer"},{"key":"394_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-013-9740-x","author":"R Lai","year":"2014","unstructured":"Lai, R., Osher, S.: A splitting method for orthogonality constrained problems. J. Sci. Comput. (2014). https:\/\/doi.org\/10.1007\/s10915-013-9740-x","journal-title":"J. Sci. Comput."},{"issue":"6755","key":"394_CR28","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788\u2013791 (1999)","journal-title":"Nature"},{"issue":"4","key":"394_CR29","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25(4), 2434\u20132460 (2015). https:\/\/doi.org\/10.1137\/140998135","journal-title":"SIAM J. Optim."},{"key":"394_CR30","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s10915-018-0893-5","volume":"79","author":"H Li","year":"2019","unstructured":"Li, H., Lin, Z.: Accelerated alternating direction method of multipliers: an optimal o(1 \/ k) nonergodic analysis. J. Sci. Comput. 79, 671\u2013699 (2019)","journal-title":"J. Sci. Comput."},{"key":"394_CR31","unstructured":"Lin, Z., Liu, R., Su, Z.: Linearized alternating direction method with adaptive penalty for low-rank representation. In: Shawe-Taylor, J., Zemel, R., Bartlett, P., Pereira, F., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 24, pp. 612\u2013620. Curran Associates Inc. (2011)"},{"issue":"1","key":"394_CR32","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","volume":"35","author":"G Liu","year":"2013","unstructured":"Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., Ma, Y.: Robust recovery of subspace structures by low-rank representation. IEEE Trans. Pattern Anal. Mach. Intell. 35(1), 171\u2013184 (2013)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"394_CR33","doi-asserted-by":"crossref","unstructured":"Liu, G., Yan, S.: Latent low-rank representation for subspace segmentation and feature extraction. In: 2011 International Conference on Computer Vision, pp. 1615\u20131622 (2011)","DOI":"10.1109\/ICCV.2011.6126422"},{"key":"394_CR34","doi-asserted-by":"crossref","first-page":"76131","DOI":"10.1109\/ACCESS.2019.2914461","volume":"7","author":"Q Liu","year":"2019","unstructured":"Liu, Q., Shen, X., Gu, Y.: Linearized admm for nonconvex nonsmooth optimization with convergence analysis. IEEE Access 7, 76131\u201376144 (2019)","journal-title":"IEEE Access"},{"issue":"2","key":"394_CR35","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/TIP.2015.2511584","volume":"25","author":"C Lu","year":"2016","unstructured":"Lu, C., Tang, J., Yan, S., Lin, Z.: Nonconvex nonsmooth low rank minimization via iteratively reweighted nuclear norm. IEEE Trans. Image Process. 25(2), 829\u2013839 (2016)","journal-title":"IEEE Trans. Image Process."},{"key":"394_CR36","unstructured":"Mairal, J.: Optimization with first-order surrogate functions. In: Proceedings of the 30th International Conference on International Conference on Machine Learning, vol. 28, ICML\u201913, pp. 783\u2013791. JMLR.org (2013)"},{"key":"394_CR37","doi-asserted-by":"crossref","unstructured":"Markovsky, I.: Low Rank Approximation: Algorithms, Implementation, Applications. vol. 906. Springer (2012)","DOI":"10.1007\/978-1-4471-2227-2"},{"key":"394_CR38","unstructured":"Melo, J.G., Monteiro, R.D.C.: Iteration-complexity of a jacobi-type non-euclidean admm for multi-block linearly constrained nonconvex programs (2017)"},{"key":"394_CR39","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publ. (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"issue":"1","key":"394_CR40","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/17M1124085","volume":"29","author":"P Ochs","year":"2019","unstructured":"Ochs, P.: Unifying abstract inexact convergence theorems and block coordinate variable metric ipiano. SIAM J. Optim. 29(1), 541\u2013570 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"394_CR41","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1137\/14095697X","volume":"8","author":"Y Ouyang","year":"2015","unstructured":"Ouyang, Y., Chen, Y., Lan, G., Pasiliao, E.: An accelerated linearized alternating direction method of multipliers. SIAM J. Imag. Sci. 8(1), 644\u2013681 (2015)","journal-title":"SIAM J. Imag. Sci."},{"issue":"3","key":"394_CR42","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"issue":"4","key":"394_CR43","doi-asserted-by":"crossref","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. Imag. Sci. 9(4), 1756\u20131787 (2016)","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"394_CR44","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584660","volume":"4","author":"MJD Powell","year":"1973","unstructured":"Powell, M.J.D.: On search directions for minimization algorithms. Math. Program. 4(1), 193\u2013201 (1973)","journal-title":"Math. Program."},{"issue":"2","key":"394_CR45","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23(2), 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"394_CR46","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"394_CR47","volume-title":"The Theory Of Subgradients And Its Applications To Problems Of Optimization - Convex And Nonconvex Functions","author":"RT Rockafellar","year":"1981","unstructured":"Rockafellar, R.T.: The Theory Of Subgradients And Its Applications To Problems Of Optimization - Convex And Nonconvex Functions. Heldermann, Heidelberg (1981)"},{"key":"394_CR48","doi-asserted-by":"crossref","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, Heidelberg (1998)"},{"key":"394_CR49","unstructured":"Scheinberg, K., Ma, S., Goldfarb, D.: Sparse inverse covariance selection via alternating linearization methods. In: Lafferty, J.D., Williams, C.K.I., Shawe-Taylor, J., Zemel, R.S., Culotta, A. (eds.) Advances in Neural Information Processing Systems 23, pp. 2101\u20132109. Curran Associates Inc. (2010)"},{"issue":"8","key":"394_CR50","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"394_CR51","doi-asserted-by":"crossref","first-page":"6211","DOI":"10.1109\/TIP.2019.2924339","volume":"28","author":"T Sun","year":"2019","unstructured":"Sun, T., Barrio, R., Rodr\u00edguez, M., Jiang, H.: Inertial nonconvex alternating minimizations for the image deblurring. IEEE Trans. Image Process. 28(12), 6211\u20136224 (2019)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"394_CR52","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/TSP.2016.2601299","volume":"65","author":"Y Sun","year":"2017","unstructured":"Sun, Y., Babu, P., Palomar, D.P.: Majorization-minimization algorithms in signal processing, communications, and machine learning. IEEE Trans. Signal Process. 65(3), 794\u2013816 (2017). https:\/\/doi.org\/10.1109\/TSP.2016.2601299","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"394_CR53","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"394_CR54","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1), 387\u2013423 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"394_CR55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000055","volume":"9","author":"M Udell","year":"2016","unstructured":"Udell, M., Horn, C., Zadeh, R., Boyd, S.: Generalized low rank models. Found. Trends Mach. Learn. 9(1), 1\u2013118 (2016)","journal-title":"Found. Trends Mach. Learn."},{"issue":"1","key":"394_CR56","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/18M1183480","volume":"1","author":"M Udell","year":"2019","unstructured":"Udell, M., Townsend, A.: Why are big data matrices approximately low rank? SIAM J. Math. Data Sci. 1(1), 144\u2013160 (2019)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"4","key":"394_CR57","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"key":"394_CR58","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of admm in nonconvex nonsmooth optimization. J. Sci. Comput. 78, 29\u201363 (2019). https:\/\/doi.org\/10.1007\/s10915-018-0757-z","journal-title":"J. Sci. Comput."},{"issue":"11","key":"394_CR59","doi-asserted-by":"crossref","first-page":"2957","DOI":"10.1109\/TSP.2015.2412915","volume":"63","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Zeng, J., Peng, Z., Chang, X., Xu, Z.: Linear convergence of adaptively iterative thresholding algorithms for compressed sensing. IEEE Trans. Signal Process. 63(11), 2957\u20132971 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"394_CR60","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Math. Program. 142, 397\u2013434 (2010)","journal-title":"Math. Program."},{"key":"394_CR61","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10957-011-9876-5","volume":"151","author":"M Xu","year":"2011","unstructured":"Xu, M., Wu, T.: A class of linearized proximal alternating direction methods. J. Optim. Theory Appl. 151, 321\u2013337 (2011). https:\/\/doi.org\/10.1007\/s10957-011-9876-5","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"394_CR62","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imag. Sci. 6(3), 1758\u20131789 (2013). https:\/\/doi.org\/10.1137\/120887795","journal-title":"SIAM J. Imag. Sci."},{"issue":"2","key":"394_CR63","doi-asserted-by":"crossref","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(2), 700\u2013734 (2017)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"394_CR64","doi-asserted-by":"crossref","first-page":"2842","DOI":"10.1137\/080732894","volume":"31","author":"J Yang","year":"2009","unstructured":"Yang, J., Zhang, Y., Yin, W.: An efficient TVL1 algorithm for deblurring multichannel images corrupted by impulsive noise. SIAM J. Sci. Comput. 31(4), 2842\u20132865 (2009)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"394_CR65","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1137\/15M1027528","volume":"10","author":"L Yang","year":"2017","unstructured":"Yang, L., Pong, T.K., Chen, X.: Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background\/foreground extraction. SIAM J. Imag. Sci. 10(1), 74\u2013110 (2017). https:\/\/doi.org\/10.1137\/15M1027528","journal-title":"SIAM J. Imag. Sci."},{"key":"394_CR66","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/070703983","volume":"1","author":"W Yin","year":"2008","unstructured":"Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for l(1)-minimization with applications to compressed sensing. SIAM J. Imag. Sci. 1, 143\u2013168 (2008)","journal-title":"SIAM J. Imag. Sci."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00394-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00394-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00394-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T06:21:08Z","timestamp":1659680468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00394-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":66,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["394"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00394-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"25 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}