{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:48:22Z","timestamp":1767340102439,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T00:00:00Z","timestamp":1666396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T00:00:00Z","timestamp":1666396800000},"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":["No.12061013"],"award-info":[{"award-number":["No.12061013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s12190-022-01799-8","type":"journal-article","created":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T12:12:58Z","timestamp":1666440778000},"page":"1559-1581","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems"],"prefix":"10.1007","volume":"69","author":[{"given":"Miantao","family":"Chao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifan","family":"Nong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meiyu","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,22]]},"reference":[{"issue":"4","key":"1799_CR1","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1799_CR2","first-page":"89","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A.: An algorithm for total variation minimization and applications. J. Math. Imag. Vision 20(1), 89\u201397 (2004)","journal-title":"J. Math. Imag. Vision"},{"issue":"4","key":"1799_CR3","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. Imag. Sci. 9(4), 1756\u20131787 (2016)","journal-title":"SIAM J. Imag. Sci."},{"issue":"4","key":"1799_CR4","doi-asserted-by":"publisher","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(4), 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"key":"1799_CR5","volume-title":"Tsitsiklis, parallel and distributed computation","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P.: Tsitsiklis, parallel and distributed computation. Prentice Hall, New Jersey (1989)"},{"issue":"3","key":"1799_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF00940050","volume":"73","author":"A Auslender","year":"1992","unstructured":"Auslender, A.: Asymptotic properties of the fenchel dual functional and applications to decomposition problems. J. Optim. Theory Appl. 73(3), 427\u2013449 (1992)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1799_CR7","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1137\/060657248","volume":"18","author":"H Attouch","year":"2007","unstructured":"Attouch, H., Redont, P., Soubeyran, A.: A new class of alternating proximal minimization algorithms with costs-to-move. SIAM J. Optim. 18(3), 1061\u20131081 (2007)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1799_CR8","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)","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"1799_CR9","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), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1799_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"25","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 25, 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"2","key":"1799_CR11","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., Pock, T.: ipiano: inertial proximal algorithm for nonconvex optimization. SIAM J. Imag. Sci. 7(2), 1388\u20131419 (2014)","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"1799_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1011253113155","volume":"9","author":"F Alvarez","year":"2001","unstructured":"Alvarez, F., Attouch, H.: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 9(1), 3\u201311 (2001)","journal-title":"Set-Valued Anal."},{"issue":"1","key":"1799_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13675-015-0045-8","volume":"4","author":"RI Bo\u0163","year":"2016","unstructured":"Bo\u0163, R.I., Csetnek, E.R., L\u00e1szl\u00f3, S.C.: An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions. EURO J. Comput. Optim. 4(1), 3\u201325 (2016)","journal-title":"EURO J. Comput. Optim."},{"issue":"4","key":"1799_CR14","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1137\/15100463X","volume":"8","author":"C Chen","year":"2015","unstructured":"Chen, C., Chan, R.H., Ma, S., Yang, J.: Inertial proximal admm for linearly constrained separable convex optimization. SIAM J. Imag. Sci. 8(4), 2239\u20132267 (2015)","journal-title":"SIAM J. Imag. Sci."},{"issue":"4","key":"1799_CR15","doi-asserted-by":"publisher","first-page":"2120","DOI":"10.1137\/140980910","volume":"25","author":"C Chen","year":"2015","unstructured":"Chen, C., Ma, S., Yang, J.: A general inertial proximal point algorithm for mixed variational inequality problem. SIAM J. Optim. 25(4), 2120\u20132142 (2015)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1799_CR16","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/s10898-019-00819-5","volume":"76","author":"X Gao","year":"2020","unstructured":"Gao, X., Cai, X., Han, D.: A gauss-seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems. J. Glob. Optim. 76(4), 863\u2013887 (2020)","journal-title":"J. Glob. Optim."},{"key":"1799_CR17","first-page":"1","volume":"87","author":"J Zhao","year":"2022","unstructured":"Zhao, J., Dong, Q.-L., Rassias, M.T., Wang, F.: Two-step inertial bregman alternating minimization algorithm for nonconvex and nonsmooth problems. J. Glob. Optim. 87, 1\u201326 (2022)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"1799_CR18","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"2","key":"1799_CR19","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-\u0142ojasiewicz inequality. Math. Op. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Op. Res."},{"issue":"4","key":"1799_CR20","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0142ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"1799_CR21","volume-title":"Variational analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational analysis, vol. 317. Springer, Cham (2009)"},{"key":"1799_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization: a basic course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory lectures on convex optimization: a basic course, vol. 87. Springer, Cham (2004)"},{"key":"1799_CR23","first-page":"10","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J., Lafferty, J.: Clustering with bregman divergences. J. Mach. Learn. Res. 6, 10 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"1799_CR24","volume-title":"Real algebraic geometry","author":"B Jacek","year":"1998","unstructured":"Jacek, B., Michel, C., Marie-Pranroise, R.: Real algebraic geometry, vol. 36. Springer, Cham (1998)"},{"issue":"7","key":"1799_CR25","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.: $$ l_ 1\/2 $$ regularization: A thresholding representation theory and a fast solver. IEEE Trans Neural Netw Learn Syst 23(7), 1013\u20131027 (2012)","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"3","key":"1799_CR26","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1137\/080724265","volume":"1","author":"Y Wang","year":"2008","unstructured":"Wang, Y., Yang, J., Yin, W., Zhang, Y.: A new alternating minimization algorithm for total variation image reconstruction. SIAM J. Imag. Sci. 1(3), 248\u2013272 (2008)","journal-title":"SIAM J. Imag. Sci."},{"key":"1799_CR27","first-page":"69","volume":"4","author":"J Yang","year":"2017","unstructured":"Yang, J.: An algorithmic review for total variation regularized data fitting problems in image processing. Op. Res. Trans. 4, 69\u201383 (2017)","journal-title":"Op. Res. Trans."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01799-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-022-01799-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-022-01799-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T13:23:05Z","timestamp":1679318585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-022-01799-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,22]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1799"],"URL":"https:\/\/doi.org\/10.1007\/s12190-022-01799-8","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2022,10,22]]},"assertion":[{"value":"30 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2022","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 declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}