{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T07:36:38Z","timestamp":1768635398126,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T00:00:00Z","timestamp":1622246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T00:00:00Z","timestamp":1622246400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801279"],"award-info":[{"award-number":["11801279"]}],"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":["11871279"],"award-info":[{"award-number":["11871279"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s10898-021-01044-9","type":"journal-article","created":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T06:03:38Z","timestamp":1622268218000},"page":"841-864","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems"],"prefix":"10.1007","volume":"80","author":[{"given":"Zehui","family":"Jia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jieru","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6957-477X","authenticated-orcid":false,"given":"Xingju","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,29]]},"reference":[{"issue":"1","key":"1044_CR1","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), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"1044_CR2","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. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1044_CR3","unstructured":"Aytekin, A., Feyzmahdavian, H.R., Johansson, M.: Analysis and implementation of an asynchronous optimization algorithm for the parameter server. arXiv preprint arXiv:1610.05507 (2016)"},{"issue":"2","key":"1044_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"issue":"11","key":"1044_CR5","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TIP.2009.2028250","volume":"18","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Trans. Image Process. 18(11), 2419\u20132434 (2009)","journal-title":"IEEE Trans. Image Process."},{"key":"1044_CR6","first-page":"139","volume-title":"Convex Optimization in Signal Processing and Communications","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Gradient-based algorithms with applications to signal recovery problems. In: Palomar, D., Eldar, Y.C. (eds.) Convex Optimization in Signal Processing and Communications, pp. 139\u2013162. Cambridge University Press, Cambridge (2009)"},{"issue":"1","key":"1044_CR7","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."},{"issue":"3","key":"1044_CR8","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1137\/17M1138558","volume":"28","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M., Vaisbourd, Y.: First order methods beyond convexity and lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J. Optim. 28(3), 2131\u20132151 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1044_CR9","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":"3","key":"1044_CR10","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":"3","key":"1044_CR11","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G Chen","year":"1993","unstructured":"Chen, G., Teboulle, M.: Convergence analysis of a proximal-like minimization algorithm using bregman functions. SIAM J. Optim. 3(3), 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1044_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1186\/s13660-019-2078-7","volume":"2019","author":"ZH Jia","year":"2019","unstructured":"Jia, Z.H., Wu, Z.M., Dong, X.M.: An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems. J. Inequal. Appl. 2019(1), 125 (2019)","journal-title":"J. Inequal. Appl."},{"issue":"3","key":"1044_CR13","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Annal. de l\u2019Institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Annal. de l\u2019Institut Fourier"},{"key":"1044_CR14","unstructured":"Li, H., Lin, Z.C.: Accelerated proximal gradient methods for nonconvex programming. In: Advances in neural information processing systems, pp. 379-387 (2015)"},{"issue":"6","key":"1044_CR15","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"1044_CR16","first-page":"87","volume":"117","author":"S Lojasiewicz","year":"1963","unstructured":"Lojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Les \u00c9quations aux D\u00e9riv\u00e9es Partielles 117, 87\u201389 (1963)","journal-title":"Les \u00c9quations aux D\u00e9riv\u00e9es Partielles"},{"key":"1044_CR17","doi-asserted-by":"crossref","unstructured":"Mordukhovich, B.S.: Variational analysis and generalized differentiation I: Basic theory. Grundlehren der Mathematischen Wissenschaften, vol. 330. Springer, Berlin (2006)","DOI":"10.1007\/3-540-31247-1"},{"issue":"1","key":"1044_CR18","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/s10957-019-01538-3","volume":"183","author":"W Peng","year":"2019","unstructured":"Peng, W., Zhang, H., Zhang, X.Y.: Nonconvex proximal incremental aggregated gradient method with linear convergence. J. Optim. Theory Appl. 183(1), 230\u2013245 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"1044_CR19","volume-title":"Variational analysis. Fundamental Principles of Mathematical Science","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational analysis. Fundamental Principles of Mathematical Science, vol. 317. Springer, Berlin (1998)"},{"issue":"2","key":"1044_CR20","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1137\/16M1094415","volume":"28","author":"ND Vanli","year":"2018","unstructured":"Vanli, N.D., Gurbuzbalaban, M., Ozdaglar, A.: Global convergence rate of proximal incremental aggregated gradient methods. SIAM J. Optim. 28(2), 1282\u20131300 (2018)","journal-title":"SIAM J. Optim."},{"key":"1044_CR21","doi-asserted-by":"crossref","unstructured":"Vanli, N.D., Gurbuzbalaban, M., Ozdaglar, A.: A stronger convergence result on the proximal incremental aggregated gradient method. arXiv preprint arXiv:1611.08022, (2016)","DOI":"10.1109\/CDC.2016.7798265"},{"issue":"1","key":"1044_CR22","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/moor.2019.1047","volume":"46","author":"H Zhang","year":"2021","unstructured":"Zhang, H., Dai, Y.H., Guo, L., Peng, W.: Proximal-like incremental aggregated gradient method with linear convergence under bregman distance growth conditions. Math. Oper. Res. 46(1), 61\u201381 (2021)","journal-title":"Math. Oper. Res."},{"key":"1044_CR23","unstructured":"Zhang, X.Y., Zhang, H., Peng, W.: Inertial bregman proximal gradient algorithm for nonconvex problem with smooth adaptable property. arXiv preprint arXiv:1904.04436, (2019)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01044-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01044-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01044-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,17]],"date-time":"2021-07-17T08:11:33Z","timestamp":1626509493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01044-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,29]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["1044"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01044-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,29]]},"assertion":[{"value":"1 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}