{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T21:49:14Z","timestamp":1775598554225,"version":"3.50.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"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":["Math. Program."],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10107-021-01643-0","type":"journal-article","created":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T15:04:25Z","timestamp":1616511865000},"page":"57-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":60,"title":["Accelerated proximal point method for maximally monotone operators"],"prefix":"10.1007","volume":"190","author":[{"given":"Donghwan","family":"Kim","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"issue":"1\u20132","key":"1643_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1011253113155","volume":"9","author":"F Alvarez","year":"2001","unstructured":"Alvarez, F., Attouch, H.: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set-Valued Anal. 9(1\u20132), 3\u201311 (2001). https:\/\/doi.org\/10.1023\/A:1011253113155","journal-title":"Set-Valued Anal."},{"issue":"3","key":"1643_CR2","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s00245-019-09584-z","volume":"80","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Cabot, A.: Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions. Appl. Math. Optim. 80(3), 547\u2013598 (2019). https:\/\/doi.org\/10.1007\/s00245-019-09584-z","journal-title":"Appl. Math. Optim."},{"issue":"1\u20132","key":"1643_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10107-019-01412-0","volume":"184","author":"H Attouch","year":"2020","unstructured":"Attouch, H., Cabot, A.: Convergence of a relaxed inertial proximal algorithm for maximally monotone operators. Math. Program. 184(1\u20132), 243\u2013287 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01412-0","journal-title":"Math. Program."},{"key":"1643_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01591-1","author":"H Attouch","year":"2020","unstructured":"Attouch, H., Chbani, Z., Fadili, J., Riahi, H.: First-order optimization algorithms via inertial systems with Hessian driven damping. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01591-1","journal-title":"Math. Program."},{"issue":"3","key":"1643_CR5","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1137\/18M1230207","volume":"29","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Chbani, Z., Riahi, H.: Fast proximal methods via time scaling of damped inertial dynamics. SIAM J. Optim. 29(3), 2227\u20132256 (2019). https:\/\/doi.org\/10.1137\/18M1230207","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1643_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-018-1252-x","volume":"174","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Peypouquet, J.: Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators. Math. Program. 174(1\u20132), 391\u2013432 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1252-x","journal-title":"Math. Program."},{"key":"1643_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-1-4419-9467-7"},{"issue":"1","key":"1643_CR8","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). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"1643_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02761171","volume":"29","author":"H Brezis","year":"1978","unstructured":"Brezis, H., Lions, P.L.: Produits infinis de resolvantes. Isr. J. Math. 29(4), 329\u2013345 (1978). https:\/\/doi.org\/10.1007\/BF02761171","journal-title":"Isr. J. Math."},{"issue":"3","key":"1643_CR10","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 \u201cFast iterative shrinkage\/thresholding algorithm\u201d. J. Optim. Theory Appl. 166(3), 968\u201382 (2015). https:\/\/doi.org\/10.1007\/s10957-015-0746-4","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1643_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal\u2013dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011). https:\/\/doi.org\/10.1007\/s10851-010-0251-1","journal-title":"J. Math. Imaging Vis."},{"key":"1643_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numer. 25, 161\u2013319 (2016). https:\/\/doi.org\/10.1017\/S096249291600009X","journal-title":"Acta Numer."},{"issue":"1","key":"1643_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primal-dual algorithm. Math. Program. 159(1), 253\u201387 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0957-3","journal-title":"Math. Program."},{"issue":"1","key":"1643_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-018-1303-3","volume":"170","author":"PL Combettes","year":"2018","unstructured":"Combettes, P.L.: Monotone operator theory in convex optimization. Math. Program. 170(1), 177\u2013206 (2018)","journal-title":"Math. Program."},{"issue":"4","key":"1643_CR15","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1137\/130940402","volume":"24","author":"E Corman","year":"2014","unstructured":"Corman, E., Yuan, X.: A generalized proximal point algorithm and its convergence rate. SIAM J. Optim. 24(4), 1614\u201338 (2014). https:\/\/doi.org\/10.1137\/130940402","journal-title":"SIAM J. Optim."},{"key":"1643_CR16","unstructured":"CVX Research Inc.: CVX: Matlab software for disciplined convex programming, version 2.0. http:\/\/cvxr.com\/cvx (2012)"},{"key":"1643_CR17","volume-title":"Splitting Methods in Communication, Imaging, Science, and Engineering","author":"D Davis","year":"2016","unstructured":"Davis, D., Yin, W.: Convergence rate analysis of several splitting schemes. In: Glowinski, R., Osher, S., Yin, W. (eds.) Splitting Methods in Communication, Imaging, Science, and Engineering. Springer, Berlin (2016)"},{"issue":"3","key":"1643_CR18","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1287\/moor.2016.0827","volume":"42","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: Faster convergence rates of relaxed Peaceman-Rachford and ADMM under regularity assumptions. Math. Oper. Res. 42(3), 783\u2013805 (2017). https:\/\/doi.org\/10.1287\/moor.2016.0827","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1643_CR19","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1090\/S0002-9947-1956-0084194-4","volume":"82","author":"J Douglas","year":"1956","unstructured":"Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 82(2), 421\u201339 (1956)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20132","key":"1643_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-019-01410-2","volume":"184","author":"Y Drori","year":"2020","unstructured":"Drori, Y., Taylor, A.B.: Efficient first-order methods for convex minimization: a constructive approach. Math. Program. 184(1\u20132), 183\u2013220 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01410-2","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1643_CR21","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). https:\/\/doi.org\/10.1007\/s10107-013-0653-0","journal-title":"Math. Program."},{"issue":"1","key":"1643_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-016-0985-7","volume":"160","author":"Y Drori","year":"2016","unstructured":"Drori, Y., Teboulle, M.: An optimal variant of Kelley\u2019s cutting-plane method. Math. Program. 160(1), 321\u201351 (2016). https:\/\/doi.org\/10.1007\/s10107-016-0985-7","journal-title":"Math. Program."},{"key":"1643_CR23","unstructured":"Eckstein, J.: The Lions\u2013Mercier splitting algorithm and the alternating direction method are instances of the proximal point method (1988). Technical report LIDS-P-1769"},{"issue":"1\u20133","key":"1643_CR24","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(1\u20133), 293\u2013318 (1992). https:\/\/doi.org\/10.1007\/BF01581204","journal-title":"Math. Program."},{"issue":"4","key":"1643_CR25","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E Esser","year":"2010","unstructured":"Esser, E., Zhang, X., Chan, T.: A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science. SIAM J. Imaging Sci. 3(4), 1015\u201346 (2010). https:\/\/doi.org\/10.1137\/09076934X","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"1643_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite-element approximations. Comput. Math. Appl. 2(1), 17\u201340 (1976). https:\/\/doi.org\/10.1016\/0898-1221(76)90003-1","journal-title":"Comput. Math. Appl."},{"key":"1643_CR27","first-page":"41","volume":"R\u20132","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marrocco, A.: Sur lapproximation par elements nis dordre un, et la resolution par penalisation-dualite dune classe de problemes de dirichlet nonlineaires, rev. francaise daut. Inf. Rech. Oper. R\u20132, 41\u201376 (1975)","journal-title":"Inf. Rech. Oper."},{"issue":"3","key":"1643_CR28","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1137\/120896219","volume":"7","author":"T Goldstein","year":"2014","unstructured":"Goldstein, T., O\u2019Donoghue, B., Setzer, S., Baraniuk, R.: Fast alternating direction optimization methods. SIAM J. Imaging Sci. 7(3), 1588\u2013623 (2014). https:\/\/doi.org\/10.1137\/120896219","journal-title":"SIAM J. Imaging Sci."},{"key":"1643_CR29","volume-title":"Point-to-Set Maps and Mathematical Programming, Mathematical Programming Studies 10","author":"EG Gol\u2019shtein","year":"1979","unstructured":"Gol\u2019shtein, E.G., Tret\u2019yakov, N.V.: Modified Lagrangians in convex programming and their generalizations. In: Huard, P. (ed.) Point-to-Set Maps and Mathematical Programming, Mathematical Programming Studies 10. Springer, Berlin (1979)"},{"key":"1643_CR30","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-84800-155-8_7","volume-title":"Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences","author":"M Grant","year":"2008","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Blondel, V., Boyd, S., Kimura, H. (eds.) Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer, Berlin (2008)"},{"key":"1643_CR31","unstructured":"Gu, G., Yang, J.: On the optimal ergodic sublinear convergence rate of the relaxed proximal point algorithm for variational inequalities (2019). arXiv:1905.06030"},{"issue":"3","key":"1643_CR32","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/19M1299049","volume":"30","author":"G Gu","year":"2020","unstructured":"Gu, G., Yang, J.: Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems. SIAM J. Optim. 30(3), 1905\u20131921 (2020). https:\/\/doi.org\/10.1137\/19M1299049","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1643_CR33","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O G\u00fcler","year":"1991","unstructured":"G\u00fcler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29(2), 403\u201319 (1991). https:\/\/doi.org\/10.1137\/0329022","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"1643_CR34","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/0802032","volume":"2","author":"O G\u00fcler","year":"1992","unstructured":"G\u00fcler, O.: New proximal point algorithms for convex minimization. SIAM J. Optim. 2(4), 649\u201364 (1992). https:\/\/doi.org\/10.1137\/0802032","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1643_CR35","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/100814494","volume":"5","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective. SIAM J. Imaging Sci. 5(1), 119\u201349 (2012). https:\/\/doi.org\/10.1137\/100814494","journal-title":"SIAM J. Imaging Sci."},{"issue":"5","key":"1643_CR36","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appl. 4(5), 303\u201320 (1969). https:\/\/doi.org\/10.1007\/BF00927673","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1643_CR37","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). https:\/\/doi.org\/10.1007\/s10107-015-0949-3","journal-title":"Math. Program."},{"issue":"1","key":"1643_CR38","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M108940X","volume":"28","author":"D Kim","year":"2018","unstructured":"Kim, D., Fessler, J.A.: Another look at the Fast Iterative Shrinkage\/Thresholding Algorithm (FISTA). SIAM J. Optim. 28(1), 223\u201350 (2018). https:\/\/doi.org\/10.1137\/16M108940X","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1643_CR39","doi-asserted-by":"publisher","first-page":"1920","DOI":"10.1137\/17m112124x","volume":"28","author":"D Kim","year":"2018","unstructured":"Kim, D., Fessler, J.A.: Generalizing the optimized gradient method for smooth convex minimization. SIAM J. Optim. 28(2), 1920\u201350 (2018). https:\/\/doi.org\/10.1137\/17m112124x","journal-title":"SIAM J. Optim."},{"key":"1643_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-020-01770-2","author":"D Kim","year":"2020","unstructured":"Kim, D., Fessler, J.A.: Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions. J. Optim. Theory Appl. (2020). https:\/\/doi.org\/10.1007\/s10957-020-01770-2","journal-title":"J. Optim. Theory Appl."},{"key":"1643_CR41","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s11590-020-01617-9","volume":"15","author":"F Lieder","year":"2020","unstructured":"Lieder, F.: On the convergence rate of the Halpern-iteration. Optim. Lett. 15, 405\u201318 (2020). https:\/\/doi.org\/10.1007\/s11590-020-01617-9","journal-title":"Optim. Lett."},{"key":"1643_CR42","unstructured":"Lieder, F.: Projection based methods for conic linear programming\u2014optimal first order complexities and norm constrained quasi newton methods (Doctoral dissertation, Universit\u00e4ts-und Landesbibliothek der Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf) (2018). https:\/\/docserv.uniduesseldorf.de\/servlets\/DerivateServlet\/Derivate-49971\/Dissertation.pdf"},{"issue":"212","key":"1643_CR43","first-page":"1","volume":"18","author":"H Lin","year":"2018","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: Catalyst acceleration for first-order convex optimization: from theory to practice. J. Mach. Learn. Res. 18(212), 1\u201354 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"6","key":"1643_CR44","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(6), 964\u201379 (1979). https:\/\/doi.org\/10.1137\/0716071","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"1643_CR45","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10851-014-0523-2","volume":"51","author":"D Lorenz","year":"2015","unstructured":"Lorenz, D., Pock, T.: An inertial forward\u2013backward algorithm for monotone inclusions. J. Math. Imaging Vis. 51(2), 311\u201325 (2015). https:\/\/doi.org\/10.1007\/s10851-014-0523-2","journal-title":"J. Math. Imaging Vis."},{"key":"1643_CR46","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle 4, 154\u20138 (1970)","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"issue":"3","key":"1643_CR47","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1215\/S0012-7094-62-02933-2","volume":"29","author":"GJ Minty","year":"1962","unstructured":"Minty, G.J.: Monotone (nonlinear) operators in Hilbert space. Duke Math. J. 29(3), 341\u20136 (1962). https:\/\/doi.org\/10.1215\/S0012-7094-62-02933-2","journal-title":"Duke Math. J."},{"key":"1643_CR48","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2140\/pjm.1964.14.243","volume":"14","author":"GJ Minty","year":"1964","unstructured":"Minty, G.J.: On the monotonicity of the gradient of a convex function. Pac. J. Math. 14, 243\u20137 (1964)","journal-title":"Pac. J. Math."},{"key":"1643_CR49","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France 93, 273\u201399 (1965)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France"},{"key":"1643_CR50","unstructured":"Nemirovski, A.: Efficient methods in convex programming (1994). http:\/\/www2.isye.gatech.edu\/~nemirovs\/Lect_EMCO.pdf. visited on 05\/2019"},{"issue":"3","key":"1643_CR51","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":"1643_CR52","first-page":"509","volume":"24","author":"Y Nesterov","year":"1988","unstructured":"Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex functions. Ekonomika i Mateaticheskie Metody 24, 509\u2013517 (1988). in Russian","journal-title":"Ekonomika i Mateaticheskie Metody"},{"issue":"1","key":"1643_CR53","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). https:\/\/doi.org\/10.1007\/s10107-012-0629-5","journal-title":"Math. Program."},{"issue":"3","key":"1643_CR54","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., Candes, E.: Adaptive restart for accelerated gradient schemes. Found. Comput. Math. 15(3), 715\u201332 (2015). https:\/\/doi.org\/10.1007\/s10208-013-9150-3","journal-title":"Found. Comput. Math."},{"issue":"5","key":"1643_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964). https:\/\/doi.org\/10.1016\/0041-5553(64)90137-5","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1643_CR56","first-page":"283","volume-title":"Optimization","author":"MJD Powell","year":"1969","unstructured":"Powell, M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R. (ed.) Optimization, pp. 283\u2013298. Academic Press, New York (1969)"},{"key":"1643_CR57","first-page":"397","volume-title":"Nonlinear Functional Analysis, Part 1","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Monotone operators associated with saddle functions and minimax problems. In: Browder, F.E. (ed.) Nonlinear Functional Analysis, Part 1, vol. 18, pp. 397\u2013407. American Mathematical Society, New York (1970)"},{"issue":"2","key":"1643_CR58","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976). https:\/\/doi.org\/10.1287\/moor.1.2.97","journal-title":"Math. Oper. Res."},{"issue":"5","key":"1643_CR59","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u201398 (1976). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1643_CR60","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":"3","key":"1643_CR61","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1137\/19M1304854","volume":"30","author":"EK Ryu","year":"2020","unstructured":"Ryu, E.K., Taylor, A.B., Bergeling, C., Giselsson, P.: Operator splitting performance estimation: tight contraction factors and optimal parameter selection. SIAM J. Optim. 30(3), 2251\u20132271 (2020). https:\/\/doi.org\/10.1137\/19M1304854","journal-title":"SIAM J. Optim."},{"key":"1643_CR62","unstructured":"Ryu, E.K., Yin, W.: Large-scale convex optimization via monotone operators (2020). https:\/\/large-scale-book.mathopt.com\/LSCOMO.pdf. visited on 03\/2021"},{"key":"1643_CR63","unstructured":"Shi, B., Du, S.S., Jordan, M.I., Su, W.J.: Understanding the acceleration phenomenon via high-resolution differential equations (2018). arXiv:1810.08907"},{"issue":"153","key":"1643_CR64","first-page":"1","volume":"17","author":"W Su","year":"2016","unstructured":"Su, W., Boyd, S., Candes, 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."},{"key":"1643_CR65","unstructured":"Taylor, A.B., Bach, F.: Stochastic first-order methods: non-asymptotic and computer-aided analyses via potential functions. In: Proceedings of the Conference on Learning Theory, pp. 2934\u20132992 (2019)"},{"issue":"3","key":"1643_CR66","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\u2013313 (2017). https:\/\/doi.org\/10.1137\/16m108104x","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1643_CR67","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), 307\u201345 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1009-3","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01643-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01643-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01643-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T17:17:18Z","timestamp":1724692638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01643-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,23]]},"references-count":67,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["1643"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01643-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,23]]},"assertion":[{"value":"23 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}