Relative-error approximate versions of Douglas–Rachford splitting and special cases of the ADMM
- 20 May 2017
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 170 (2) , 417-444
Abstract
No abstract availableKeywords
Funding Information
- Division of Computing and Communication Foundations (CCF-1115638, CCF-1617617)
This publication has 24 references indexed in Scilit:
- A practical relative error criterion for augmented LagrangiansMathematical Programming, 2012
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- The elements of statistical learning: data mining, inference and predictionThe Mathematical Intelligencer, 2005
- Finding predictive gene groups from microarray dataJournal of Multivariate Analysis, 2004
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational InequalitiesSIAM Journal on Control and Optimization, 1991
- How not to lie with statistics: the correct way to summarize benchmark resultsCommunications of the ACM, 1986
- 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
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976