A Resilient Distributed Algorithm for Solving Linear Equations

Jingxuan Zhu; Alvaro Velasquez; Ji Liu

doi:10.1109/CDC49753.2023.10383841

A Resilient Distributed Algorithm for Solving Linear Equations

Jingxuan Zhu
, Alvaro Velasquez
, Ji Liu

Electrical Engineering

Stony Brook University
University of Colorado Boulder

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

This paper presents a resilient distributed algorithm for solving a system of linear algebraic equations over a multi-agent network in the presence of Byzantine agents capable of arbitrarily introducing untrustworthy information in communication. It is shown that the algorithm causes all non-Byzantine agents' states to converge to the same least squares solution exponentially fast, provided appropriate levels of graph redundancy and objective redundancy are established. An explicit convergence rate is also provided.

Original language	English
Title of host publication	2023 62nd IEEE Conference on Decision and Control, CDC 2023
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	381-386
Number of pages	6
ISBN (Electronic)	9798350301243
DOIs	https://doi.org/10.1109/CDC49753.2023.10383841
State	Published - 2023
Event	62nd IEEE Conference on Decision and Control, CDC 2023 - Singapore, Singapore Duration: Dec 13 2023 → Dec 15 2023

Publication series

Name	Proceedings of the IEEE Conference on Decision and Control
ISSN (Print)	0743-1546
ISSN (Electronic)	2576-2370

Conference

Conference	62nd IEEE Conference on Decision and Control, CDC 2023
Country/Territory	Singapore
City	Singapore
Period	12/13/23 → 12/15/23

Access to Document

10.1109/CDC49753.2023.10383841

Cite this

@inproceedings{17171d58651a456589e0f4ac8c77f9fd,

title = "A Resilient Distributed Algorithm for Solving Linear Equations",

abstract = "This paper presents a resilient distributed algorithm for solving a system of linear algebraic equations over a multi-agent network in the presence of Byzantine agents capable of arbitrarily introducing untrustworthy information in communication. It is shown that the algorithm causes all non-Byzantine agents' states to converge to the same least squares solution exponentially fast, provided appropriate levels of graph redundancy and objective redundancy are established. An explicit convergence rate is also provided.",

author = "Jingxuan Zhu and Alvaro Velasquez and Ji Liu",

note = "Publisher Copyright: {\textcopyright} 2023 IEEE.; 62nd IEEE Conference on Decision and Control, CDC 2023 ; Conference date: 13-12-2023 Through 15-12-2023",

year = "2023",

doi = "10.1109/CDC49753.2023.10383841",

language = "English",

series = "Proceedings of the IEEE Conference on Decision and Control",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "381--386",

booktitle = "2023 62nd IEEE Conference on Decision and Control, CDC 2023",

}

Zhu, J, Velasquez, A & Liu, J 2023, A Resilient Distributed Algorithm for Solving Linear Equations. in 2023 62nd IEEE Conference on Decision and Control, CDC 2023. Proceedings of the IEEE Conference on Decision and Control, Institute of Electrical and Electronics Engineers Inc., pp. 381-386, 62nd IEEE Conference on Decision and Control, CDC 2023, Singapore, Singapore, 12/13/23. https://doi.org/10.1109/CDC49753.2023.10383841

A Resilient Distributed Algorithm for Solving Linear Equations. / Zhu, Jingxuan; Velasquez, Alvaro; Liu, Ji.
2023 62nd IEEE Conference on Decision and Control, CDC 2023. Institute of Electrical and Electronics Engineers Inc., 2023. p. 381-386 (Proceedings of the IEEE Conference on Decision and Control).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A Resilient Distributed Algorithm for Solving Linear Equations

AU - Zhu, Jingxuan

AU - Velasquez, Alvaro

AU - Liu, Ji

PY - 2023

Y1 - 2023

N2 - This paper presents a resilient distributed algorithm for solving a system of linear algebraic equations over a multi-agent network in the presence of Byzantine agents capable of arbitrarily introducing untrustworthy information in communication. It is shown that the algorithm causes all non-Byzantine agents' states to converge to the same least squares solution exponentially fast, provided appropriate levels of graph redundancy and objective redundancy are established. An explicit convergence rate is also provided.

AB - This paper presents a resilient distributed algorithm for solving a system of linear algebraic equations over a multi-agent network in the presence of Byzantine agents capable of arbitrarily introducing untrustworthy information in communication. It is shown that the algorithm causes all non-Byzantine agents' states to converge to the same least squares solution exponentially fast, provided appropriate levels of graph redundancy and objective redundancy are established. An explicit convergence rate is also provided.

UR - https://www.scopus.com/pages/publications/85184810189

U2 - 10.1109/CDC49753.2023.10383841

DO - 10.1109/CDC49753.2023.10383841

M3 - Conference contribution

AN - SCOPUS:85184810189

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 381

EP - 386

BT - 2023 62nd IEEE Conference on Decision and Control, CDC 2023

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 62nd IEEE Conference on Decision and Control, CDC 2023

Y2 - 13 December 2023 through 15 December 2023

ER -

A Resilient Distributed Algorithm for Solving Linear Equations

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this