On the Optimal Proximal Parameter of an ADMM-like Splitting Method for Separable Convex Programming
- 26 September 2021
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergentMathematical Programming, 2014
- A Strictly Contractive Peaceman--Rachford Splitting Method for Convex ProgrammingSIAM Journal on Optimization, 2014
- A splitting method for separable convex programmingIMA Journal of Numerical Analysis, 2014
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction MethodSIAM Journal on Numerical Analysis, 2012
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy ObservationsSIAM Journal on Optimization, 2011
- Sparsity and Smoothness Via the Fused LassoJournal of the Royal Statistical Society Series B: Statistical Methodology, 2004
- Proximal Decomposition Via Alternating LinearizationSIAM Journal on Optimization, 1999
- Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalitiesOperations Research Letters, 1998
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969