Robust Distributed Consensus Using Total Variation

DOI10.1109/TAC.2015.2471755MaRDI QIDQ2980525zbMATH OpenOpenAlexFDO

Authors Walid Ben-Ameur, Pascal Bianchi, Jérémie Jakubowicz

Publication date 3 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2015.2471755

Mathematics Subject Classification ID

Convex programming (90C25) Deterministic network models in operations research (90B10)

Recommendations

• Distributed constrained stochastic optimal consensus
• A resilient convex combination for consensus-based distributed algorithms
• scientific article; zbMATH DE number 3882135
• Distributed convex optimization as a tool for solving \(f\)-consensus problems
• Distributed average consensus with least-mean-square deviation
• Distributed consensus, revisited
• Fast, robust, quantizable approximate consensus
• Robust Distributed Average Consensus via Exchange of Running Sums
• Distributed random convex programming via constraints consensus
• Distributed consensus revisited

Cited in

(7)

• Distributed continuous-time algorithm for nonsmooth optimal consensus without sharing local decision variables
• Distributed Weight Selection in Consensus Protocols by Schatten Norm Minimization
• Robust Distributed Fusion With Labeled Random Finite Sets
• A resilient convex combination for consensus-based distributed algorithms
• Distributed Recursive Estimation under Heavy-Tail Communication Noise
• Robust Distributed Average Consensus via Exchange of Running Sums
• On the geometric convergence of Byzantine-resilient distributed optimization algorithms

This page was built for publication: Robust Distributed Consensus Using Total Variation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2980525)