A class of ADMM-based algorithms for three-block separable convex programming
Authors:
- 6 March 2018
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 70 (3) , 791-826
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (10471056)
- NSFC/RGC Joint Research Scheme (N_PolyU504/14)
- Research Grants Council, University Grants Committee (HKBU 12313516)
This publication has 30 references indexed in Scilit:
- Latent variable graphical model selection via convex optimizationThe Annals of Statistics, 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, 2011
- A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging ScienceSIAM Journal on Imaging Sciences, 2010
- Image Decomposition and Restoration Using Total Variation Minimization and theH1Multiscale Modeling & Simulation, 2003
- Nonlinear total variation based noise removal algorithmsPhysica D: Nonlinear Phenomena, 1992
- Splitting Algorithms for the Sum of Two Nonlinear OperatorsSIAM Journal on Numerical Analysis, 1979
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert spaceJournal of Mathematical Analysis and Applications, 1979
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976