# Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems

arXiv: https://arxiv.org/abs/1410.1390 · HTML: https://mlsanity.com/paper/1410.1390/

## Key facts

- Cited by 64 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Oct 2014.

## Built on by (most cited first, 30 of 64)

- [Learning to Warm-Start Fixed-Point Optimization Algorithms](https://mlsanity.com/paper/2309.07835/) (2023)
- [Towards Federated Bayesian Network Structure Learning with Continuous Optimization](https://mlsanity.com/paper/2110.09356/) (2021)
- [FedADMM: A Robust Federated Deep Learning Framework with Adaptivity to System Heterogeneity](https://mlsanity.com/paper/2204.03529/) (2022)
- [Robust and Explainable Autoencoders for Unsupervised Time Series Outlier Detection---Extended Version](https://mlsanity.com/paper/2204.03341/) (2022)
- [ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models](https://mlsanity.com/paper/2406.07831/) (2024)
- [FORMS: Fine-grained Polarized ReRAM-based In-situ Computation for Mixed-signal DNN Accelerator](https://mlsanity.com/paper/2106.09144/) (2021)
- [Rethinking Bayesian Learning for Data Analysis: The Art of Prior and Inference in Sparsity-Aware Modeling](https://mlsanity.com/paper/2205.14283/) (2022)
- [A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization](https://mlsanity.com/paper/2207.05650/) (2022)
- [Federated Learning and Meta Learning: Approaches, Applications, and Directions](https://mlsanity.com/paper/2210.13111/) (2022)
- [Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization](https://mlsanity.com/paper/2301.13314/) (2023)
- [GRIM: A General, Real-Time Deep Learning Inference Framework for Mobile Devices based on Fine-Grained Structured Weight Sparsity](https://mlsanity.com/paper/2108.11033/) (2021)
- [Improving Privacy-Preserving Vertical Federated Learning by Efficient Communication with ADMM](https://mlsanity.com/paper/2207.10226/) (2022)
- [Training Recurrent Neural Networks by Sequential Least Squares and the Alternating Direction Method of Multipliers](https://mlsanity.com/paper/2112.15348/) (2021)
- [vSHARP: variable Splitting Half-quadratic Admm algorithm for Reconstruction of inverse-Problems](https://mlsanity.com/paper/2309.09954/) (2023)
- [AugFL: Augmenting Federated Learning with Pretrained Models](https://mlsanity.com/paper/2503.02154/) (2025)
- [Federated PCA on Grassmann Manifold for Anomaly Detection in IoT Networks](https://mlsanity.com/paper/2212.12121/) (2022)
- [PnP-CM: Consistency Models as Plug-and-Play Priors for Inverse Problems](https://mlsanity.com/paper/2509.22736/) (2025)
- [Fully Decentralized, Scalable Gaussian Processes for Multi-Agent Federated Learning](https://mlsanity.com/paper/2203.02865/) (2022)
- [Smoothing ADMM for Sparse-Penalized Quantile Regression with Non-Convex Penalties](https://mlsanity.com/paper/2309.03094/) (2023)
- [Communication-Efficient Stochastic Distributed Learning](https://mlsanity.com/paper/2501.13516/) (2025)
- [Distributed saddle point problems for strongly concave-convex functions](https://mlsanity.com/paper/2202.05812/) (2022)
- [Federated PCA on Grassmann Manifold for IoT Anomaly Detection](https://mlsanity.com/paper/2407.07421/) (2024)
- [Alternating Direction Method of Multipliers for Nonlinear Matrix Decompositions](https://mlsanity.com/paper/2512.17473/) (2025)
- [Sparsity-Aware Distributed Learning for Gaussian Processes with Linear Multiple Kernel](https://mlsanity.com/paper/2309.08201/) (2023)
- [Privacy-preserving Federated Primal-dual Learning for Non-convex and Non-smooth Problems with Model Sparsification](https://mlsanity.com/paper/2310.19558/) (2023)
- [Decentralized Smoothing ADMM for Quantile Regression with Non-Convex Sparse Penalties](https://mlsanity.com/paper/2408.01307/) (2024)
- [HR-Bandit: Human-AI Collaborated Linear Recourse Bandit](https://mlsanity.com/paper/2410.14640/) (2024)
- [Dual-space posterior sampling for Bayesian inference in constrained inverse problems](https://mlsanity.com/paper/2603.00393/) (2026)
- [Learning Multi-Agent Coordination via Sheaf-ADMM](https://mlsanity.com/paper/2605.31005/) (2026)
- [Efficient Algorithms for Estimating the Parameters of Mixed Linear Regression Models](https://mlsanity.com/paper/2105.05953/) (2021)

## Abstract (arXiv)

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, and 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.