%PDF-1.4
%
1 0 obj
<>stream
application/pdfIEEEIEEE Transactions on Signal Processing;2019;67;22;10.1109/TSP.2019.2943230Non-convex distributed optimizationOptimal convergence rateLower complexity boundDistributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal AlgorithmsHaoran SunMingyi Hong
IEEE Transactions on Signal Processing591215 Nov.15, 2019226710.1109/TSP.2019.29432305928
endstream
endobj
2 0 obj
<>stream
x}[oI~TUVucu6Xv3s T3d۞sw߰OWeql|EVEQ]tV2zrJ.O._D.'>d,Ͳ̝~\RI.N>ΤӏO+}>M .]t-|rtJmówWFF.y>"ywWxow˫7ߍtA<{adT_^]yL^/#oS<ѩIr/߽*ZГCyyoZx:Sy
&-UfxiW&5^f^HgN#[bL|d3r?7!}s]5H'WxUSa`4Kʕ=ZmU؛<H`;T2Y43_ЪYL岞 #tHkO/fSMKի11*i˂|.RXϯ[Â~9/xoMoM-U&tNsc\g?x^7Kb1YϪ:_OtAqyfe{d~T'=d-HVI`FɌy O,-2OмiOSPinO-uOX}jDYAҩ6)-!(DV%ѳ%ũKKC>
wJ`m#ܜ˞9-
&Zz
,2SU؝( Ѕ!Ńn֘bu 2fi 'pGMw1/!ԌחT;88%eFL17EjKQ_XJL562QY 83Ls?