{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T10:18:00Z","timestamp":1780568280725,"version":"3.54.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007659","name":"Tilburg University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11590-016-1087-4","type":"journal-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T05:12:48Z","timestamp":1476421968000},"page":"1185-1199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions"],"prefix":"10.1007","volume":"11","author":[{"given":"Etienne","family":"de Klerk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fran\u00e7ois","family":"Glineur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrien B.","family":"Taylor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"1087_CR1","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Massachusetts (1999)"},{"issue":"1\u20132","key":"1087_CR2","doi-asserted-by":"crossref","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. Progr. 145(1\u20132), 451\u2013482 (2014)","journal-title":"Math. Progr."},{"key":"1087_CR3","doi-asserted-by":"crossref","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming. Springer, Berlin (2008)","DOI":"10.1007\/978-0-387-74503-9"},{"key":"1087_CR4","unstructured":"Neelakantan, A., Vilnis, L., Le, Q.V., Sutskever, I., Kaiser, L., Kurach, K., Martens, J.: Adding gradient noise improves learning for very deep networks (2015). arXiv:1511.06807v1"},{"key":"1087_CR5","unstructured":"Nemirovski, A.: Optimization II: numerical methods for nonlinear continuous optimization. In: Lecture Notes (1999). http:\/\/www2.isye.gatech.edu\/~nemirovs\/Lect_OptII.pdf"},{"key":"1087_CR6","unstructured":"Nemirovski, A., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"1087_CR7","doi-asserted-by":"crossref","unstructured":"Nesterov, Yu.: Introductory lectures on convex optimization: a basic course. In: Applied Optimization. Kluwer Academic Publ., Boston (2004)","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"1087_CR8","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Science & Business Media, Berlin (2006)"},{"key":"1087_CR9","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"key":"1087_CR10","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case performance of first-order methods for composite convex optimization (2015). arXiv:1512.07516"},{"key":"1087_CR11","doi-asserted-by":"publisher","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Smooth strongly convex interpolation and exact worst-case performance of first-order methods. Math. Progr. (2016). doi: 10.1007\/s10107-016-1009-3","DOI":"10.1007\/s10107-016-1009-3"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1087-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1087-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1087-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T11:58:48Z","timestamp":1568462328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1087-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,14]]},"references-count":11,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["1087"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1087-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,14]]}}}