Abstract
Abstract This paper proposes a distributed algorithm for multi-agent networks to achieve a minimum l1-norm solution to a linear equation Ax = b where A has full row rank. When the underlying network is undirected and fixed, it is proved that the proposed algorithm drive all agents individual states to converge in finite-time to the same minimum l1-norm solution. Numerical simulations are also provided as validation of the proposed algorithms.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of 2018 American Control Conference (ACC) |
| Place of Publication | online |
| Publisher | IEEE |
| Pages | 5857-5862 |
| ISBN (Print) | 978-1-5386-5427-9 |
| Publication status | Published - 2018 |
| Event | ACC 2018 - American Control Conference - Milwaukee, USA Duration: 1 Jan 2018 → … |
Conference
| Conference | ACC 2018 - American Control Conference |
|---|---|
| Period | 1/01/18 → … |
| Other | June 27-29, 2018 |