{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:20:00Z","timestamp":1767183600064,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,5,25]]},"DOI":"10.23919\/acc50511.2021.9483167","type":"proceedings-article","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T20:29:16Z","timestamp":1627504156000},"page":"2619-2624","source":"Crossref","is-referenced-by-count":8,"title":["Momentum based Projection Free Stochastic Optimization Under Affine Constraints"],"prefix":"10.23919","author":[{"given":"Zeeshan","family":"Akhtar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ketan","family":"Rajawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/16M1093094"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2020.2996060"},{"key":"ref10","article-title":"Projection-free online learning","author":"hazan","year":"2012","journal-title":"ArXiv Preprint"},{"key":"ref11","first-page":"1263","article-title":"Variance-reduced and projection-free stochastic optimization","author":"hazan","year":"0","journal-title":"International Conference on Machine Learning"},{"key":"ref12","first-page":"1","article-title":"Stochastic conditional gradient methods: From convex minimization to submodular maximization","volume":"21","author":"mokhtari","year":"2020","journal-title":"Journal of Machine Learning Research"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/140992382"},{"key":"ref14","article-title":"Conditional accelerated lazy stochastic gradient descent","author":"lan","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01480-7"},{"key":"ref16","article-title":"A conditional gradient framework for composite convex minimization with applications to semidefinite programming","author":"yurtsever","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref18","first-page":"14 269","article-title":"Stochastic frank-wolfe for composite convex minimization","author":"locatello","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref19","first-page":"15 236","article-title":"Momentum-based variance reduction in non-convex sgd","author":"cutkosky","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref28","first-page":"55","article-title":"Robust principal component analysis with complex noise","author":"zhao","year":"0","journal-title":"International Conference on Machine Learning"},{"key":"ref4","first-page":"41","article-title":"A direct formulation for sparse pea using semidefinite programming","author":"d'aspremont","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1991.tb02669.x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/050641983"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499363220"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2010-11-5-207"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294644"},{"key":"ref9","first-page":"427","article-title":"Revisiting frank-wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"0","journal-title":"Proceedings of the 30th International Conference on Machine Learning"},{"key":"ref1","first-page":"27","article-title":"Learning the kernel matrix with semidefinite programming","volume":"5","author":"lanckriet","year":"2004","journal-title":"Journal of Machine Learning Research"},{"journal-title":"Supplementary Material","year":"2020","author":"akhtar","key":"ref20"},{"key":"ref22","article-title":"A conditional gradient-based augmented lagrangian framework","author":"yurtsever","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CACSD.2010.5612811"},{"key":"ref24","first-page":"23","volume":"7","author":"lecun","year":"2010","journal-title":"MNIST Handwritten Digit Database 2010"},{"key":"ref23","article-title":"Clustering subgaussian mixtures by semidefinite programming","author":"mixon","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/nature01121"},{"key":"ref25","article-title":"Estimation of simultaneously sparse and low rank matrices","author":"richard","year":"2012","journal-title":"ArXiv Preprint"}],"event":{"name":"2021 American Control Conference (ACC)","start":{"date-parts":[[2021,5,25]]},"location":"New Orleans, LA, USA","end":{"date-parts":[[2021,5,28]]}},"container-title":["2021 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9482409\/9482614\/09483167.pdf?arnumber=9483167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T10:50:02Z","timestamp":1633517402000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9483167\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":31,"URL":"https:\/\/doi.org\/10.23919\/acc50511.2021.9483167","relation":{},"subject":[],"published":{"date-parts":[[2021,5,25]]}}}