2017/09/28 by Jingqiu Zhou, Xuan Wang, Zhou, Jingqiu +5
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Distributed #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Matrix Theory and Algorithms #Numerical methods for differential equations #Optimization and Control (math.OC) #Parallel #Systems and Control (eess.SY) #and Cluster Computing (cs.DC) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1709.10154
openalex publication_date 2017/09/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
This paper proposes distributed algorithms for multi-agent networks to achieve a solution in finite time to a linear equation Ax=b where A has full row rank, and with the minimum l1-norm in the underdetermined case (where A has more columns than rows). The underlying network is assumed to be undirected and fixed, and an analytical proof is provided for the proposed algorithm to drive all agents' individual states to converge to a common value, viz a solution of Ax=b, which is the minimum l1-norm solution in the underdetermined case. Numerical simulations are also provided as validation of the proposed algorithms.