{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T02:10:15Z","timestamp":1773281415472,"version":"3.50.1"},"update-to":[{"DOI":"10.1007\/s10589-023-00518-8","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000}}],"reference-count":1,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10589-025-00746-0","type":"journal-article","created":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T11:27:00Z","timestamp":1761737220000},"page":"1401-1402","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Correction to: From Halpern\u2019s fixed-point iterations to Nesterov\u2019s accelerated interpretations for root-finding problems"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1077-2579","authenticated-orcid":false,"given":"Quoc","family":"Tran-Dinh","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,29]]},"reference":[{"issue":"1","key":"746_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10589-023-00518-8","volume":"87","author":"Q Tran-Dinh","year":"2024","unstructured":"Tran-Dinh, Q.: From Halpern\u2019s fixed-point iterations to Nesterov\u2019s accelerated interpretations for root-finding problems. Comput. Optim. Appl. 87(1), 181\u2013218 (2024)","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00746-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00746-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00746-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:17:24Z","timestamp":1773227844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00746-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,29]]},"references-count":1,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["746"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00746-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,29]]},"assertion":[{"value":"29 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}