{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T18:53:29Z","timestamp":1775156009289,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,10]],"date-time":"2018-05-10T00:00:00Z","timestamp":1525910400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Concerted Research Action","award":["ARC 14\/19-060"],"award-info":[{"award-number":["ARC 14\/19-060"]}]},{"name":"Interuniversity Attraction Poles Programme","award":["DYSCO"],"award-info":[{"award-number":["DYSCO"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10957-018-1298-1","type":"journal-article","created":{"date-parts":[[2018,5,10]],"date-time":"2018-05-10T10:51:23Z","timestamp":1525949483000},"page":"455-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":51,"title":["Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization"],"prefix":"10.1007","volume":"178","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2509-1765","authenticated-orcid":false,"given":"Adrien B.","family":"Taylor","sequence":"first","affiliation":[]},{"given":"Julien M.","family":"Hendrickx","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Glineur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,10]]},"reference":[{"key":"1298_CR1","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"key":"1298_CR2","doi-asserted-by":"crossref","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, vol. 87. Springer, Berlin (2004)"},{"issue":"1","key":"1298_CR3","first-page":"3","volume":"15","author":"EK Ryu","year":"2016","unstructured":"Ryu, E.K., Boyd, S.: A primer on monotone operator methods. Appl. Comput. Math. 15(1), 3\u201343 (2016)","journal-title":"Appl. Comput. Math."},{"issue":"1","key":"1298_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/15M1009597","volume":"26","author":"L Lessard","year":"2016","unstructured":"Lessard, L., Recht, B., Packard, A.: Analysis and design of optimization algorithms via integral quadratic constraints. SIAM J. Optim. 26(1), 57\u201395 (2016)","journal-title":"SIAM J. Optim."},{"key":"1298_CR5","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Advances in Neural Information Processing Systems, pp. 1458\u20131466 (2011)"},{"issue":"5","key":"1298_CR6","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s11590-014-0795-x","volume":"9","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Cheng, L.: Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization. Optim. Lett. 9(5), 961\u2013979 (2015)","journal-title":"Optim. Lett."},{"key":"1298_CR7","doi-asserted-by":"publisher","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 1\u201339 (2018). \n                    https:\/\/doi.org\/10.1007\/s10107-018-1232-1","DOI":"10.1007\/s10107-018-1232-1"},{"key":"1298_CR8","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the polyak-\u0142ojasiewicz condition. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 795\u2013811. Springer (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"issue":"1\u20132","key":"1298_CR9","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. 145(1\u20132), 451\u2013482 (2014)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1298_CR10","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. 161(1\u20132), 307\u2013345 (2017)","journal-title":"Math. Program."},{"issue":"3","key":"1298_CR11","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":"3","key":"1298_CR12","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"key":"1298_CR13","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Pesquet, J.C.: Proximal splitting methods in signal processing. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"issue":"7","key":"1298_CR14","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s11590-016-1087-4","volume":"11","author":"E Klerk de","year":"2017","unstructured":"de Klerk, E., Glineur, F., Taylor, A.B.: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optim. Lett. 11(7), 1185\u20131199 (2017)","journal-title":"Optim. Lett."},{"key":"1298_CR15","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"issue":"3\u20134","key":"1298_CR16","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S.: Convex optimization: algorithms and complexity. Found. Trends Mach. Learn. 8(3\u20134), 231\u2013357 (2015)","journal-title":"Found. Trends Mach. Learn."},{"key":"1298_CR17","unstructured":"Drori, Y.: Contributions to the Complexity Analysis of Optimization Algorithms. Ph.D. Thesis, Tel-Aviv University (2014)"},{"issue":"1","key":"1298_CR18","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. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1298_CR19","doi-asserted-by":"crossref","unstructured":"Taylor, A.B.: Convex Interpolation and Performance Estimation of First-Order Methods for Convex Optimization. Ph.D. Thesis, Universit\u00e9 catholique de Louvain (2017)","DOI":"10.1137\/16M108104X"},{"issue":"2","key":"1298_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0885-064X(92)90013-2","volume":"8","author":"AS Nemirovski","year":"1992","unstructured":"Nemirovski, A.S.: Information-based complexity of linear operator equations. J. Complex. 8(2), 153\u2013175 (1992)","journal-title":"J. Complex."},{"issue":"1\u20132","key":"1298_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1\u20132), 37\u201375 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1298_CR22","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1298_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10107-015-0949-3","volume":"159","author":"D Kim","year":"2016","unstructured":"Kim, D., Fessler, J.A.: Optimized first-order methods for smooth convex minimization. Math. Program. 159(1), 81\u2013107 (2016)","journal-title":"Math. Program."},{"key":"1298_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jco.2016.11.001","volume":"39","author":"Y Drori","year":"2017","unstructured":"Drori, Y.: The exact information-based complexity of smooth convex minimization. J. Complex. 39, 1\u201316 (2017)","journal-title":"J. Complex."},{"key":"1298_CR25","doi-asserted-by":"crossref","unstructured":"Taylor, A., Hendrickx, J., Glineur, F.: Performance estimation toolbox (PESTO): automated worst-case analysis of first-order optimization methods. In: Proceedings of the 56th IEEE conference on decision and control (CDC 2017) (2017)","DOI":"10.1109\/CDC.2017.8263832"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-018-1298-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1298-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1298-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T07:46:53Z","timestamp":1557474413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-018-1298-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,10]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["1298"],"URL":"https:\/\/doi.org\/10.1007\/s10957-018-1298-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,10]]},"assertion":[{"value":"11 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}