Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
Xiyuan Xie, Lihua Yang, Qia li

TL;DR
This paper analyzes the local convergence of ADMM for nonconvex composite problems common in imaging and machine learning, establishing conditions for convergence and linear rates under certain assumptions.
Contribution
It provides the first local convergence analysis of ADMM for nonconvex problems with polyhedral constraints, including a new strong convexity property of the Moreau envelope.
Findings
ADMM converges locally to primal-dual solutions under specific conditions.
A local linear convergence rate is established for polyhedral convex constraints.
Three examples demonstrate the applicability and necessity of the assumptions.
Abstract
In this paper, we study the local convergence of the standard ADMM scheme for a class of nonconvex composite problems arising from modern imaging and machine learning models. This problem is constrained by a closed convex set, while its objective is the sum of a continuously differentiable (possibly nonconvex) smooth term and a polyhedral convex nonsmooth term composed with a linear mapping. Our analysis is mainly motivated by the recent works of Rockafellar [29,30]. We begin with an elementary proof of a key local strong convexity property of the Moreau envelope of polyhedral convex functions. Building on this property, we show that the strong variational sufficiency condition holds for the considered problem under appropriate assumptions. Using the strong variational sufficiency condition, we further derive a descent inequality for the ADMM iterates, in a form analogous to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Stochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques
