{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:27:29Z","timestamp":1772065649553,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T00:00:00Z","timestamp":1554336000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T00:00:00Z","timestamp":1554336000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1704169"],"award-info":[{"award-number":["CCF-1704169"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1609916"],"award-info":[{"award-number":["ECCS-1609916"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1115523"],"award-info":[{"award-number":["DMS-1115523"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1522332"],"award-info":[{"award-number":["DMS-1522332"]}],"id":[{"id":"10.13039\/100000001","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":[[2019,7]]},"DOI":"10.1007\/s10589-019-00092-y","type":"journal-article","created":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T14:44:01Z","timestamp":1554475441000},"page":"903-912","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A simple convergence analysis of Bregman proximal gradient algorithm"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3982-9145","authenticated-orcid":false,"given":"Yi","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Yingbin","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Lixin","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,4]]},"reference":[{"issue":"3","key":"92_CR1","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16(3), 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"92_CR2","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A Beck","year":"2003","unstructured":"Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"92_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"92_CR4","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/100818327","volume":"22","author":"A Beck","year":"2012","unstructured":"Beck, A., Teboulle, M.: Smoothing and first order methods: a unified framework. SIAM J. Optim. 22(2), 557\u2013580 (2012)","journal-title":"SIAM J. Optim."},{"key":"92_CR5","first-page":"330","volume":"42","author":"J Bolte","year":"2016","unstructured":"Bolte, J., Bauschke, H., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42, 330\u2013348 (2016)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"92_CR6","doi-asserted-by":"publisher","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."},{"issue":"3","key":"92_CR7","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":"92_CR8","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/BF00940051","volume":"73","author":"Y Censor","year":"1992","unstructured":"Censor, Y., Zenios, S.A.: Proximal minimization algorithm with d-functions. J. Optim. Theory Appl. 73(3), 451\u2013464 (1992)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"92_CR9","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":"3","key":"92_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF00940283","volume":"51","author":"AR De Pierro","year":"1986","unstructured":"De Pierro, A.R., Iusem, A.N.: A relaxed version of Bregman\u2019s method for convex programming. J. Optim. Theory Appl. 51(3), 421\u2013440 (1986)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"92_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1287\/moor.18.1.202","volume":"18","author":"J Eckstein","year":"1993","unstructured":"Eckstein, J.: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. 18(1), 202\u2013226 (1993)","journal-title":"Math. Oper. Res."},{"key":"92_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"issue":"8","key":"92_CR13","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M Fukushima","year":"1981","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12(8), 989\u20131000 (1981)","journal-title":"Int. J. Syst. Sci."},{"issue":"2","key":"92_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O G\u00fcler","year":"1991","unstructured":"G\u00fcler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29(2), 403\u2013419 (1991)","journal-title":"SIAM J. Control Optim."},{"issue":"6","key":"92_CR15","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"P Lions","year":"1979","unstructured":"Lions, P., 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."},{"issue":"R3","key":"92_CR16","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: Br\u00e9ve communication: r\u00e9gularisation d\u2019in\u00e9quations variationnellespar approximations successives. ESAIM Math. Modell. Numer. Anal. 4(R3), 154\u2013158 (1970)","journal-title":"ESAIM Math. Modell. Numer. Anal."},{"key":"92_CR17","doi-asserted-by":"publisher","first-page":"045009","DOI":"10.1088\/0266-5611\/27\/4\/045009","volume":"27","author":"CA Micchelli","year":"2011","unstructured":"Micchelli, C.A., Shen, L., Xu, Y.: Proximity algorithms for image models: denoising. Inverse Probl. 27, 045009 (2011)","journal-title":"Inverse Probl."},{"issue":"1","key":"92_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"92_CR19","doi-asserted-by":"publisher","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."},{"issue":"5","key":"92_CR20","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R Rockafellar","year":"1976","unstructured":"Rockafellar, R.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"92_CR21","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1287\/moor.17.3.670","volume":"17","author":"M Teboulle","year":"1992","unstructured":"Teboulle, M.: Entropic proximal mappings with applications to nonlinear programming. Math. Oper. Res. 17(3), 670\u2013690 (1992)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"92_CR22","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1137\/S1052623495292130","volume":"7","author":"M Teboulle","year":"1997","unstructured":"Teboulle, M.: Convergence of proximal-like algorithms. SIAM J. Optim. 7(4), 1069\u20131083 (1997)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"92_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125(2), 263\u2013295 (2010)","journal-title":"Math. Program."},{"key":"92_CR24","unstructured":"Zhou, Y., Liang, Y., Shen, L.: A new perspective of proximal gradient algorithms. \n                    arXiv: 1503.05601\n                    \n                   (2015)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00092-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00092-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00092-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:56:07Z","timestamp":1589712967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00092-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,4]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["92"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00092-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,4]]},"assertion":[{"value":"13 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}