The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
Abstract
The alternating direction method of multipliers (ADMM) is widely used to solve large-scale linearly constrained optimization problems, convex or nonconvex, in many engineering fields. However there is a general lack of theoretical understanding of the algorithm when the objective function is nonconvex. In this paper we analyze the convergence of the ADMM for solving certain nonconvex consensus and sharing problems. We show that the classical ADMM converges to the set of stationary solutions, provided that the penalty parameter in the augmented Lagrangian is chosen to be sufficiently large. For the sharing problems, we show that the ADMM is convergent regardless of the number of variable blocks. Our analysis does not impose any assumptions on the iterates generated by the algorithm and is broadly applicable to many ADMM variants involving proximal update rules and various flexible block selection rules.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
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
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Self-citationOn the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
Fast Alternating Direction Optimization Methods
Goldstein, T., O'Donoghue, B., Setzer, S., & Baraniuk, R. (2014) · SIAM Journal on Imaging Sciences · doi:10.1137/120896219 · Cited by 785
Chen, C., He, B., Ye, Y., & Yuan, X. (2014) · Mathematical Programming · doi:10.1007/s10107-014-0826-5 · Cited by 719
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
1Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
Lin, F., Fardad, M., & Jovanović, M. R. (2016) · Cited by 447
A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration
Zhang, X., Burger, M., & Osher, S. (2011) · Journal of Scientific Computing · doi:10.1007/s10915-010-9408-8 · Cited by 419
Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
Lin, F., Fardad, M., & Jovanovic, M. R. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2013.2257618 · Cited by 385
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
Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
Scutari, G., Facchinei, F., Song, P., Palomar, D. P., & Pang, J.-S. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2293126 · Cited by 338
An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
Yang, J., Zhang, Y., & Yin, W. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080732894 · Cited by 336
Shen, Y., Wen, Z., & Zhang, Y. (2014) · Optimization Methods and Software · doi:10.1080/10556788.2012.700713 · Cited by 299
Fast alternating linearization methods for minimizing the sum of two convex functions
Goldfarb, D., Ma, S., & Scheinberg, K. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0530-2 · Cited by 246
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
Distributed Clustering Using Wireless Sensor Networks
Forero, P. A., Cano, A., & Giannakis, G. B. (2011) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2011.2114324 · Cited by 191
Monteiro, R. D. C., & Svaiter, B. F. (2013) · SIAM Journal on Optimization · doi:10.1137/110849468 · Cited by 188
Min Flow Rate Maximization for Software Defined Radio Access Networks
Liao, W.-C., Hong, M., Farmanbar, H., et al. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328171 · Cited by 66
Self-citation
Cited by
Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
Wang, Y., Yin, W., & Zeng, J. (2019) · Journal of Scientific Computing · doi:10.1007/s10915-018-0757-z · Cited by 1,268
Hong, M., Razaviyayn, M., Luo, Z.-Q., & Pang, J.-S. (2016) · IEEE Signal Processing Magazine · doi:10.1109/msp.2015.2481563 · Cited by 447
Self-citationExogenous Cost Allocation in Peer-to-Peer Electricity Markets
Baroche, T., Pinson, P., Latimier, R. L. G., & Ahmed, H. B. (2019) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2019.2896654 · Cited by 314
Shi, Q., & Hong, M. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3001906 · Cited by 283
Self-citationFederated Tensor Factorization for Computational Phenotyping
Kim, Y., Sun, J., Yu, H., & Jiang, X. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098118 · Cited by 128
Metadata
- Authors
- Hong, M., Luo, Z.-Q., & Razaviyayn, M.
- Venue
- SIAM Journal on Optimization
- Published
- 2016-01
- Volume
- 26
- Issue
- 1
- Pages
- 337-364
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2295652899
- Cited by
- 841
- References
- 21
- FWCI
- 87.53
- Type
- journal article
- Language
- en
- Open access
- closed
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.