{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T00:57:03Z","timestamp":1782349023598,"version":"3.54.5"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003977","name":"israel science foundation","doi-asserted-by":"publisher","award":["2619-20"],"award-info":[{"award-number":["2619-20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10107-022-01899-0","type":"journal-article","created":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T13:04:18Z","timestamp":1665666258000},"page":"63-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An elementary approach to tight worst case complexity analysis of gradient based methods"],"prefix":"10.1007","volume":"201","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4228-131X","authenticated-orcid":false,"given":"Marc","family":"Teboulle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yakov","family":"Vaisbourd","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"issue":"1","key":"1899_CR1","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. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"1899_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization, vol. 25. SIAM, Philadelphia (2017)"},{"key":"1899_CR3","volume-title":"Convex Optimization Algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D.P.: Convex Optimization Algorithms. Athena Scientific, Belmont (2015)"},{"key":"1899_CR4","unstructured":"Drori, Y.: Contributions to the complexity analysis of optimization algorithms. Ph.D. Thesis Tel-Aviv University (2014)"},{"issue":"1\u20132","key":"1899_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-013-0653-0","volume":"145","author":"Y Drori","year":"2014","unstructured":"Drori, Y., Teboulle, M.: Performance of first-order methods for smooth convex minimization: a novel approach. Math. Program. Ser. A 145(1\u20132), 451\u2013482 (2014)","journal-title":"Math. Program. Ser. A"},{"issue":"5","key":"1899_CR6","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1090\/S0002-9904-1964-11178-2","volume":"70","author":"AA Goldstein","year":"1964","unstructured":"Goldstein, A.A.: Convex programming in Hilbert space. B. Am. Math. Soc. 70(5), 709\u2013710 (1964)","journal-title":"B. Am. Math. Soc."},{"issue":"2","key":"1899_CR7","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."},{"key":"1899_CR8","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"R Graham","year":"1994","unstructured":"Graham, R., Knuth, D., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley, Boston (1994)","edition":"2"},{"key":"1899_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s10957-020-01770-2","volume":"188","author":"D Kim","year":"2021","unstructured":"Kim, D., Fessler, J.A.: Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions. J. Optim. Theory Appl. 188, 192\u2013219 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"1899_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levitin","year":"1966","unstructured":"Levitin, E.S., Polyak, B.T.: Constrained minimization methods. USSR Comp. Math. Math. Phys. 6(5), 1\u201350 (1966)","journal-title":"USSR Comp. Math. Math. Phys."},{"issue":"6","key":"1899_CR11","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, I.: 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":"1899_CR12","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fran\u00e7aise Informatique. Recherche Op\u00e9rationnelle 4, 154\u2013158 (1970)","journal-title":"Rev. Fran\u00e7aise Informatique. Recherche Op\u00e9rationnelle"},{"key":"1899_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J-J Moreau","year":"1965","unstructured":"Moreau, J.-J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull. Soc. Math. France 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. France"},{"issue":"2","key":"1899_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0022-247X(79)90234-8","volume":"72","author":"GB Passty","year":"1979","unstructured":"Passty, G.B.: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J. Math. Anal. Appl. 72(2), 383\u2013390 (1979)","journal-title":"J. Math. Anal. Appl."},{"key":"1899_CR15","first-page":"401","volume":"20","author":"S Sabach","year":"2019","unstructured":"Sabach, S., Teboulle, M.: Lagrangian methods for composite optimization. Handb. Numer. Anal. 20, 401\u2013436 (2019)","journal-title":"Handb. Numer. Anal."},{"issue":"1\u20132","key":"1899_CR16","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-016-1009-3","volume":"161","author":"AB Taylor","year":"2017","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Math. Program. Ser. A 161(1\u20132), 307\u2013345 (2017)","journal-title":"Math. Program. Ser. A"},{"issue":"3","key":"1899_CR17","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1137\/16M108104X","volume":"27","author":"AB Taylor","year":"2017","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case performance of first-order methods for composite convex optimization. SIAM J. Optim. 27(3), 1283\u20131313 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1899_CR18","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(1), 67\u201396 (2018)","journal-title":"Math. Program. Ser. B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01899-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01899-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01899-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T04:09:14Z","timestamp":1690344554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01899-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,13]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1899"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01899-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,13]]},"assertion":[{"value":"19 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}