Fast Alternating Direction Optimization Methods
Tom Goldstein, Brendan O’Donoghue, Simon Setzer et al. · SIAM Journal on Imaging Sciences · 2014
Alternating direction methods are a common tool for general mathematical programming and optimization. These methods have become particularly important in the field of variational image processing, which frequently requires the minimization of nondifferentiable objectives. This paper considers accelerated (i.e., fast) variants of two common alternating direction methods: the alternating direction method of multipliers (ADMM) and the alternating minimization algorithm (AMA). The proposed acceleration is of the form first proposed by Nesterov for gradient descent methods. In the case that the objective function is strongly convex, global convergence bounds are provided for both classical and accelerated variants of the methods. Numerical examples are presented to demonstrate the superior performance of the fast methods for a wide variety of problems.
Cited by 785 works. doi:10.1137/120896219
Authors
References
- Convex Optimization
- Regression Shrinkage and Selection Via the Lasso
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Nonlinear total variation based noise removal algorithms
- Regularization and Variable Selection Via the Elastic Net
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- The Fourier reconstruction of a head section
- Sparse MRI: The application of compressed sensing for rapid MR imaging