# Convergence for nonconvex ADMM, with applications to CT imaging

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

## Key facts

- Cited by 8 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Jun 2020.

## Built on by (most cited first, 8 of 8)

- [Federated Learning and Meta Learning: Approaches, Applications, and Directions](https://mlsanity.com/paper/2210.13111/) (2022)
- [AugFL: Augmenting Federated Learning with Pretrained Models](https://mlsanity.com/paper/2503.02154/) (2025)
- [Accurate, provable and fast polychromatic tomographic reconstruction: A variational inequality approach](https://mlsanity.com/paper/2503.19925/) (2025)
- [Learning to accelerate distributed ADMM using graph neural networks](https://mlsanity.com/paper/2509.05288/) (2025)
- [NanoQuant: Efficient Sub-1-Bit Quantization of Large Language Models](https://mlsanity.com/paper/2602.06694/) (2026)
- [Douglas-Rachford Splitting for Group-Sparse Feedback Linear-Quadratic Control](https://mlsanity.com/paper/2507.19895/) (2025)
- [Perfusion Imaging and Single Material Reconstruction in Polychromatic Photon Counting CT](https://mlsanity.com/paper/2602.02713/) (2026)
- [Second-Order KKT Guarantees for Bregman ADMM in Nonconvex and Non-Lipschitz Optimization](https://mlsanity.com/paper/2606.28307/) (2026)

## Abstract (arXiv)

The alternating direction method of multipliers (ADMM) algorithm is a powerful and flexible tool for complex optimization problems of the form minf(x)+g(y) : Ax+By=c. ADMM exhibits robust empirical performance across a range of challenging settings including nonsmoothness and nonconvexity of the objective functions f and g, and provides a simple and natural approach to the inverse problem of image reconstruction for computed tomography (CT) imaging. From the theoretical point of view, existing results for convergence in the nonconvex setting generally assume smoothness in at least one of the component functions in the objective. In this work, our new theoretical results provide convergence guarantees under a restricted strong convexity assumption without requiring smoothness or differentiability, while still allowing differentiable terms to be treated approximately if needed. We validate these theoretical results empirically, with a simulated example where both f and g are nondifferentiable -- and thus outside the scope of existing theory -- as well as a simulated CT image reconstruction problem.