Complexity analysis of a stochastic variant of generalized alternating direction method of multipliers

DOI10.1007/978-3-031-20350-3_18OpenAlexW4313349369MaRDI QIDQ6111959

Cong-Ying Han, Tian-de Guo, Jia Hu

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20350-3_18

zbMATH Keywords

stochastic approximationiteration complexityalternating direction method of multipliers (ADMM)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• An optimal method for stochastic composite optimization
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• On the information-adaptive variants of the ADMM: an iteration complexity perspective
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
• Global convergence of ADMM in nonconvex nonsmooth optimization
• On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Generalized alternating direction method of multipliers: new theoretical insights and applications
• Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Global Convergence of Splitting Methods for Nonconvex Composite Optimization
• Robust Stochastic Approximation Approach to Stochastic Programming
• A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
• Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
• On Alternating Direction Methods of Multipliers: A Historical Perspective
• Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
• Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
• A Stochastic Approximation Method
• Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization

This page was built for publication: Complexity analysis of a stochastic variant of generalized alternating direction method of multipliers