The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
Open accessAbstract
The alternating direction method of multipliers (ADMM) has emerged as a powerful technique for large-scale structured optimization. Despite many recent results on the convergence properties of ADMM, a quantitative characterization of the impact of the algorithm parameters on the convergence times of the method is still lacking. In this paper we find the optimal algorithm parameters that minimize the convergence factor of the ADMM iterates in the context of ℓ2-regularized minimization and constrained quadratic programming. Numerical examples show that our parameter selection rules significantly outperform existing alternatives in the literature.
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
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
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
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
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201
The quadruple-tank process: a multivariable laboratory process with an adjustable zero
Johansson, K. H. (2000) · IEEE Transactions on Control Systems Technology · doi:10.1109/87.845876 · Cited by 1,104
On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Shi, W., Ling, Q., Yuan, K., Wu, G., & Yin, W. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2304432 · Cited by 820
Restoration of Poissonian Images Using Alternating Direction Optimization
Figueiredo, M. A. T., & Bioucas-Dias, J. M. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2053941 · Cited by 372
A Splitting Method for Optimal Control
O'Donoghue, B., Stathopoulos, G., & Boyd, S. (2013) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2231960 · Cited by 172
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
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
Deng, W., & Yin, W. (2012) · Defense Technical Information Center (DTIC) · doi:10.21236/ada567407 · Cited by 162
Parallel alternating direction multiplier decomposition of convex programs
Eckstein, J. (1994) · Journal of Optimization Theory and Applications · doi:10.1007/bf02196592 · Cited by 152
Boley, D. L. (2013) · SIAM Journal on Optimization · doi:10.1137/120878951 · Cited by 150
Segmentation of ARX-models using sum-of-norms regularization
Ohlsson, H., Lennart Ljung, A., & Boyd, S. (2010) · Automatica · doi:10.1016/j.automatica.2010.03.013 · Cited by 142
Multi-Step Gradient Methods for Networked Optimization
Ghadimi, E., Shames, I., & Johansson, M. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2278149 · Cited by 91
Self-citation
Cited by
OSQP: an operator splitting solver for quadratic programs
Stellato, B., Banjac, G., Goulart, P., Bemporad, A., & Boyd, S. (2020) · Mathematical Programming Computation · doi:10.1007/s12532-020-00179-2 · Cited by 1,213
Bi, S., & Zhang, Y. J. (2018) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2821664 · Cited by 870
Reference and command governors for systems with constraints: A survey on theory and applications
Garone, E., Di Cairano, S., & Kolmanovsky, I. (2017) · Automatica · doi:10.1016/j.automatica.2016.08.013 · Cited by 466
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
Plug-and-Play Priors for Bright Field Electron Tomography and Sparse Interpolation
Sreehari, S., Venkatakrishnan, S. V., Wohlberg, B., Buzzard, G. T., Drummy, L. F., Simmons, J. P., & Bouman, C. A. (2016) · IEEE Transactions on Computational Imaging · doi:10.1109/tci.2016.2599778 · Cited by 300
Metadata
- Authors
- Ghadimi, E., Teixeira, A., Shames, I., & Johansson, M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2015-03
- Volume
- 60
- Issue
- 3
- Pages
- 644-658
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2037603831
- Cited by
- 437
- References
- 18
- FWCI
- 31.34
- 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.