On the Proximal Jacobian Decomposition of ALM for Multiple-Block Separable Convex Minimization Problems and Its Relationship to ADMM
Authors:
- 29 June 2015
- journal article
- research article
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 66 (3) , 1204-1217
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processingMathematics of Computation, 2014
- A splitting method for separable convex programmingIMA Journal of Numerical Analysis, 2014
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approachComputational Optimization and Applications, 2013
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex ProgrammingSIAM Journal on Optimization, 2012
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy ObservationsSIAM Journal on Optimization, 2011
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalitiesComputational Optimization and Applications, 2007
- On the Convergence of the Proximal Point Algorithm for Convex MinimizationSIAM Journal on Control and Optimization, 1991
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex ProgrammingMathematics of Operations Research, 1976
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969