A Linearized Alternating Direction Method of Multipliers with Substitution Procedure

DOI10.1142/S0217595915500116zbMath1318.90071MaRDI QIDQ5265451

Hai-Bin Zhang, Cao-Zong Cheng, Mian-Tao Chao

Publication date: 28 July 2015

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

convex programmingconvergence ratealternating direction method of multiplierscontraction methods

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Unnamed Item ⋮ An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications ⋮ Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem

Cites Work

• Unnamed Item
• Positive solutions for a predator-prey interaction model with Holling-type functional response and diffusion
• Decomposition algorithms for generalized potential games
• Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
• Application of the alternating direction method of multipliers to separable convex programming problems
• A note on the alternating direction method of multipliers
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Splitting Algorithms for the Sum of Two Nonlinear Operators