The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Fast Alternating Direction Optimization Methods
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Chambolle, A., & Pock, T. (2011) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-010-0251-1 · Cited by 4,336
The Split Bregman Method for L1-Regularized Problems
Goldstein, T., & Osher, S. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080725891 · Cited by 4,282
Self-citationEckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Gabay, D., & Mercier, B. (1976) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(76)90003-1 · Cited by 2,514
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
The Fourier reconstruction of a head section
Shepp, L. A., & Logan, B. F. (1974) · IEEE Transactions on Nuclear Science · doi:10.1109/tns.1974.6499235 · Cited by 2,179
Proximité et dualité dans un espace hilbertien
Moreau, J. J. (1965) · Bulletin de la Société mathématique de France · doi:10.24033/bsmf.1625 · Cited by 1,462
Problem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
Total variation blind deconvolution
Chan, T. F., & Wong, C.-K. (1998) · IEEE Transactions on Image Processing · doi:10.1109/83.661187 · Cited by 1,201
Glowinski, R., & Marroco, A. (1975) · Revue française d'automatique, informatique, recherche opérationnelle. Analyse numérique · doi:10.1051/m2an/197509r200411 · Cited by 1,105
Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics.
Oden, J. T., Glowinski, R., & Tallec, P. L. (1992) · Mathematics of Computation · doi:10.2307/2153048 · Cited by 972
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2009) · Cited by 897
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/090756855 · Cited by 848
Principles of magnetic resonance imaging : a signal processing perspective
Liang, Z.-P., & Lauterbur, P. C. (2000) · Cited by 767
On the linear convergence of the alternating direction method of multipliers
Hong, M., & Luo, Z.-Q. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1034-2 · Cited by 690
On the Convergence of the Proximal Point Algorithm for Convex Minimization
Güler, O. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329022 · Cited by 681
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
Deng, W., & Yin, W. (2016) · Journal of Scientific Computing · doi:10.1007/s10915-015-0048-x · Cited by 650
Adaptive Restart for Accelerated Gradient Schemes
O’Donoghue, B., & Candès, E. (2015) · Foundations of Computational Mathematics · doi:10.1007/s10208-013-9150-3 · Cited by 642
Self-citationErgodic convergence to a zero of the sum of monotone operators in Hilbert space
Passty, G. B. (1979) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(79)90234-8 · Cited by 609
An accelerated gradient method for trace norm minimization
Ji, S., & Ye, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553434 · Cited by 517
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
Goldstein, T., Bresson, X., & Osher, S. (2010) · Journal of Scientific Computing · doi:10.1007/s10915-009-9331-z · Cited by 452
Self-citationOn non-ergodic convergence rate of Douglas–Rachford alternating direction method of multipliers
He, B., & Yuan, X. (2014) · Numerische Mathematik · doi:10.1007/s00211-014-0673-6 · Cited by 299
Signal recovery from random projections
Candes, E. J., & Romberg, J. K. (2005) · SPIE Proceedings · doi:10.1117/12.600722 · Cited by 299
Fast alternating linearization methods for minimizing the sum of two convex functions
Goldfarb, D., Ma, S., & Scheinberg, K. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0530-2 · Cited by 246
Regression Approaches for Microarray Data Analysis
Segal, M. R., Dahlquist, K. D., & Conklin, B. R. (2003) · Journal of Computational Biology · doi:10.1089/106652703322756177 · Cited by 188
Bruck, R. E. (1977) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(77)90152-4 · Cited by 166
On the Linear Convergence of the Alternating Direction Method of Multipliers
Luo, T. (2013) · Cited by 130
Mri Reconstruction Using Discrete Fourier Transform: A Tutorial
Aibinu, A. M., Salami, M. J. E., Shafie, A. A., & Najeeb, A. R. (2008) · doi:10.5281/zenodo.1081716 · Cited by 20
Cited by
Chen, C. L. P., & Liu, Z. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2716952 · Cited by 1,957
Plug-and-Play ADMM for Image Restoration: Fixed-Point Convergence and Applications
Chan, S. H., Wang, X., & Elgendy, O. A. (2017) · IEEE Transactions on Computational Imaging · doi:10.1109/tci.2016.2629286 · Cited by 904
Hong, M., Luo, Z.-Q., & Razaviyayn, M. (2016) · SIAM Journal on Optimization · doi:10.1137/140990309 · Cited by 841
On the linear convergence of the alternating direction method of multipliers
Hong, M., & Luo, Z.-Q. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1034-2 · Cited by 690
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
Deng, W., & Yin, W. (2016) · Journal of Scientific Computing · doi:10.1007/s10915-015-0048-x · Cited by 650
Metadata
- Authors
- Goldstein, T., O'Donoghue, B., Setzer, S., & Baraniuk, R.
- Venue
- SIAM Journal on Imaging Sciences
- Published
- 2014-01
- Volume
- 7
- Issue
- 3
- Pages
- 1588-1623
- ISSN
- 1936-4954 (ISSN-L)
- OpenAlex
- W2076261573
- Cited by
- 785
- References
- 40
- FWCI
- 80.38
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.