{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:59:55Z","timestamp":1774990795277,"version":"3.50.1"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/allerton.2019.8919690","type":"proceedings-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T04:23:39Z","timestamp":1575606219000},"page":"781-786","source":"Crossref","is-referenced-by-count":16,"title":["Distributed Zero-Order Algorithms for Nonconvex Multi-Agent optimization"],"prefix":"10.1109","author":[{"given":"Yujie","family":"Tang","sequence":"first","affiliation":[{"name":"Harvard University,School of Engineering and Applied Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Na","family":"Li","sequence":"additional","affiliation":[{"name":"Harvard University,School of Engineering and Applied Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"63","article-title":"A scheme for robust distributed sensor fusion based on average consensus","author":"xiao","year":"2005","journal-title":"2005 Fourth International Symposium on Information Processing in Sensor Networks"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919690"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963560"},{"key":"ref30","article-title":"Exponential convergence time of gradient descent for one-dimensional deep linear neural networks","author":"shamir","year":"2018","journal-title":"arXiv preprint arXiv 1809 08587"},{"key":"ref10","first-page":"5336","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"2017","journal-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2685559"},{"key":"ref12","first-page":"1529","article-title":"Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks","volume":"70","author":"hong","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning ser Proceedings of Machine Learning Research"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2818081"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-01357-w"},{"key":"ref15","first-page":"385","article-title":"Online convex optimization in the bandit setting: gradient descent without a gradient","author":"flaxman","year":"2005","journal-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref16","first-page":"257","article-title":"Highly-smooth zero-th order online optimization","volume":"49","author":"bach","year":"2016","journal-title":"29th Annual Conference on Learning Theory ser Proceedings of Machine Learning Research"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(63)90382-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2937496"},{"key":"ref29","first-page":"1467","article-title":"Global convergence of policy gradient methods for the linear quadratic regulator","volume":"80","author":"fazel","year":"2018","journal-title":"Proceedings of the 35th International Conference on Machine Learning ser Proceedings of Machine Learning Research"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2209984"},{"key":"ref2","author":"chen","year":"2012","journal-title":"Fast Distributed First-Order Methods"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2648041"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TAC.2008.2009515","article-title":"Distributed subgradient methods for multi-agent optimization","volume":"54","author":"nedic","year":"2009","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref20","first-page":"1","article-title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","volume":"18","author":"shamir","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"3936","DOI":"10.1109\/TAC.2016.2529285","article-title":"Stochastic gradient-push for strongly convex functions on time-varying directed graphs","volume":"61","author":"nedi?","year":"2016","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref21","article-title":"Towards gradient free and projection free stochastic optimization","author":"sahu","year":"2018","journal-title":"arXiv preprint arXiv 1810 06008"},{"key":"ref24","first-page":"288","article-title":"Zeroth-order online alternating direction method of multipliers: Convergence analysis and applications","volume":"84","author":"liu","year":"2018","journal-title":"Proceedings of the Twenty-First International Conference on Artificial Intelligence and Statistics ser Proceedings of Machine Learning Research"},{"key":"ref23","article-title":"Zeroth order nonconvex multi-agent optimization over networks","author":"hajinezhad","year":"2017","journal-title":"arXiv preprint arXiv 1710 09997"},{"key":"ref26","article-title":"Distributed randomized gradient-free mirror descent algorithm for constrained optimization","author":"yu","year":"2019","journal-title":"arXiv preprint arXiv 1903 00066"},{"key":"ref25","first-page":"4951","article-title":"Distributed zeroth order optimization over random networks: A Kiefer-Wolfowitz stochastic approximation approach","author":"sahu","year":"2018","journal-title":"proceedings of the 57th IEEE Conference on Decision and Control (CDC)"}],"event":{"name":"2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2019,9,24]]},"end":{"date-parts":[[2019,9,27]]}},"container-title":["2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8911248\/8919648\/08919690.pdf?arnumber=8919690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:40Z","timestamp":1774986700000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8919690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/allerton.2019.8919690","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}