{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:17:14Z","timestamp":1767183434496,"version":"3.37.3"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Science & Engineering Research Board of Department of Science & Technology","award":["SPR\/2019\/000759"],"award-info":[{"award-number":["SPR\/2019\/000759"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3162958","type":"journal-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:43:09Z","timestamp":1648582989000},"page":"2119-2135","source":"Crossref","is-referenced-by-count":10,"title":["Zeroth and First Order Stochastic Frank-Wolfe Algorithms for Constrained Optimization"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1509-7899","authenticated-orcid":false,"given":"Zeeshan","family":"Akhtar","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4508-0062","authenticated-orcid":false,"given":"Ketan","family":"Rajawat","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, India"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1137\/1.9781611976595"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/TIT.2013.2294644"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1137\/1.9780898718768"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/3128572.3140448"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1137\/070704277"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1137\/16M1093094"},{"key":"ref7","first-page":"7272","article-title":"A conditional-gradient-based augmented Lagrangian framework","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yurtsever","year":"2019"},{"year":"2019","author":"Fercoq","article-title":"Almost surely constrained convex optimization","key":"ref8"},{"key":"ref9","first-page":"489","article-title":"An homotopy algorithm for the Lasso with online observations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"21","author":"Garrigues","year":"2008"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1137\/050641983"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/1502793.1502794"},{"key":"ref12","first-page":"64","article-title":"Scalable semidefinite relaxation for maximum a posterior estimation","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Huang","year":"2014"},{"issue":"1","key":"ref13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","article-title":"Semidefinite programming relaxations for the quadratic assignment problem","volume":"2","author":"Zhao","year":"1998","journal-title":"J. Combinatorial Optim."},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/227683.227684"},{"key":"ref15","first-page":"10900","article-title":"Semidefinite relaxations for certifying robustness to adversarial examples","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Raghunathan","year":"2018"},{"key":"ref16","first-page":"235","article-title":"Fast low-rank semidefinite programming for embedding and clustering","volume-title":"Proc. Artif. Intell. Statist.","author":"Kulis","year":"2007"},{"key":"ref17","article-title":"Lipschitz constant estimation of neural networks via sparse polynomial optimization","volume-title":"Proc. 8th Int. Conf. Learn. Representations","author":"Latorre","year":"2020"},{"key":"ref18","first-page":"14269","article-title":"Stochastic Frank-Wolfe for composite convex minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Locatello","year":"2019"},{"key":"ref19","first-page":"9775","article-title":"Conditional gradient methods for stochastically constrained convex minimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Vladarean"},{"key":"ref20","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","author":"Jaggi","year":"2013"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref22","first-page":"4012","article-title":"One sample stochastic Frank-Wolfe","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Zhang"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1609\/aaai.v34i04.6116"},{"key":"ref24","first-page":"566","article-title":"Lazifying conditional gradient algorithms","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Braun","year":"2017"},{"key":"ref25","first-page":"2591","article-title":"Frank-Wolfe with subsampling oracle","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kerdreux","year":"2018"},{"year":"2021","author":"Mhammedi","article-title":"Efficient projection-free online convex optimization with membership oracle","key":"ref26"},{"key":"ref27","first-page":"1843","article-title":"Projection-free online learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hazan","year":"2012"},{"key":"ref28","first-page":"1263","article-title":"Variance-reduced and projection-free stochastic optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hazan","year":"2016"},{"key":"ref29","first-page":"2868","article-title":"Complexities in projection-free stochastic non-convex minimization","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Shen","year":"2019"},{"key":"ref30","first-page":"1755","article-title":"On the ineffectiveness of variance reduced optimization for deep learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Defazio","year":"2019"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.23919\/ACC50511.2021.9483167"},{"issue":"105","key":"ref32","first-page":"1","article-title":"Stochastic conditional gradient methods: From convex minimization to submodular maximization","volume":"21","author":"Mokhtari","year":"2020","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TSP.2021.3082467"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1137\/140992382"},{"key":"ref35","first-page":"1965","article-title":"Conditional accelerated lazy stochastic gradient descent","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lan","year":"2017"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1007\/s10107-020-01480-7"},{"key":"ref37","first-page":"5727","article-title":"A conditional gradient framework for composite convex minimization with applications to semidefinite programming","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yurtsever","year":"2018"},{"key":"ref38","first-page":"3468","article-title":"Towards gradient free and projection free stochastic optimization","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Sahu","year":"2019"},{"issue":"1","key":"ref39","first-page":"7204","article-title":"Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization","volume":"18","author":"Patrascu","year":"2017","journal-title":"J. Mach. Learn. Res."},{"year":"2015","author":"Wang","article-title":"Random multi-constraint projection: Stochastic gradient methods for convex optimization with many constraints","key":"ref40"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"ref42","first-page":"7282","article-title":"Conditional gradient methods via stochastic path-integrated differential estimator","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yurtsever","year":"2019"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1109\/TSP.2021.3087910"},{"key":"ref44","first-page":"3455","article-title":"Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Balasubramanian","year":"2018"},{"key":"ref45","first-page":"4519","article-title":"Accelerated stochastic gradient-free and projection-free methods","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Huang"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref47","first-page":"1","article-title":"Complexity issues and randomization strategies in Frank-Wolfe algorithms for machine learning","volume-title":"Proc. NIPS Workshop Optim. Mach. Learn.","author":"Frandi","year":"2014"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1109\/TNNLS.2021.3083655"},{"key":"ref49","first-page":"3727","article-title":"Zeroth-order stochastic variance reduction for nonconvex optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Liu","year":"2018"},{"key":"ref50","first-page":"3100","article-title":"Improved zeroth-order variance reduced algorithms and analysis for nonconvex optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ji","year":"2019"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1137\/1.9781611974997"},{"key":"ref52","first-page":"15 236","article-title":"Momentum-based variance reduction in non-convex SGD","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cutkosky","year":"2019"},{"key":"ref53","first-page":"19","article-title":"Projection-free optimization on uniformly convex sets","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Kerdreux"},{"key":"ref54","first-page":"541","article-title":"Faster rates for the Frank-Wolfe method over strongly-convex sets","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Garber","year":"2015"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"ref56","first-page":"51","article-title":"Estimation of simultaneously sparse and low rank matrices","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Savalle","year":"2012"},{"key":"ref57","first-page":"55","article-title":"Robust principal component analysis with complex noise","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhao","year":"2014"},{"doi-asserted-by":"publisher","key":"ref58","DOI":"10.1109\/LSP.2020.2996060"},{"doi-asserted-by":"publisher","key":"ref59","DOI":"10.1093\/imaiai\/iax001"},{"doi-asserted-by":"publisher","key":"ref60","DOI":"10.1109\/MSP.2012.2211477"},{"key":"ref61","first-page":"774","article-title":"Hierarchical clustering with structural constraints","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chatziafratis","year":"2018"},{"doi-asserted-by":"publisher","key":"ref62","DOI":"10.1016\/j.jda.2011.12.008"},{"doi-asserted-by":"publisher","key":"ref63","DOI":"10.1145\/331524.331526"},{"key":"ref64","first-page":"192","article-title":"Cut problems and their application to divide-and-conquer","volume-title":"Approximation Algorithms for NP-hard Problems","author":"Shmoys","year":"1997"},{"doi-asserted-by":"publisher","key":"ref65","DOI":"10.1609\/aaai.v29i1.9277"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09744473.pdf?arnumber=9744473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:21:58Z","timestamp":1705537318000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9744473\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3162958","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2022]]}}}