The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- 17 October 2014
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 155 (1-2), 57-79
- https://doi.org/10.1007/s10107-014-0826-5
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- A splitting method for separable convex programmingIMA Journal of Numerical Analysis, 2014
- Latent variable graphical model selection via convex optimizationThe Annals of Statistics, 2012
- A Note on the Alternating Direction Method of MultipliersJournal of Optimization Theory and Applications, 2012
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex ProgrammingSIAM Journal on Optimization, 2012
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction MethodSIAM Journal on Numerical Analysis, 2012
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends® in Machine Learning, 2010
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- Numerical Methods for Nonlinear Variational ProblemsPublished by Springer Science and Business Media LLC ,1984
- Modified Lagrangians in convex programming and their generalizationsPublished by Springer Science and Business Media LLC ,1979
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976