{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:26:11Z","timestamp":1730193971640,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/acssc.2018.8645279","type":"proceedings-article","created":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T20:31:40Z","timestamp":1552941100000},"page":"38-42","source":"Crossref","is-referenced-by-count":12,"title":["Distributed Non-Convex First-Order optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms"],"prefix":"10.1109","author":[{"given":"Haoran","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyi","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/090774100"},{"key":"ref11","article-title":"Lower bounds for finding stationary points i","author":"carmon","year":"2017","journal-title":"arXiv preprint arXiv 1710 11606"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/140990309"},{"key":"ref13","article-title":"Prox-pda: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks","author":"hong","year":"2017","journal-title":"Proc of the International Conference on Machine Learning (ICML)"},{"journal-title":"Convergence rate of distributed convex and nonconvex optimization methods with gradient tracking","year":"2018","author":"daneshmand","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2685559"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref17","article-title":"Distributed non-convex first-order optimization and information processing: Lower complexity bounds and rate optimal algorithms","author":"sun","year":"2018","journal-title":"arXiv preprint arXiv 1804 02671"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICMEW.2014.6890711"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2226173"},{"key":"ref4","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate o(1\/k2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"ref3","article-title":"Decentralized learning for wireless communications and networking","author":"giannakis","year":"2015","journal-title":"Splitting Methods in Communication and Imaging"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref5","article-title":"Problem complexity and method efficiency in optimization","author":"nemirovsky","year":"1983","journal-title":"Interscience Series in Discrete Mathematics"},{"key":"ref8","first-page":"3027","article-title":"Optimal´ algorithms for smooth and strongly convex distributed optimization in networks","author":"scaman","year":"2017","journal-title":"Proceedings of the International Conference on Machine Learning"},{"journal-title":"On Accelerated Proximal Gradient Methods for Convexconcave Optimization","year":"2008","author":"tseng","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2011.2114324"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10463-009-0242-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.919636"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2648041"}],"event":{"name":"2018 52nd Asilomar Conference on Signals, Systems, and Computers","start":{"date-parts":[[2018,10,28]]},"location":"Pacific Grove, CA, USA","end":{"date-parts":[[2018,10,31]]}},"container-title":["2018 52nd Asilomar Conference on Signals, Systems, and Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8638648\/8645065\/08645279.pdf?arnumber=8645279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:04:46Z","timestamp":1598227486000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8645279\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/acssc.2018.8645279","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}