Abstract
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 (US) |
|---|---|
| Pages (from-to) | 1013-1041 |
| Number of pages | 29 |
| Journal | Journal of Optimization Theory and Applications |
| Volume | 169 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jun 1 2016 |
| Externally published | Yes |
Bibliographical note
Funding Information:The authors would like to thank Caihua Chen at the Nanjing University for discussions on the iteration complexity described in the paper, and Bo Chen at the National University of Singapore for the comments on the global convergence conditions in Theorem . The research of Defeng Sun was supported in part by the Academic Research Fund (Grant No. R-146-000-207-112). The research of Kim-Chuan Toh was supported in part by the Ministry of Education, Singapore, Academic Research Fund (Grant No. R-146-000-194-112).
Publisher Copyright:
© 2016, Springer Science+Business Media New York.
Keywords
- Convex quadratic programming
- Coupled objective function
- Iteration complexity
- Majorization
- Nonsmooth analysis