{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T18:54:07Z","timestamp":1775156047528,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T00:00:00Z","timestamp":1525651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T00:00:00Z","timestamp":1525651200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000002","name":"National Institutes of Health","doi-asserted-by":"publisher","award":["U01 EB018753"],"award-info":[{"award-number":["U01 EB018753"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10957-018-1287-4","type":"journal-article","created":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T19:38:59Z","timestamp":1525721939000},"page":"240-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Adaptive Restart of the Optimized Gradient Method for Convex Optimization"],"prefix":"10.1007","volume":"178","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1816-5917","authenticated-orcid":false,"given":"Donghwan","family":"Kim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9998-3315","authenticated-orcid":false,"given":"Jeffrey A.","family":"Fessler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,7]]},"reference":[{"issue":"5","key":"1287_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MSP.2014.2329397","volume":"31","author":"V Cevher","year":"2014","unstructured":"Cevher, V., Becker, S., Schmidt, M.: Convex optimization for big data: scalable, randomized, and parallel algorithms for big data analytics. IEEE Signal Process. Mag. 31(5), 32\u201343 (2014). \n                    https:\/\/doi.org\/10.1109\/MSP.2014.2329397","journal-title":"IEEE Signal Process. Mag."},{"issue":"3","key":"1287_CR2","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $$O(1\/k^2)$$. Dokl. Akad. Nauk. USSR 269(3), 543\u20137 (1983)","journal-title":"Dokl. Akad. Nauk. USSR"},{"key":"1287_CR3","doi-asserted-by":"publisher","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. Kluwer, Boston (2004). \n                    https:\/\/doi.org\/10.1007\/978-1-4419-8853-9"},{"issue":"1","key":"1287_CR4","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). \n                    https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"issue":"3","key":"1287_CR5","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s10208-013-9150-3","volume":"15","author":"B O\u2019Donoghue","year":"2015","unstructured":"O\u2019Donoghue, B., Cand\u00e8s, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u201332 (2015). \n                    https:\/\/doi.org\/10.1007\/s10208-013-9150-3","journal-title":"Found. Comput. Math."},{"key":"1287_CR6","doi-asserted-by":"publisher","unstructured":"Giselsson, P., Boyd, S.: Monotonicity and restart in fast gradient methods. In: Proceedings of Conference on Decision and Control, pp. 5058\u20135063 (2014). \n                    https:\/\/doi.org\/10.1109\/CDC.2014.7040179","DOI":"10.1109\/CDC.2014.7040179"},{"issue":"153","key":"1287_CR7","first-page":"1","volume":"17","author":"W Su","year":"2016","unstructured":"Su, W., Boyd, S., Cand\u00e8s, E.J.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: theory and insights. J. Mach. Learn. Res. 17(153), 1\u201343 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"1287_CR8","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1109\/TMI.2014.2363034","volume":"34","author":"MJ Muckley","year":"2015","unstructured":"Muckley, M.J., Noll, D.C., Fessler, J.A.: Fast parallel MR image reconstruction via B1-based, adaptive restart, iterative soft thresholding algorithms (BARISTA). IEEE Trans. Med. Imaging 34(2), 578\u201388 (2015). \n                    https:\/\/doi.org\/10.1109\/TMI.2014.2363034","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"1","key":"1287_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10589-015-9802-0","volume":"64","author":"RDC Monteiro","year":"2016","unstructured":"Monteiro, R.D.C., Ortiz, C., Svaiter, B.F.: An adaptive accelerated first-order method for convex optimization. Comput. Optim. Appl. 64(1), 31\u201373 (2016). \n                    https:\/\/doi.org\/10.1007\/s10589-015-9802-0","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1287_CR10","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). \n                    https:\/\/doi.org\/10.1007\/s10107-015-0949-3","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1287_CR11","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\u201382 (2014). \n                    https:\/\/doi.org\/10.1007\/s10107-013-0653-0","journal-title":"Math. Program."},{"key":"1287_CR12","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). \n                    https:\/\/doi.org\/10.1016\/j.jco.2016.11.001","journal-title":"J. Complex."},{"key":"1287_CR13","unstructured":"Kim, D., Fessler, J.A.: Generalizing the optimized gradient method for smooth convex minimization (2016). \n                    arXiv:1607.06764"},{"issue":"1","key":"1287_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10957-016-1018-7","volume":"172","author":"D Kim","year":"2017","unstructured":"Kim, D., Fessler, J.A.: On the convergence analysis of the optimized gradient methods. J. Optim. Theory Appl. 172(1), 187\u2013205 (2017). \n                    https:\/\/doi.org\/10.1007\/s10957-016-1018-7","journal-title":"J. Optim. Theory Appl."},{"key":"1287_CR15","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case convergence rates of the proximal gradient method for composite convex minimization (2017). \n                    arXiv:1705.04398"},{"issue":"1","key":"1287_CR16","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\u201361 (2013). \n                    https:\/\/doi.org\/10.1007\/s10107-012-0629-5","journal-title":"Math. Program."},{"issue":"3","key":"1287_CR17","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\u201382 (2015). \n                    https:\/\/doi.org\/10.1007\/s10957-015-0746-4","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1287_CR18","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/LCSYS.2017.2722406","volume":"2","author":"B Van Scoy","year":"2018","unstructured":"Van Scoy, B., Freeman, R.A., Lynch, K.M.: The fastest known globally convergent first-order method for minimizing strongly convex functions. IEEE Control Syst. Lett. 2(1), 49\u201354 (2018). \n                    https:\/\/doi.org\/10.1109\/LCSYS.2017.2722406","journal-title":"IEEE Control Syst. Lett."},{"key":"1287_CR19","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software Inc, New York (1987)"},{"issue":"1","key":"1287_CR20","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). \n                    https:\/\/doi.org\/10.1137\/15M1009597","journal-title":"SIAM J. Optim."},{"key":"1287_CR21","volume-title":"Fundamental Methods of Mathematical Economics","author":"A Chiang","year":"1984","unstructured":"Chiang, A.: Fundamental Methods of Mathematical Economics. McGraw-Hill, New York (1984)"},{"issue":"1","key":"1287_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJD Powell","year":"1977","unstructured":"Powell, M.J.D.: Restart procedures for the conjugate gradient method. Math. Program. 12(1), 241\u201354 (1977). \n                    https:\/\/doi.org\/10.1007\/bf01593790","journal-title":"Math. Program."},{"key":"1287_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006). \n                    https:\/\/doi.org\/10.1007\/978-0-387-40065-5","edition":"2"},{"key":"1287_CR24","unstructured":"Nemirovski, A.: Efficient methods in convex programming (1994). \n                    http:\/\/www2.isye.gatech.edu\/~nemirovs\/Lect_EMCO.pdf\n                    \n                  . Lecture notes"},{"key":"1287_CR25","unstructured":"Fercoq, O., Qu, Z.: Restarting accelerated gradient methods with a rough strong convexity estimate (2016). \n                    arXiv:1609.07358"},{"key":"1287_CR26","unstructured":"Fercoq, O., Qu, Z.: Adaptive restart of accelerated gradient methods under local quadratic growth condition (2017). \n                    arXiv:1709.02300"},{"key":"1287_CR27","doi-asserted-by":"publisher","unstructured":"Combettes, P.L., Pesquet, J.C.: Proximal splitting methods in signal processing. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H., (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer, New York, NY (2011). \n                    https:\/\/doi.org\/10.1007\/978-1-4419-9569-8_10","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"1287_CR28","unstructured":"Kim, D., Fessler, J.A.: Adaptive restart of the optimized gradient method for convex optimization (2017). \n                    arXiv:1703.04641"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-018-1287-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1287-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1287-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:30:40Z","timestamp":1589722240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-018-1287-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1287"],"URL":"https:\/\/doi.org\/10.1007\/s10957-018-1287-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,7]]},"assertion":[{"value":"20 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}