{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T18:48:30Z","timestamp":1778006910282,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004052","name":"King Abdullah University of Science and Technology","doi-asserted-by":"publisher","award":["Baseline Research Funding Scheme"],"award-info":[{"award-number":["Baseline Research Funding Scheme"]}],"id":[{"id":"10.13039\/501100004052","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":[[2021,6]]},"DOI":"10.1007\/s10589-021-00273-8","type":"journal-article","created":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T19:04:42Z","timestamp":1617822282000},"page":"405-440","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Accelerated Bregman proximal gradient methods for relatively smooth convex optimization"],"prefix":"10.1007","volume":"79","author":[{"given":"Filip","family":"Hanzely","sequence":"first","affiliation":[]},{"given":"Peter","family":"Richt\u00e1rik","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9759-3898","authenticated-orcid":false,"given":"Lin","family":"Xiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,7]]},"reference":[{"issue":"5","key":"273_CR1","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1214\/aoms\/1177697374","volume":"40","author":"CL Atwood","year":"1969","unstructured":"Atwood, C.L.: Optimal and efficient designs of experiments. Ann. Math. Stat. 40(5), 1570\u20131602 (1969)","journal-title":"Ann. Math. Stat."},{"issue":"3","key":"273_CR2","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":"2","key":"273_CR3","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 method revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"key":"273_CR4","first-page":"23","volume-title":"Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Haifa 2000)","author":"HH Bauschke","year":"2001","unstructured":"Bauschke, H.H., Borwein, J.M.: Joint and separate convexity of the Bregman distance. In: Butnariu, D., Censor, Y., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications (Haifa 2000), pp. 23\u201326. Elsevier, Amsterdam (2001)"},{"key":"273_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization. MOS-SIAM Series on Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. MOS-SIAM Series on Optimization. SIAM, Philadelphia (2017)"},{"issue":"1","key":"273_CR6","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":"12","key":"273_CR7","doi-asserted-by":"publisher","first-page":"123006","DOI":"10.1088\/0266-5611\/25\/12\/123006","volume":"25","author":"M Bertero","year":"2009","unstructured":"Bertero, M., Boccacci, P., Desider\u00e1, G., Vicidomini, G.: Image deblurring with Poisson data: from cells to galaxies. Inverse Probl. 25(12), 123006 (2009)","journal-title":"Inverse Probl."},{"key":"273_CR8","doi-asserted-by":"crossref","unstructured":"Birnbaum, B., Devanur, N.\u00a0R., Xiao, L.: Distributed algorithms via gradient descent for Fisher markets. In: Proceedings of the 12th ACM conference on Electronic Commerce, pp. 127\u2013136, San Jose, California, USA (2011)","DOI":"10.1145\/1993574.1993594"},{"key":"273_CR9","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 points of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"273_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF00934676","volume":"34","author":"Y Censor","year":"1981","unstructured":"Censor, Y., Lent, A.: An iterative row-action method for interval convex programming. J. Optim. Theory Appl. 34(3), 321\u2013353 (1981)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"273_CR11","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":"273_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1961189.1961199","volume":"2","author":"C-C Chang","year":"2011","unstructured":"Chang, C.-C., Lin, C.-J.: Libsvm: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"3","key":"273_CR13","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":"4","key":"273_CR14","doi-asserted-by":"publisher","first-page":"2032","DOI":"10.1214\/aos\/1176348385","volume":"19","author":"I Csisz\u00e1r","year":"1991","unstructured":"Csisz\u00e1r, I.: Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems. Ann. Stat. 19(4), 2032\u20132066 (1991)","journal-title":"Ann. Stat."},{"key":"273_CR15","unstructured":"Dragomir, R.-A., Taylor, A.B., d\u2019Aspremont, A., Bolte, J.: Optimal complexity and certification of bregman first-order methods. Preprint, arXiv:1911.08510 (2019)"},{"key":"273_CR16","unstructured":"Gutman, D.H., Pe\u00f1a, J.F.: Perturbed Fenchel duality and first-order methods. Preprint, arXiv:1812.10198 (2018)"},{"key":"273_CR17","unstructured":"Hanzely, F., Richt\u00e1rik, P.: Fastest rates for stochastic mirror descent methods. arXiv preprint arXiv:1803.07374 (2018)"},{"key":"273_CR18","volume-title":"Inequalities","author":"G Hardy","year":"1952","unstructured":"Hardy, G., Littlewood, J.E., P\u00f3lya, G.: Inequalities, 2nd edn. Cambridge University Press, Cambridge (1952)","edition":"2"},{"issue":"2","key":"273_CR19","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1214\/aoms\/1177706252","volume":"30","author":"J Kiefer","year":"1959","unstructured":"Kiefer, J., Wolfowitz, J.: Optimal design in regression problems. Ann. Math. Stat. 30(2), 271\u2013294 (1959)","journal-title":"Ann. Math. Stat."},{"issue":"4","key":"273_CR20","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/ijoo.2018.0008","volume":"1","author":"H Lu","year":"2019","unstructured":"Lu, H.: Relative-continuity for non-Lipschitz non-smooth convex optimization using stochastic (or deterministic) mirror descent. INFORMS Journal on Optimization 1(4), 288\u2013303 (2019)","journal-title":"INFORMS Journal on Optimization"},{"issue":"1","key":"273_CR21","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, R.M., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1), 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"key":"273_CR22","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovsky","year":"1983","unstructured":"Nemirovsky, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"issue":"2","key":"273_CR23","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving a convex programming problem with convergence rate O(1\/k2). Sov. Math. Doklady 27(2), 372\u2013376 (1983)","journal-title":"Sov. Math. Doklady"},{"key":"273_CR24","first-page":"509","volume":"24","author":"Y Nesterov","year":"1988","unstructured":"Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex functions. \u00c8konom. i. Mat. Metody 24, 509\u2013517 (1988)","journal-title":"\u00c8konom. i. Mat. Metody"},{"key":"273_CR25","doi-asserted-by":"publisher","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. Kluwer, Boston (2004)"},{"key":"273_CR26","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 nonsmooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"273_CR27","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. Ser. B 140, 125\u2013161 (2013)","journal-title":"Math. Program. Ser. B"},{"key":"273_CR28","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. Ser. A 152, 381\u2013404 (2015)","journal-title":"Math. Program. Ser. A"},{"key":"273_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10107-019-01449-1","volume":"186","author":"Y Nesterov","year":"2021","unstructured":"Nesterov, Y.: Implementable tensor methods in unconstrained convex optimization. Math. Program. 186, 157\u2013183 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"273_CR30","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Cand\u00e8s, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u2013732 (2015)","journal-title":"Found. Comput. Math."},{"key":"273_CR31","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"273_CR32","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10107-018-1284-2","volume":"170","author":"M Teboulle","year":"2018","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. Ser. B 170, 67\u201396 (2018)","journal-title":"Math. Program. Ser. B"},{"key":"273_CR33","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization (unpublished manuscript) (2008)"},{"key":"273_CR34","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s10589-019-00092-y","volume":"93","author":"Y Zhou","year":"2019","unstructured":"Zhou, Y., Liang, Y., Shen, L.: A simple convergence analysis of Bregman proximal gradient algorithm. Comput. Optim. Appl. 93, 903\u2013912 (2019)","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00273-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00273-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00273-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T03:39:27Z","timestamp":1620358767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00273-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,7]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["273"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00273-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,7]]},"assertion":[{"value":"24 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}