Fast alternating linearization methods for minimizing the sum of two convex functions
- 24 March 2012
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 141 (1-2), 349-382
- https://doi.org/10.1007/s10107-012-0530-2
Abstract
No abstract availableKeywords
Other Versions
This publication has 40 references indexed in Scilit:
- Robust principal component analysis?Journal of the ACM, 2011
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Sparse inverse covariance estimation with the graphical lassoBiostatistics, 2007
- Model selection and estimation in the Gaussian graphical modelBiometrika, 2007
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Solving monotone inclusions via compositions of nonexpansive averaged operatorsOptimization, 2004
- An EM algorithm for wavelet-based image restorationIEEE Transactions on Image Processing, 2003
- A new inexact alternating directions method for monotone variational inequalitiesMathematical Programming, 2002
- A dual algorithm for the solution of nonlinear variational problems via finite element approximationComputers & Mathematics with Applications, 1976
- On the numerical solution of heat conduction problems in two and three space variablesTransactions of the American Mathematical Society, 1956