Abstract
© 2016, Springer Science+Business Media New York. In this paper, we establish the convergence properties for a majorized alternating direction method of multipliers 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 two-block alternating direction method of multipliers with a large step length of the golden ratio 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.
Original language | English |
---|---|
Pages (from-to) | 1013-1041 |
Number of pages | 29 |
Journal | Journal of Optimization Theory and Applications |
Volume | 169 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1 Jun 2016 |
Externally published | Yes |
Keywords
- Convex quadratic programming
- Coupled objective function
- Iteration complexity
- Majorization
- Nonsmooth analysis
ASJC Scopus subject areas
- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics