TY - JOUR
T1 - Finite-Time Distributed Linear Equation Solver for Solutions with Minimum l1-Norm
AU - Zhou, Jingqiu
AU - Wang, Xuan
AU - Mou, Shaoshuai
AU - Anderson, Brian D.O.
N1 - Publisher Copyright:
© 1963-2012 IEEE.
PY - 2020/4
Y1 - 2020/4
N2 - This paper proposes a continuous-time distributed algorithm for multiagent networks to achieve a solution with the minimum l1-norm to underdetermined linear equations. The proposed algorithm comes from a combination of the Filippov set-valued map with the projection-consensus flow. Given the underlying network is undirected and fixed, it is shown that the proposed algorithm drives all agents' individual states to converge in finite time to a common value, which is the minimum l1-norm solution.
AB - This paper proposes a continuous-time distributed algorithm for multiagent networks to achieve a solution with the minimum l1-norm to underdetermined linear equations. The proposed algorithm comes from a combination of the Filippov set-valued map with the projection-consensus flow. Given the underlying network is undirected and fixed, it is shown that the proposed algorithm drives all agents' individual states to converge in finite time to a common value, which is the minimum l1-norm solution.
KW - Distributed algorithms
KW - finite-time convergence
KW - minimum l-norm solutions
UR - http://www.scopus.com/inward/record.url?scp=85076772900&partnerID=8YFLogxK
U2 - 10.1109/TAC.2019.2932031
DO - 10.1109/TAC.2019.2932031
M3 - Article
SN - 0018-9286
VL - 65
SP - 1691
EP - 1696
JO - IEEE Transactions on Automatic Control
JF - IEEE Transactions on Automatic Control
IS - 4
M1 - 8781759
ER -