On the convergence properties of a majorized ADMM for linearly constrained convex optimization problems with coupled objective functions

Abstract

In this paper, we establish the convergence properties for a majorized alternating direction method of multipliers (ADMM) for linearly constrained convex optimization problems whose objectives contain coupled functions. Our convergence analysis relies on the generalized Mean-Value Theorem which plays an important role to properly control the cross terms due to the presence of coupled objective functions. Our results in particular show that directly applying 2-block ADMM with a large step length to the linearly constrained convex optimization problem with a quadratically coupled objective function is convergent under mild conditions. We also provide several iteration complexity results for the algorithm.

References in corpus (1)

• A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization

Cited by in corpus (15)

• Decentralized Charging Control of Electric Vehicles in Residential Distribution Networks
• Detection of Faults in Rotating Machinery Using Periodic Time-Frequency Sparsity
• Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
• Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Quadratic and Semi-Definite Programming
• Randomized Primal-Dual Proximal Block Coordinate Updates
• Extended ADMM and BCD for Nonseparable Convex Minimization Models with Quadratic Coupling Terms: Convergence Analysis and Insights
• Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs
• Extending the ergodic convergence rate of the proximal ADMM
• A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
• Auxiliary Problem Principle of augmented Lagrangian with Varying Core Functions for Large-Scale Structured Convex Problems
• Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
• A Generalized Alternating Direction Method of Multipliers with Semi-Proximal Terms for Convex Composite Conic Programming
• On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize
• Iteration-complexity analysis of a generalized alternating direction method of multipliers
• A Partially Inexact Alternating Direction Method of Multipliers and its Iteration-Complexity Analysis