{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:38:25Z","timestamp":1775068705414,"version":"3.50.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tsp.2025.3595590","type":"journal-article","created":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T17:36:28Z","timestamp":1755106588000},"page":"3331-3345","source":"Crossref","is-referenced-by-count":2,"title":["Constrained Stochastic Recursive Momentum Successive Convex Approximation"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8588-6530","authenticated-orcid":false,"given":"Basil M.","family":"Idrees","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, IIT Kanpur, Kanpur, Uttar Pradesh, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5796-6864","authenticated-orcid":false,"given":"Lavish","family":"Arora","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, IIT Kanpur, Kanpur, Uttar Pradesh, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4508-0062","authenticated-orcid":false,"given":"Ketan","family":"Rajawat","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, IIT Kanpur, Kanpur, Uttar Pradesh, India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP58920.2024.10734740"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364914528132"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2022.3187542"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8967788"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CDC49753.2023.10384034"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981586"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3244326"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2896243"},{"key":"ref9","first-page":"16773","article-title":"A feasible level proximal point method for nonconvex sparse constrained optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Boob","year":"2020"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-022-00384-w"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3178"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-024-02057-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01742-y"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.0193"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2925601"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2871389"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2019.2963032"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2905813"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3079807"},{"key":"ref20","first-page":"15236","article-title":"Momentum-based variance reduction in non-convex SGD","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cutkosky","year":"2019"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2637317"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2637314"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2531627"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7953048"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461449"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3033354"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3094971"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2024.3461963"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01822-7"},{"key":"ref30","first-page":"20571","article-title":"Storm+: Fully adaptive SGD with recursive momentum for nonconvex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Levy","year":"2021"},{"key":"ref31","article-title":"Hybrid stochastic gradient descent algorithms for stochastic nonconvex optimization","author":"Tran-Dinh","year":"2019"},{"key":"ref32","article-title":"SpiderBoost and momentum: Faster variance reduction algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Wang","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-022-02132-w"},{"issue":"110","key":"ref34","first-page":"1","article-title":"ProxSARAH: An efficient algorithmic framework for stochastic composite nonconvex optimization","volume":"21","author":"Pham","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-022-00358-y"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19310110205"},{"key":"ref37","article-title":"Ocean prediction - Modelling for the future","author":"Organization","year":"2024"},{"key":"ref38","article-title":"Mercator ocean international","year":"2024"},{"key":"ref39","article-title":"Copernicus marine service","year":"2024"},{"key":"ref40","article-title":"Noaa tides & currents","year":"2024"},{"key":"ref41","article-title":"A better way to study ocean currents, MIT news","author":"Zewe","year":"2024"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1126\/science.1115255"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561626"},{"key":"ref44","first-page":"2613","article-title":"Sarah a novel method for machine learning problems using stochastic recursive gradient","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Nguyen","year":"2017"},{"issue":"1","key":"ref45","first-page":"4232","article-title":"Stochastic conditional gradient methods: From convex minimization to submodular maximization","volume":"21","author":"Mokhtari","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02297-y"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2601299"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-012-9920-5"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980280"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2719760"},{"key":"ref51","article-title":"Matlab","year":"2024"},{"key":"ref52","article-title":"Linear or quadratic objective with quadratic constraints","year":"2024"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2022.111907"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2016.XII.047"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/10807692\/11123750.pdf?arnumber=11123750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:35:57Z","timestamp":1758044157000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11123750\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":54,"URL":"https:\/\/doi.org\/10.1109\/tsp.2025.3595590","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}