Resilient Distributed Optimization

2022/09/27 by Zhu, Jingxuan, Lin, Yixuan, Velasquez, Alvaro +1 · 1 citation
#FOS: Electrical engineering #FOS: Mathematics #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.2209.13095

Abstract

This paper considers a distributed optimization problem in the presence of Byzantine agents capable of introducing untrustworthy information into the communication network. A resilient distributed subgradient algorithm is proposed based on graph redundancy and objective redundancy. It is shown that the algorithm causes all non-Byzantine agents' states to asymptotically converge to the same optimal point under appropriate assumptions. A partial convergence rate result is also provided.

Cited by

• Resilient Multi-Dimensional Consensus and Distributed Optimization against Agent-Based and Denial-of-Service Attacks

Related

• On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithms
• Byzantine-Resilient Multi-Agent Distributed Exact Optimization with Less Data
• A Resilient Distributed Algorithm for Solving Linear Equations
• Resilient Distributed Optimization Algorithms for Resource Allocation
• Byzantine-Robust Gossip: Insights from a Dual Approach