The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A Distributed Algorithm for Solving a Linear Algebraic Equation
Open accessAbstract
A distributed algorithm is described for solving a linear algebraic equation of the form Ax = b assuming the equation has at least one solution. The equation is simultaneously solved by m agents assuming each agent knows only a subset of the rows of the partitioned matrix [A b], the current estimates of the equation's solution generated by its neighbors, and nothing more. Each agent recursively updates its estimate by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-dependent directed graph N(t) whose vertices correspond to agents and whose arcs depict neighbor relations. It is shown that for any matrix A for which the equation has a solution and any sequence of “repeatedly jointly strongly connected graphs” N(t), t = 1, 2, ..., the algorithm causes all agents' estimates to converge exponentially fast to the same solution to Ax = b. It is also shown that, under mild assumptions, the neighbor graph sequence must actually be repeatedly jointly strongly connected if exponential convergence is to be assured. A worst case convergence rate bound is derived for the case when Ax = b has a unique solution. It is demonstrated that with minor modification, the algorithm can track the solution to Ax = b, even if A and b are changing with time, provided the rates of change of A and bare sufficiently small. It is also shown that in the absence of communication delays, exponential convergence to a solution occurs even if the times at which each agent updates its estimates are not synchronized with the update times of its neighbors. A modification of the algorithm is outlined which enables it to obtain a least squares solution to Ax = b in a distributed manner, even if Ax = b does not have a solution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Self-citationDistributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
The internal model principle of control theory
Francis, B. A., & Wonham, W. M. (1976) · Automatica · doi:10.1016/0005-1098(76)90006-6 · Cited by 2,874
Non-negative Matrices and Markov Chains
Seneta, E. (1981) · Springer Series in Statistics · doi:10.1007/0-387-32792-4 · Cited by 2,807
Gordon, R., Bender, R., & Herman, G. T. (1970) · Journal of Theoretical Biology · doi:10.1016/0022-5193(70)90109-8 · Cited by 2,791
Stability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
Constrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
A scheme for robust distributed sensor fusion based on average consensus
Xiao, L., Boyd, S., & Lall, S. (2005) · doi:10.5555/1147685.1147698 · Cited by 1,170
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2161027 · Cited by 947
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Duchi, J. C., Agarwal, A., & Wainwright, M. J. (2010) · Cited by 884
Convergence in Multiagent Coordination, Consensus, and Flocking
Blondel, V. D., Hendrickx, J. M., Olshevsky, A., & Tsitsiklis, J. N. (2006) · Proceedings of the 44th IEEE Conference on Decision and Control · doi:10.1109/cdc.2005.1582620 · Cited by 859
Fast Distributed Gradient Methods
Jakovetic, D., Xavier, J., & Moura, J. M. F. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2298712 · Cited by 624
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/060657005 · Cited by 563
Self-citationGallager, R. G. (1996) · doi:10.1007/978-1-4615-2329-1 · Cited by 494
Kar, S., Moura, J. M. F., & Ramanan, K. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191450 · Cited by 476
Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
Chang, T.-H., Nedic, A., & Scaglione, A. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2308612 · Cited by 401
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/060657029 · Cited by 329
Self-citationPush-Sum Distributed Dual Averaging for convex optimization
Tsianos, K. I., Lawlor, S., & Rabbat, M. G. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426375 · Cited by 304
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.929387 · Cited by 226
Self-citationCoordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2002.1184304 · Cited by 156
Self-citationA fast distributed proximal-gradient method
Chen, A. I., & Ozdaglar, A. (2012) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2012.6483273 · Cited by 154
Liu, J., Mou, S., Morse, A. S., Anderson, B. D. O., & Yu, C. B. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2159689 · Cited by 114
Self-citationDistributed strongly convex optimization
Tsianos, K. I., & Rabbat, M. (2012) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2012.6483272 · Cited by 88
Distributed optimization over time-varying directed graphs
Nedic, A., & Olshevsky, A. (2013) · 52nd IEEE Conference on Decision and Control · doi:10.1109/cdc.2013.6760975 · Cited by 72
Distributed computer vision algorithms through distributed averaging
Tron, R., & Vidal, R. (2011) · doi:10.1109/cvpr.2011.5995654 · Cited by 62
An asynchronous distributed algorithm for solving a linear algebraic equation
Liu, J. Y., Mou, S., & Morse, A. S. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760740 · Cited by 39
Self-citationContinuous-time distributed convex optimization on weight-balanced digraphs
Gharesifard, B., & Cortes, J. (2012) · 2012 IEEE 51st IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6426897 · Cited by 32
Distributed Nesterov-like gradient algorithms
Jakovetić, D., Moura, J. M. F., & Xavier, J. (2012) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2012.6425938 · Cited by 31
Lu, J., & Tang, C. Y. (2009) · IFAC Proceedings Volumes · doi:10.3182/20090924-3-it-4005.00044 · Cited by 31
A distributed algorithm for solving a linear algebraic equation
Mou, S., Liu, J., & Morse, A. S. (2013) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2013.6736534 · Cited by 27
Self-citationLu, J., & Tang, C. Y. (2009) · IFAC Proceedings Volumes · doi:10.3182/20090924-3-it-4005.00043 · Cited by 20
Metadata
- Authors
- Mou, S., Liu, J., & Morse, A. S.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2015-11
- Volume
- 60
- Issue
- 11
- Pages
- 2863-2878
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2567931453
- Cited by
- 284
- References
- 31
- FWCI
- 33.00
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.