BGeneralized consensus computation in networked systems with erasure links

We study consensus problems in networked systems with unreli-able links. Our contributions are two-fold. First, we derive a fam-ily of decentralized consensus algorithms for minimizing a sum of convex functions, ∑N i=1 fi(x), where each function fi only de-pends on information at one node in the network. Computing the consensus average is a special case in this setting. Then, we con-struct a modified algorithm which is resilient in situations where the channels between nodes act as binary erasure channels. The flexibility and efficacy of our approach is demonstrated through an application of robust estimation. 1. LOCAL CONSENSUS ALGORITHMS The problem of consensus computation in networked systems suc