The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
Open accessAbstract
We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there is a private cost function and a private constraint set at each node. The goal is to minimize the sum of all the cost functions, constraining the solution to be in the intersection of all the constraint sets. D-ADMM is proven to converge when the network is bipartite or when all the functions are strongly convex, although in practice, convergence is observed even when these conditions are not met. We use D-ADMM to solve the following problems from signal processing and control: average consensus, compressed sensing, and support vector machines. Our simulations show that D-ADMM requires less communications than state-of-the-art algorithms to achieve a given accuracy level. Algorithms with low communication requirements are important, for example, in sensor networks, where sensors are typically battery-operated and communicating is the most energy consuming operation.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Wireless sensor networks: a survey
Akyildiz, I. F., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002) · Computer Networks · doi:10.1016/s1389-1286(01)00302-4 · Cited by 17,418
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
The igraph software package for complex network research
Csárdi, G., & Nepusz, T. (2006) · Medical Entomology and Zoology · Cited by 13,507
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Pattern Recognition and Machine Learning
Neal, R. M. (2007) · Technometrics · doi:10.1198/tech.2007.s518 · Cited by 4,571
Degroot, M. H. (1974) · Journal of the American Statistical Association · doi:10.1080/01621459.1974.10480137 · Cited by 4,004
Regression Shrinkage and Selection via The Lasso: A Retrospective
Tibshirani, R. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.00771.x · Cited by 3,589
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Penrose, M. (2003) · doi:10.1093/acprof:oso/9780198506263.001.0001 · Cited by 2,480
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Probing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
Computer Networking: A Top-Down Approach Featuring the Internet
Kurose, J. F., & Ross, K. W. (2000) · Cited by 1,628
Glowinski, R., & Marroco, A. (1975) · Revue française d'automatique, informatique, recherche opérationnelle. Analyse numérique · doi:10.1051/m2an/197509r200411 · Cited by 1,105
Distributed optimization in sensor networks
Rabbat, M., & Nowak, R. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984626 · Cited by 901 · cited 2×
“Gradient and subgradient methods, including incremental versions, are long known to yield distributed algorithms (in the sense defined before); see, e.g., [6], [7], [8].”
BackgroundLocality in Distributed Graph Algorithms
Linial, N. (1992) · SIAM Journal on Computing · doi:10.1137/0221015 · Cited by 870
Convergence Speed in Distributed Consensus and Averaging
Olshevsky, A., & Tsitsiklis, J. N. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/060678324 · Cited by 692
On the linear convergence of the alternating direction method of multipliers
Hong, M., & Luo, Z.-Q. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1034-2 · Cited by 690
Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
Schizas, I. D., Ribeiro, A., & Giannakis, G. B. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.906734 · Cited by 685
Asunción, A. (2007) · Medical Entomology and Zoology · Cited by 643
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Distributed Sparse Linear Regression
Mateos, G., Bazerque, J. A., & Giannakis, G. B. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2055862 · Cited by 550
Distributed Spectrum Sensing for Cognitive Radio Networks by Exploiting Sparsity
Bazerque, J. A., & Giannakis, G. B. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2038417 · Cited by 510
He, B. S., Yang, H., & Wang, S. L. (2000) · Journal of Optimization Theory and Applications · doi:10.1023/a:1004603514434 · Cited by 465
Krishnamachari, B. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511541025 · Cited by 378
Consensus-based distributed support vector machines
Forero, P. A., Caño, A., & Giannakis, G. B. (2010) · Cited by 364
Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
He, B., Tao, M., & Yuan, X. (2012) · SIAM Journal on Optimization · doi:10.1137/110822347 · Cited by 360
A Note on the Alternating Direction Method of Multipliers
Han, D., & Yuan, X. (2012) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0003-z · Cited by 244
Mota, J. F. C., Xavier, J. M. F., Aguiar, P. M. Q., & Puschel, M. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2182347 · Cited by 210
Self-citationSchizas, I. D., Giannakis, G. B., Roumeliotis, S. I., & Ribeiro, A. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.908943 · Cited by 192
Group-Lasso on Splines for Spectrum Cartography
Bazerque, J. A., Mateos, G., & Giannakis, G. B. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2160858 · Cited by 171
Consensus-based distributed linear support vector machines
Forero, P. A., Cano, A., & Giannakis, G. B. (2010) · Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks · doi:10.1145/1791212.1791218 · Cited by 171
Fast Consensus by the Alternating Direction Multipliers Method
Erseghe, T., Zennaro, D., Dall'Anese, E., & Vangelista, L. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2162831 · Cited by 163
Getting Up to Speed: The Future of Supercomputing
Graham, S. L., Patterson, C. A., & Snir, M. (2013) · Cited by 136
Exact Regularization of Convex Programs
Friedlander, M. P., & Tseng, P. (2007) · SIAM Journal on Optimization · doi:10.1137/060675320 · Cited by 132
Jakovetić, D., Xavier, J., & Moura, J. M. F. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2146776 · Cited by 131
Self-citationGeneralized consensus computation in networked systems with erasure links
Rabbat, M., Nowak, R. D., & Bucklew, J. A. (2005) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2005.1506308 · Cited by 126
Optimization and Analysis of Distributed Averaging With Short Node Memory
Oreshkin, B. N., Coates, M., & Rabbat, M. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2043127 · Cited by 113
Sparco: A Testing Framework for Sparse Reconstruction
van den Berg, E., Friedlander, M. P., Hennenfent, G., Herrmann, F. J., Saab, R., & Ylmaz, O. (2007) · Cited by 85
Privacy-preserving classification of vertically partitioned data via random kernels
Mangasarian, O. L., Wild, E. W., & Fung, G. (2008) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1409620.1409622 · Cited by 81
Distributed In-Network Channel Decoding
Zhu, H., Giannakis, G. B., & Cano, A. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2023936 · Cited by 81
Basis Pursuit in sensor networks
Mota, J. F. C., Xavier, J., Aguiar, P. M. Q., & Püschel, M. (2011) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2011.5946267 · Cited by 25
Self-citationDistributed Multi-Agent Optimization with State-Dependent CommunicationPreprint
Lobel, I., Ozdaglar, A., & Feijer, D. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1004.0969 · Cited by 3
Cited by
Online learning: A comprehensive survey
Hoi, S. C. H., Sahoo, D., Lu, J., & Zhao, P. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.112 · Cited by 746
NEXT: In-Network Nonconvex Optimization
Lorenzo, P. D., & Scutari, G. (2016) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2016.2524588 · Cited by 473
Parallel Multi-Block ADMM with o(1 / k) Convergence
Deng, W., Lai, M.-J., Peng, Z., & Yin, W. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-016-0318-2 · Cited by 455
Multi-Agent Distributed Optimization via Inexact Consensus ADMM
Chang, T.-H., Hong, M., & Wang, X. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2367458 · Cited by 444
Research Review for Broad Learning System: Algorithms, Theory, and Applications
Gong, X., Zhang, T., Chen, C. L. P., & Liu, Z. (2022) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3061094 · Cited by 350
Metadata
- Authors
- Mota, J. F. C., Xavier, J. M. F., Aguiar, P. M. Q., & Puschel, M.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2013-05
- Volume
- 61
- Issue
- 10
- Pages
- 2718-2723
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1982545958
- Cited by
- 363
- References
- 54
- FWCI
- 37.01
- 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.