{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T15:28:44Z","timestamp":1787239724402,"version":"build-2736575974"},"reference-count":24,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2012259"],"award-info":[{"award-number":["DMS-2012259"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM Rev."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:p>While Nesterov's algorithm for computing the minimum of a convex function is now over forty years old, it is rarely presented in texts for a first course in optimization. This is unfortunate since for many problems this algorithm is superior to the ubiquitous steepest descent algorithm, and it is equally simple to implement. This article presents an elementary analysis of Nesterov's algorithm that parallels that of steepest descent. It is envisioned that this presentation of Nesterov's algorithm could easily be covered in a few lectures following the introductory material on convex functions and steepest descent included in every course on optimization.<\/jats:p>","DOI":"10.1137\/21m1390037","type":"journal-article","created":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T10:05:24Z","timestamp":1683540324000},"page":"539-562","source":"Crossref","is-referenced-by-count":17,"title":["Nesterov's Method for Convex Optimization"],"prefix":"10.1137","volume":"65","author":[{"given":"Noel J.","family":"Walkington","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2023,5,9]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00375127"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.1"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/18M1230207"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-015-0746-4"},{"key":"atypb7","first-page":"14","volume":"50","author":"Chan T. F.","year":"2003","journal-title":"Notices Amer. Math. Soc."},{"key":"atypb8","volume-title":"Collection Math\u00e9matiques Appliqu\u00e9es pour la Ma\\^\\itrise","author":"Ciarlet P. G.","year":"1982"},{"key":"atypb9","volume-title":"Introduction to Numerical Linear Algebra and Optimisation","author":"Ciarlet P. G.","year":"1988"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971200"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971088"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78977-4"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562419020042"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970920"},{"key":"atypb15","volume-title":"Introductory Lectures on Convex Programming","author":"Nesterov Y.","year":"1998"},{"key":"atypb16","first-page":"543","volume":"269","author":"Nesterov Y. E.","year":"1983","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"atypb17","volume-title":"Numerical Analysis. A Second Course. Computer Science and Applied Mathematics","author":"Ortega J. M.","year":"1972"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-021-01615-8"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(92)90242-F"},{"key":"atypb21","volume-title":"Math. Surv. Monogr. 49","author":"Showalter R. E.","year":"1997"},{"key":"atypb22","volume-title":"Linear Algebra and Its Applications","author":"Strang G.","year":"1976"},{"key":"atypb23","first-page":"153","volume":"17","author":"Su W.","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"atypb24","volume-title":"Iterative Solution of Large Linear Systems","author":"Young D. M.","year":"1971"}],"container-title":["SIAM Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/21M1390037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T14:46:37Z","timestamp":1787237197000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/21M1390037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.1137\/21M1390037"],"URL":"https:\/\/doi.org\/10.1137\/21m1390037","relation":{},"ISSN":["0036-1445","1095-7200"],"issn-type":[{"value":"0036-1445","type":"print"},{"value":"1095-7200","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5]]}}}