{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T03:29:42Z","timestamp":1784518182899,"version":"3.55.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T00:00:00Z","timestamp":1541980800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10107-018-1350-9","type":"journal-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T09:36:36Z","timestamp":1542015396000},"page":"137-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":57,"title":["Convergence rate of inertial Forward\u2013Backward algorithm beyond Nesterov\u2019s rule"],"prefix":"10.1007","volume":"180","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9295-5431","authenticated-orcid":false,"given":"Vassilis","family":"Apidopoulos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Fran\u00e7ois","family":"Aujol","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charles","family":"Dossal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,11,12]]},"reference":[{"issue":"1","key":"1350_CR1","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/17M1128642","volume":"28","author":"V Apidopoulos","year":"2018","unstructured":"Apidopoulos, V., Aujol, J.F., Dossal, C.: The differential inclusion modeling FISTA algorithm and optimality of convergence rate in the case b\n$$\\le 3$$\n\n\n\n\n\u2264\n3\n\n\n\n\n. SIAM J. Optim. 28(1), 551\u2013574 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1350_CR2","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/17M1114739","volume":"28","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Cabot, A.: Convergence rates of inertial forward\u2013backward algorithms. SIAM J. Optim. 28(1), 849\u2013874 (2018)","journal-title":"SIAM J. Optim."},{"key":"1350_CR3","first-page":"1","volume":"168","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Chbani, Z., Peypouquet, J., Redont, P.: Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math. Program. 168, 1\u201353 (2016)","journal-title":"Math. Program."},{"key":"1350_CR4","unstructured":"Attouch, H., Chbani, Z., Riahi, H.: Rate of convergence of the Nesterov accelerated gradient method in the subcritical case \n$$\\alpha \\le 3$$\n\n\n\n\n\u03b1\n\u2264\n3\n\n\n\n\n (2017). arXiv preprint \narXiv:1706.05671"},{"issue":"3","key":"1350_CR5","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward\u2013backward method is actually faster than 1\/k\n$$^{\\wedge }$$\n\n\n\n\n\n\u2227\n\n\n\n\n2. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1350_CR6","doi-asserted-by":"publisher","first-page":"2408","DOI":"10.1137\/140994964","volume":"25","author":"JF Aujol","year":"2015","unstructured":"Aujol, J.F., Dossal, C.: Stability of over-relaxations for the forward\u2013backward algorithm, application to FISTA. SIAM J. Optim. 25(4), 2408\u20132433 (2015)","journal-title":"SIAM J. Optim."},{"key":"1350_CR7","unstructured":"Aujol, J.F., Dossal, C.: Optimal rate of convergence of an ode associated to the fast gradient descent schemes for \n$$b>0$$\n\n\n\n\nb\n>\n0\n\n\n\n\n. J. Differ. Equ. (preprint available hal-01547251) (2017)"},{"key":"1350_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)"},{"issue":"1","key":"1350_CR9","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":"3","key":"1350_CR10","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of the fast iterative shrinkage\/thresholding algorithm. J. Optim. Theory Appl. 166(3), 968\u2013982 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1350_CR11","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"4","key":"1350_CR12","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/0802032","volume":"2","author":"O G\u00fcler","year":"1992","unstructured":"G\u00fcler, O.: New proximal point algorithms for convex minimization. SIAM J. Optim. 2(4), 649\u2013664 (1992)","journal-title":"SIAM J. Optim."},{"key":"1350_CR13","unstructured":"Holte, J.M.: Discrete Gronwall lemma and applications. In: MAA-NCS meeting at the University of North Dakota, vol. 24, pp. 1\u20137 (2009)"},{"key":"1350_CR14","unstructured":"Johnstone, P.R., Moulin, P.: Local and global convergence of a general inertial proximal splitting scheme (2016). arXiv preprint \narXiv:1602.02726"},{"key":"1350_CR15","unstructured":"Kim, D., Fessler, J.A.: Optimized first-order methods for smooth convex minimization (2014). arXiv preprint \narXiv:1406.5468"},{"key":"1350_CR16","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate O (1\/k2). Sov. Math. Doklady 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Doklady"},{"key":"1350_CR17","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, Berlin (2013)"},{"issue":"4","key":"1350_CR18","first-page":"1167","volume":"19","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Convex Anal. 19(4), 1167\u20131192 (2012)","journal-title":"J. Convex Anal."},{"key":"1350_CR19","unstructured":"Schmidt, M., Le\u00a0Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: NIPS (2011)"},{"issue":"153","key":"1350_CR20","first-page":"1","volume":"17","author":"W Su","year":"2016","unstructured":"Su, W., Boyd, S., Candes, E.J.: A differential equation for modeling Nesterovs accelerated gradient method: theory and insights. J. Mach. Learn. Res. 17(153), 1\u201343 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"1350_CR21","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1350-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1350-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1350-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T05:15:40Z","timestamp":1581398140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1350-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,12]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1350"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1350-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,12]]},"assertion":[{"value":"30 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}