{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:36:13Z","timestamp":1783578973077,"version":"3.55.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T00:00:00Z","timestamp":1594252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T00:00:00Z","timestamp":1594252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003484","name":"Heinrich-Heine-Universit\u00e4t D\u00fcsseldorf","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003484","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this work, we give a tight estimate of the rate of convergence for the Halpern-iteration for approximating a fixed point of a nonexpansive mapping in a Hilbert space. Specifically, using semidefinite programming and duality we prove that the norm of the residuals is upper bounded by the distance of the initial iterate to the closest fixed point divided by the number of iterations plus one.<\/jats:p>","DOI":"10.1007\/s11590-020-01617-9","type":"journal-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T16:06:43Z","timestamp":1594310803000},"page":"405-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":61,"title":["On the convergence rate of the Halpern-iteration"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5276-2010","authenticated-orcid":false,"given":"Felix","family":"Lieder","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"issue":"2","key":"1617_CR1","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s11856-013-0045-4","volume":"199","author":"R Cominetti","year":"2014","unstructured":"Cominetti, R., Soto, J.A., Vaisman, J.: On the rate of convergence of Krasnoselskii\u2013Mann iterations and their connection with sums of Bernoullis. Isr. J. Math. 199(2), 757\u2013772 (2014)","journal-title":"Isr. J. Math."},{"key":"1617_CR2","doi-asserted-by":"crossref","unstructured":"Gu, G., Yang, J.: Optimal nonergodic sublinear convergence rate of proximal point algorithm for maximal monotone inclusion problems (2019). arXiv preprint arXiv:1904.05495","DOI":"10.1137\/19M1299049"},{"key":"1617_CR3","unstructured":"Gu, G., Yang, J.: On the optimal linear convergence factor of the relaxed proximal point algorithm for monotone inclusion problems (2019). arXiv preprint arXiv:1905.04537"},{"key":"1617_CR4","unstructured":"Gu, G., Yang, J.: On the optimal ergodic sublinear convergence rate of the relaxed proximal point algorithm for variational inequalities (2019). arXiv preprint arXiv:1905.06030"},{"issue":"6","key":"1617_CR5","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1090\/S0002-9904-1967-11864-0","volume":"73","author":"B Halpern","year":"1967","unstructured":"Halpern, B.: Fixed points of nonexpanding maps. Bull. Am. Math. Soc. 73(6), 957\u2013961 (1967)","journal-title":"Bull. Am. Math. Soc."},{"key":"1617_CR6","unstructured":"Kim, D.: Accelerated proximal point method for maximally monotone operators (2019). arXiv preprint arXiv:1905.05149"},{"key":"1617_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.4064\/fm-22-1-77-108","volume":"22","author":"MD Kirszbraun","year":"1934","unstructured":"Kirszbraun, M.D.: \u00dcber die zusammenziehende und Lipschitzsche Transformationen. Fund. Math. 22, 77\u2013108 (1934)","journal-title":"Fund. Math."},{"issue":"3","key":"1617_CR8","doi-asserted-by":"publisher","first-page":"2764","DOI":"10.1016\/j.aim.2010.10.002","volume":"226","author":"U Kohlenbach","year":"2011","unstructured":"Kohlenbach, U.: On quantitative versions of theorems due to FE Browder and R Wittmann. Adv. Math. 226(3), 2764\u20132795 (2011)","journal-title":"Adv. Math."},{"issue":"5","key":"1617_CR9","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1016\/j.aim.2012.06.028","volume":"231","author":"U Kohlenbach","year":"2012","unstructured":"Kohlenbach, U., Leu\u015ftean, L.: Effective metastability of Halpern iterates in CAT (0) spaces. Adv. Math. 231(5), 2526\u20132556 (2012)","journal-title":"Adv. Math."},{"issue":"11","key":"1617_CR10","first-page":"1680","volume":"13","author":"L Leustean","year":"2007","unstructured":"Leustean, L.: Rates of asymptotic regularity for halpern iterations of nonexpansive mappings. J. UCS 13(11), 1680\u20131691 (2007)","journal-title":"J. UCS"},{"key":"1617_CR11","unstructured":"Lofberg, J.: YALMIP: a toolbox for modeling and optimization in MATLAB. In: 2004 IEEE International Symposium on Computer Aided Control Systems Design, IEEE, pp. 284\u2013289 (2004)"},{"key":"1617_CR12","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.uni-duesseldorf.de\/servlets\/DerivateServlet\/Derivate-49971\/Dissertation.pdf"},{"issue":"6","key":"1617_CR13","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1080\/1055678021000045123","volume":"17","author":"JF Sturm","year":"2002","unstructured":"Sturm, J.F.: Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optim. Methods Softw. 17(6), 1105\u20131154 (2002)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1617_CR14","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1137\/16M105592X","volume":"27","author":"S Sabach","year":"2017","unstructured":"Sabach, S., Shtern, S.: A first order method for solving convex bilevel optimization problems. SIAM J. Optim. 27(2), 640\u2013660 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1617_CR15","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), 307\u2013345 (2017)","journal-title":"Math. Program."},{"key":"1617_CR16","unstructured":"Ryu, E.K., Taylor, A.B., Bergeling, C., Giselsson, P.: Operator splitting performance estimation: tight contraction factors and optimal parameter selection (2018). arXiv preprint arXiv:1812.00146"},{"issue":"5","key":"1617_CR17","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/BF01190119","volume":"58","author":"R Wittmann","year":"1992","unstructured":"Wittmann, R.: Approximation of fixed points of nonexpansive mappings. Arch. der Math. 58(5), 486\u2013491 (1992)","journal-title":"Arch. der Math."},{"issue":"1","key":"1617_CR18","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1112\/S0024610702003332","volume":"66","author":"HK Xu","year":"2002","unstructured":"Xu, H.K.: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 66(1), 240\u2013256 (2002)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01617-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01617-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01617-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T00:46:16Z","timestamp":1625791576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01617-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,9]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1617"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01617-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,9]]},"assertion":[{"value":"30 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The author declares that he has no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}