{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:53:45Z","timestamp":1776884025350,"version":"3.51.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T00:00:00Z","timestamp":1655337600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T00:00:00Z","timestamp":1655337600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11590-022-01893-7","type":"journal-article","created":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T10:22:36Z","timestamp":1655374956000},"page":"643-656","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2180-5994","authenticated-orcid":false,"given":"Trung","family":"Vu","sequence":"first","affiliation":[]},{"given":"Raviv","family":"Raich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,16]]},"reference":[{"issue":"5","key":"1893_CR1","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)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"5","key":"1893_CR2","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1137\/0715065","volume":"15","author":"R Saigal","year":"1978","unstructured":"Saigal, R., Todd, M.J.: Efficient acceleration techniques for fixed point algorithms. SIAM J. Numer. Anal. 15(5), 997\u20131007 (1978)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"1893_CR3","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1137\/10078356X","volume":"49","author":"HF Walker","year":"2011","unstructured":"Walker, H.F., Ni, P.: Anderson acceleration for fixed-point iterations. SIAM J. Numer. Anal. 49(4), 1715\u20131735 (2011)","journal-title":"SIAM J. Numer. Anal."},{"key":"1893_CR4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.3389\/fams.2017.00018","volume":"3","author":"A Jung","year":"2017","unstructured":"Jung, A.: A fixed-point of view on gradient methods for big data. Front. Appl. Math. Stat. 3, 18 (2017)","journal-title":"Front. Appl. Math. Stat."},{"issue":"1","key":"1893_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01456931","volume":"71","author":"LEJ Brouwer","year":"1911","unstructured":"Brouwer, L.E.J.: \u00dcber abbildung von mannigfaltigkeiten. Math. Ann. 71(1), 97\u2013115 (1911)","journal-title":"Math. Ann."},{"issue":"1","key":"1893_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.4064\/fm-3-1-133-181","volume":"3","author":"S Banach","year":"1922","unstructured":"Banach, S.: Sur les op\u00e9rations dans les ensembles abstraits et leur application aux \u00e9quations int\u00e9grales. Fundam. Math. 3(1), 133\u2013181 (1922)","journal-title":"Fundam. Math."},{"key":"1893_CR7","volume-title":"Explorations in Numerical Analysis","author":"JV Lambers","year":"2019","unstructured":"Lambers, J.V., Mooney, A.S., Montiforte, V.A.: Explorations in Numerical Analysis. World Scientific, Singapore (2019)"},{"issue":"6","key":"1893_CR8","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1080\/00029890.1969.12000285","volume":"76","author":"A Roberts","year":"1969","unstructured":"Roberts, A.: The derivative as a linear transformation. Am. Math. Mon. 76(6), 632\u2013638 (1969)","journal-title":"Am. Math. Mon."},{"key":"1893_CR9","volume-title":"Stability Theory of Differential Equations","author":"R Bellman","year":"1953","unstructured":"Bellman, R.: Stability Theory of Differential Equations. McGraw-Hill, New York (1953)"},{"key":"1893_CR10","doi-asserted-by":"crossref","unstructured":"Abramowitz, M., Stegun, I.A.: Handbook of mathematical functions with formulas, graphs, and mathematical tables. NBS Appl. Math. Ser. 55 (1964)","DOI":"10.1115\/1.3625776"},{"key":"1893_CR11","doi-asserted-by":"crossref","unstructured":"Vu, T., Raich, R.: Local convergence of the Heavy Ball method in iterative hard thresholding for low-rank matrix completion. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 3417\u20133421 (2019)","DOI":"10.1109\/ICASSP.2019.8682312"},{"key":"1893_CR12","doi-asserted-by":"crossref","unstructured":"Vu, T., Raich, R.: Accelerating iterative hard thresholding for low-rank matrix completion via adaptive restart. In: Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 2917\u20132921 (2019)","DOI":"10.1109\/ICASSP.2019.8683082"},{"key":"1893_CR13","doi-asserted-by":"crossref","unstructured":"Vu, T., Raich, R., Fu, X.: On convergence of projected gradient descent for minimizing a large-scale quadratic over the unit sphere. In: IEEE International Workshop on Machine Learning for Signal Processing, pp. 1\u20136 (2019)","DOI":"10.1109\/MLSP.2019.8918830"},{"key":"1893_CR14","doi-asserted-by":"crossref","unstructured":"Vu, T., Raich, R.: Exact linear convergence rate analysis for low-rank symmetric matrix completion via gradient descent. In: IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3240\u20133244 (2021)","DOI":"10.1109\/ICASSP39728.2021.9413419"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01893-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01893-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01893-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T12:16:49Z","timestamp":1678277809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01893-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,16]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1893"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01893-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,16]]},"assertion":[{"value":"11 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article. Data sharing not applicable to this article as no datasets were generated or analysed during the current study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}