A single-loop Riemannian stochastic smoothing method with recursive momentum attains O(epsilon^-3) iteration complexity for Lipschitz nonsmooth terms, and O~(epsilon^{-max{theta+2,2theta}}) under an error-bound condition for constraints.
Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This paper proposes SMADMM, a single-loop Stochastic Momentum Alternating Direction Method of Multipliers for solving a class of nonconvex and nonsmooth composite optimization problems. SMADMM achieves the optimal oracle complexity of $\mathcal{O}(\epsilon^{-3/2})$ in the online setting. Unlike previous stochastic ADMM algorithms that require large mini-batches or a double-loop structure, SMADMM uses only $\mathcal{O}(1)$ stochastic gradient evaluations per iteration and avoids costly restarts. To further improve practicality, we incorporate dynamic step sizes and penalty parameters, proving that SMADMM maintains its optimal complexity without the need for large initial batches. We also develop PnP-SMADMM by integrating plug-and-play priors, and establish its theoretical convergence under mild assumptions. Extensive experiments on classification, CT image reconstruction, and phase retrieval tasks demonstrate that our approach outperforms existing stochastic ADMM methods both in accuracy and efficiency, validating our theoretical results.
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Single-loop $\mathcal{O}(\epsilon^{-3})$ stochastic smoothing algorithms for nonsmooth Riemannian optimization
A single-loop Riemannian stochastic smoothing method with recursive momentum attains O(epsilon^-3) iteration complexity for Lipschitz nonsmooth terms, and O~(epsilon^{-max{theta+2,2theta}}) under an error-bound condition for constraints.