Abstract
This paper proposes a discrete-time, distributed algorithm for multi-agent networks to achieve the minimum l1-norm solution to a group of linear equations known to possess a family of solutions. We assume each agent in the network knows only one equation and can communicate with only its neighbors. The algorithm is developed based on a combination of the projection-consensus idea and the sub-gradient descent method. Given the underlying network graph to be directed and strongly connected, we prove that the algorithm enables all agents to achieve a common minimum l1-norm solution. The major difficulty to be dealt with is the non-smooth nature of the norm and the lack of strict convexity of the associated relevant performance index.
Original language | English |
---|---|
Pages (from-to) | 3278-3285 |
Number of pages | 8 |
Journal | IFAC-PapersOnLine |
Volume | 53 |
Issue number | 2 |
DOIs | |
Publication status | Published - 2020 |
Event | 21st IFAC World Congress 2020 - Berlin, Germany Duration: 12 Jul 2020 → 17 Jul 2020 |