{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:38:07Z","timestamp":1777675087537,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T00:00:00Z","timestamp":1656720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T00:00:00Z","timestamp":1656720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC-11671195"],"award-info":[{"award-number":["NSFC-11671195"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC-11922111, 11771208"],"award-info":[{"award-number":["NSFC-11922111, 11771208"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC-11771208"],"award-info":[{"award-number":["NSFC-11771208"]}],"id":[{"id":"10.13039\/501100001809","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":[[2024,7]]},"DOI":"10.1007\/s10957-022-02058-3","type":"journal-article","created":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T10:02:52Z","timestamp":1656756172000},"page":"373-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tight Ergodic Sublinear Convergence Rate of the Relaxed Proximal Point Algorithm for Monotone Variational Inequalities"],"prefix":"10.1007","volume":"202","author":[{"given":"Guoyong","family":"Gu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junfeng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,2]]},"reference":[{"key":"2058_CR1","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces In: CMS Books in Mathematics\/Ouvrages de Math\u00e9matiques de la SMC, 2nd edn. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-48311-5"},{"issue":"4","key":"2058_CR2","doi-asserted-by":"publisher","first-page":"1224","DOI":"10.1137\/05064816X","volume":"17","author":"A Beck","year":"2006","unstructured":"Beck, A.: Quadratic matrix programming. SIAM J. Optim. 17(4), 1224\u20131238 (2006)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"2058_CR3","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s11590-016-1087-4","volume":"11","author":"E de Klerk","year":"2017","unstructured":"de Klerk, E., Glineur, F., Taylor, A.B.: On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optim. Lett. 11(7), 1185\u20131199 (2017)","journal-title":"Optim. Lett."},{"issue":"1\u20132, Ser. A","key":"2058_CR4","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, Ser. A), 451\u2013482 (2014)","journal-title":"Math. Program."},{"key":"2058_CR5","doi-asserted-by":"crossref","unstructured":"Drori, Y., Teboulle, M.: An optimal variant of Kelley\u2019s cutting-plane method. Math. Program. 160(1\u20132, Ser. A), 321\u2013351 (2016)","DOI":"10.1007\/s10107-016-0985-7"},{"key":"2058_CR6","doi-asserted-by":"crossref","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I. Springer Series in Operations Research. Springer, New York (2003)","DOI":"10.1007\/b97544"},{"issue":"1\u20132","key":"2058_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10589-013-9616-x","volume":"59","author":"G Gu","year":"2014","unstructured":"Gu, G., He, B., Yuan, X.: Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach. Comput. Optim. Appl. 59(1\u20132), 135\u2013161 (2014)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"2058_CR8","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)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2058_CR9","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\u2013419 (1991)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"2058_CR10","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\u2013664 (1992)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2058_CR11","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He, B., Yuan, X.: On the $$O(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J. Numer. Anal. 50(2), 700\u2013709 (2012)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1\u20132, Ser. A","key":"2058_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-021-01643-0","volume":"190","author":"D Kim","year":"2021","unstructured":"Kim, D.: Accelerated proximal point method for maximally monotone operators. Math. Program. 190(1\u20132, Ser. A), 57\u201387 (2021)","journal-title":"Math. Program."},{"issue":"1\u20132, Ser. A","key":"2058_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. 159(1\u20132, Ser. A), 81\u2013107 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"2058_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 method. J. Optim. Theory Appl. 172(1), 187\u2013205 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2058_CR15","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\u2013250 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2058_CR16","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\u20131950 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2058_CR17","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/s10957-020-01770-2","volume":"188","author":"D Kim","year":"2021","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. 188(1), 192\u2013219 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2058_CR18","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s11590-020-01617-9","volume":"15","author":"F Lieder","year":"2021","unstructured":"Lieder, F.: On the convergence rate of the Halpern-iteration. Optim. Lett. 15(2), 405\u2013418 (2021)","journal-title":"Optim. Lett."},{"key":"2058_CR19","doi-asserted-by":"crossref","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fr. Informat. Rech. Op\u00e9r. 4(Ser. R\u20133), 154\u2013158 (1970)","DOI":"10.1051\/m2an\/197004R301541"},{"issue":"1","key":"2058_CR20","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1137\/110849468","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23(1), 475\u2013507 (2013)","journal-title":"SIAM J. Optim."},{"key":"2058_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J-J Moreau","year":"1965","unstructured":"Moreau, J.-J.: Proximit\u00e9 et dualit\u00e9 dans un espace Hilbertien. Bull. Soc. Math. Fr. 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. Fr."},{"issue":"1, Ser. B","key":"2058_CR22","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Program. 120(1, Ser. B), 221\u2013259 (2009)","journal-title":"Math. Program."},{"issue":"5","key":"2058_CR23","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\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"2058_CR24","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)","journal-title":"SIAM J. Optim."},{"issue":"1\u20134","key":"2058_CR25","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\/12","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\/12(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"2058_CR26","unstructured":"Taylor, A.B.: Convex Interpolation and Performance Estimation of First-Order Methods for Convex Optimization. Ph.D. Thesis, Universite Catholique de Louvain (2017)"},{"issue":"3","key":"2058_CR27","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\u20131313 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132, Ser. A","key":"2058_CR28","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\u20132, Ser. A), 307\u2013345 (2017)","journal-title":"Math. Program."},{"issue":"2","key":"2058_CR29","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s10957-018-1298-1","volume":"178","author":"AB Taylor","year":"2018","unstructured":"Taylor, A.B., Hendrickx, J.M., Glineur, F.: Exact worst-case convergence rates of the proximal gradient method for composite convex minimization. J. Optim. Theory Appl. 178(2), 455\u2013476 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2058_CR30","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/S105262349935949X","volume":"11","author":"N Yamashita","year":"2000","unstructured":"Yamashita, N., Fukushima, M.: The proximal point algorithm with genuine superlinear convergence for the monotone complementarity problem. SIAM J. Optim. 11(2), 364\u2013379 (2000)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02058-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02058-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02058-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T08:01:42Z","timestamp":1721548902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02058-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,2]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2058"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02058-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,2]]},"assertion":[{"value":"20 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}