{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T18:09:31Z","timestamp":1748369371692},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T00:00:00Z","timestamp":1661126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10589-022-00401-y","type":"journal-article","created":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T19:02:49Z","timestamp":1661194969000},"page":"615-649","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Generalized Nesterov\u2019s accelerated proximal gradient algorithms with convergence rate of order o(1\/k2)"],"prefix":"10.1007","volume":"83","author":[{"given":"Huynh","family":"Van Ngai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ta Anh","family":"Son","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"issue":"3","key":"401_CR1","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward\u2013backward method is actually faster $$O(1\/k^2)$$. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"401_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-016-0992-8","volume":"168","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Chbani, Z., Peypouquet, J., Redont, P.: Fast convergence of inertial dynamics and algorithms with asymptotic vanishing damping. Math. Program. 168(1\u20132), 123\u2013175 (2018)","journal-title":"Math. Program."},{"key":"401_CR3","volume-title":"Splitting Algorithms, Modern Operator Theory, and Applications","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Peypouquet, J.: Convergence rate of proximal inertial algorithms associated with Moreau envelopes of convex functions. In: Bauschke, H., Burachik, R., Luke, D. (eds.) Splitting Algorithms, Modern Operator Theory, and Applications. Springer, Berlin (2019)"},{"issue":"1","key":"401_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 shinkage-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"issue":"3\u20134","key":"401_CR5","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":"401_CR6","unstructured":"Bubbeck, S., Lee, J.T., Singh, M.: A geometric alternative to Nesterov\u2019s accelerated gradient descent. Preprint, arXiv:1506.08187 (2015)"},{"key":"401_CR7","series-title":"CMS Books in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"H Bauschke","year":"2011","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics, Springer, New York (2011)"},{"key":"401_CR8","unstructured":"Chen, S., Ma, S., Liu, W.: Geometric descent method for convex composite minimization. Preprint, arXiv:1612.09034 (2016)"},{"issue":"1","key":"401_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/16M1072528","volume":"28","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Fazel, M., Roy, S.: An optimal first order method based on optimal quadratic averaging. SIAM J. Optim. 28(1), 251\u2013271 (2018)","journal-title":"SIAM J. Optim."},{"key":"401_CR10","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., Mol, C.D.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57, 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"key":"401_CR11","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"AT Figueiredo","year":"2007","unstructured":"Figueiredo, A.T., Nowark, R.D., Wright, S.J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Singal Process. 1, 586\u2013597 (2007)","journal-title":"IEEE J. Sel. Top. Singal Process."},{"key":"401_CR12","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 spaces. Bull. Am. Math. Soc. 70, 709\u2013710 (1964)","journal-title":"Bull. Am. Math. Soc."},{"key":"401_CR13","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. Ser. A 159, 81\u2013107 (2016)","journal-title":"Math. Program. Ser. A"},{"key":"401_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(66)90114-5","volume":"6","author":"ES Levittin","year":"1966","unstructured":"Levittin, E.S., Polyak, B.T.: Constrained minimization problems. USSR Comput. Math. Math. Phys. 6, 1\u201350 (1966)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"401_CR15","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16, 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"key":"401_CR16","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $$O(1\/k^2)$$. Doklady AN SSSR (translated as Soviet Math.Docl.) 269, 543\u2013547 (1983)"},{"key":"401_CR17","volume-title":"Introductory Lectures on Convex Optimization: Basis Course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: Basis Course. Kluwer, Boston (2003)"},{"key":"401_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. Ser. A 103, 127\u2013152 (2005)","journal-title":"Math. Program. Ser. A"},{"key":"401_CR19","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 minimization composite objective functions. Math. Prog. Ser. A 140, 125\u2013161 (2013)","journal-title":"Math. Prog. Ser. A"},{"key":"401_CR20","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal Gradient methods for convex optimization problems. Math. Prog. Ser. A 152, 381\u2013404 (2015)","journal-title":"Math. Prog. Ser. A"},{"key":"401_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. Ser. A 175, 69\u2013107 (2019)","journal-title":"Math. Program. Ser. A"},{"key":"401_CR22","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1090\/S0002-9904-1967-11761-0","volume":"73","author":"Z Opial","year":"1967","unstructured":"Opial, Z.: Weak convergence of the sequence of successive approximations of nonexpansive mappings. Bull. Am. Math. Soc. 73, 591\u2013597 (1967)","journal-title":"Bull. Am. Math. Soc."},{"key":"401_CR23","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1, 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"key":"401_CR24","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1051\/0004-6361:20021571","volume":"398","author":"JL Starck","year":"2003","unstructured":"Starck, J.L., Donoho, D.L., Cand\u00e8s, E.J.: Astronomical image representation by curevelet transform. Astron. Astrophys. 398, 785\u2013800 (2003)","journal-title":"Astron. Astrophys."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00401-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00401-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00401-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T12:19:14Z","timestamp":1664453954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00401-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,22]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["401"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00401-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,22]]},"assertion":[{"value":"8 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}