{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T05:50:45Z","timestamp":1775541045049,"version":"3.50.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tsp.2026.3672998","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T20:17:37Z","timestamp":1773692257000},"page":"1341-1356","source":"Crossref","is-referenced-by-count":0,"title":["Estimating Sequences With Memory for Minimizing Convex Nonsmooth Composite Functions"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7971-1483","authenticated-orcid":false,"given":"Endrit","family":"Dosti","sequence":"first","affiliation":[{"name":"Department of Information and Communications Engineering, Aalto University, Espoo, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7249-647X","authenticated-orcid":false,"given":"Sergiy A.","family":"Vorobyov","sequence":"additional","affiliation":[{"name":"Department of Information and Communications Engineering, Aalto University, Espoo, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4800-6738","authenticated-orcid":false,"given":"Themistoklis","family":"Charalambous","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2024.109865"},{"issue":"2","key":"ref3","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate $\\mathcal{O}(1\/k^{2})$","volume":"269","author":"Nesterov","year":"1983","journal-title":"Doklady AN USSR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4"},{"key":"ref5","first-page":"658","article-title":"From averaging to acceleration, there is only a step-size","volume-title":"Proc. Conf. Learn. Theory","author":"Flammarion","year":"2015"},{"issue":"153","key":"ref6","first-page":"1","article-title":"A differential equation for modeling Nesterov\u2019s accelerated gradient method: Theory and insights","volume":"17","author":"Su","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1614734113"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0653-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01839-y"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/2400000036"},{"key":"ref11","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"Nemirovsky","year":"1983"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2866409"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0790-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0089-x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/20M134705X"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8"},{"issue":"155","key":"ref18","first-page":"1","article-title":"Estimate sequences for stochastic composite optimization: Variance reduction, acceleration, and robustness to noise","volume":"21","author":"Kulunchakov","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref19","first-page":"88","article-title":"From Nesterov\u2019s estimate sequence to Riemannian acceleration","volume-title":"Proc. Conf. Learn. Theory","author":"Ahn","year":"2020"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053189"},{"key":"ref21","article-title":"Estimate sequence methods: Extensions and approximations","volume-title":"Inst. for Oper. Res.","author":"Baes","year":"2009"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0686-4"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2988614"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2022.108889"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/isit50566.2022.9834684"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC51059.2022.9993313"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-024-00259-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref32","article-title":"CVX: Matlab software for disciplined convex programming (web page and software)","author":"Grant","year":"2009"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0029-5"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/11345506\/11435228.pdf?arnumber=11435228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T04:56:16Z","timestamp":1775537776000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11435228\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/tsp.2026.3672998","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}