{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:51:43Z","timestamp":1776887503568,"version":"3.51.2"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001429","name":"Indo-US Science and Technology Forum","doi-asserted-by":"publisher","award":["IUSSTF\/2018400"],"award-info":[{"award-number":["IUSSTF\/2018400"]}],"id":[{"id":"10.13039\/501100001429","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tsp.2018.2890368","type":"journal-article","created":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T19:39:55Z","timestamp":1546371595000},"page":"1338-1352","source":"Crossref","is-referenced-by-count":78,"title":["Online Learning With Inexact Proximal Online Gradient Descent Algorithms"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2649-7524","authenticated-orcid":false,"given":"Rishabh","family":"Dixit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8807-2695","authenticated-orcid":false,"given":"Amrit Singh","family":"Bedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruchi","family":"Tripathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4508-0062","authenticated-orcid":false,"given":"Ketan","family":"Rajawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","author":"derenick","year":"2009","journal-title":"A Convex Optimization Framework for Multi-Agent Motion Planning"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0472-0"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2695450"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref31","first-page":"198","article-title":"On stochastic proximal-point method for convex-composite optimization","author":"nedi?","year":"0","journal-title":"Proc IEEE 55th Annu Allerton Conf Commun Control Comput"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2016.2598788"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/080726380"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6594-6_11"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499362111"},{"key":"ref34","first-page":"449","article-title":"Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient","author":"yang","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33786-4_10"},{"key":"ref40","first-page":"2329","article-title":"Asynchronous stochastic proximal optimization algorithms with variance reduction","author":"meng","year":"2017","journal-title":"AAAI"},{"key":"ref11","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"0","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref13","first-page":"732","article-title":"Improved dynamic regret for non-degenerate functions","author":"zhang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383847"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref16","first-page":"398","article-title":"Online optimization: Competing with dynamic comparators","author":"jadbabaie","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref17","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"ref19","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2007.909833"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2216537"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/17M1135086"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282771"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2331344"},{"key":"ref5","first-page":"404","article-title":"Online robust PCA via stochastic optimization","author":"feng","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","article-title":"Online robust subspace tracking from partial information","author":"he","year":"2011","journal-title":"arXiv 1109 3827"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cviu.2013.11.009"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-008-9302-x"},{"key":"ref9","first-page":"369","article-title":"Practical ReProCS for separating sparse and low-dimensional signal sequences from their sum: Part 2","author":"guo","year":"0","journal-title":"Proc IEEE Global Conf Signal Inf Process"},{"key":"ref1","article-title":"Time varying optimization via inexact proximal online gradient descent","author":"dixit","year":"0","journal-title":"Proc 52nd Asilomar Conf Signals Syst Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref22","article-title":"Time-varying convex optimization via time-varying averaged operators","author":"simonetto","year":"2017","journal-title":"arXiv 1704 07338"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2797423"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995586"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497331063"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/110830629"},{"key":"ref23","article-title":"Asynchronous and distributed tracking of time-varying fixed points","author":"bernstein","year":"2018","journal-title":"arXiv 1804 09768"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-013-0555-4"},{"key":"ref25","first-page":"1568","article-title":"Incremental gradient on the grassmannian for online foreground and background separation in subsampled video","author":"he","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8611004\/08598992.pdf?arnumber=8598992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:08:33Z","timestamp":1657746513000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8598992\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":42,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2018.2890368","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}