{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:59:20Z","timestamp":1730195960333,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T00:00:00Z","timestamp":1664236800000},"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":[[2022,9,27]]},"DOI":"10.1109\/allerton49937.2022.9929424","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T21:34:30Z","timestamp":1667597670000},"page":"1-8","source":"Crossref","is-referenced-by-count":0,"title":["Q-linear Convergence of Distributed Optimization with Barzilai-Borwein Step Sizes"],"prefix":"10.1109","author":[{"given":"Iyanuoluwa","family":"Emiola","sequence":"first","affiliation":[{"name":"University of Central Florida,Electrical & Computer Engineering Department,Orlando,FL,USA,32816"}]},{"given":"Chinwendu","family":"Enyioha","sequence":"additional","affiliation":[{"name":"University of Central Florida,Electrical & Computer Engineering Department,Orlando,FL,USA,32816"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403427264"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2013.09.079"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2666776"},{"key":"ref14","first-page":"3151","article-title":"Global convergence of online limited memory bfgs","volume":"16","author":"mokhtari","year":"2015","journal-title":"The Journal of Machine Learning Research"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-004-0569-y"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013004914923"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"3950","DOI":"10.23919\/ACC.2017.7963560","article-title":"Geo-metrically convergent distributed optimization with uncoordinated step-sizes","author":"nedic","year":"2017","journal-title":"2017 American Control Conference (ACC)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/22.1.1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2016.07.009"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7798273"},{"key":"ref6","first-page":"2737","article-title":"Asynchronous parallel stochastic gradient for nonconvex optimization","author":"lian","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref8","first-page":"1458","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","author":"schmidt","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584346"},{"key":"ref2","first-page":"1756","article-title":"Communication complexity of distributed convex learning and optimization","author":"arjevani","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2688328"},{"key":"ref9","first-page":"436","article-title":"A stochastic quasi-newton method for online convex optimization","author":"schraudolph","year":"2007","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-013-0007-x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2880407"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-411597-2.00009-6"},{"key":"ref24","article-title":"Geometric convergence for distributed optimization with barzilai-borwein step sizes","author":"gao","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2363299"},{"key":"ref26","first-page":"5","article-title":"Introductory lectures on convex programming volume i: Basic course","volume":"3","author":"nesterov","year":"1998","journal-title":"Lecture notes"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"}],"event":{"name":"2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2022,9,27]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2022,9,30]]}},"container-title":["2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9929313\/9929314\/09929424.pdf?arnumber=9929424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,21]],"date-time":"2022-11-21T21:35:02Z","timestamp":1669066502000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9929424\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,27]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/allerton49937.2022.9929424","relation":{},"subject":[],"published":{"date-parts":[[2022,9,27]]}}}