A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration
Open accessThe DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Abstract
In this paper, we propose a unified primal-dual algorithm framework for two classes of problems that arise from various signal and image processing applications. We also show the connections to existing methods, in particular Bregman iteration (Osher et al., Multiscale Model. Simul. 4(2):460–489, 2005) based methods, such as linearized Bregman (Osher et al., Commun. Math. Sci. 8(1):93–111, 2010; Cai et al., SIAM J. Imag. Sci. 2(1):226–252, 2009, CAM Report 09-28, UCLA, March 2009; Yin, CAAM Report, Rice University, 2009) and split Bregman (Goldstein and Osher, SIAM J. Imag. Sci., 2, 2009). The convergence of the general algorithm framework is proved under mild assumptions. The applications to ℓ 1 basis pursuit, TV−L 2 minimization and matrix completion are demonstrated. Finally, the numerical examples show the algorithms proposed are easy to implement, efficient, stable and flexible enough to cover a wide variety of applications.
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
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
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
Self-citationCandes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Principles of Computerized Tomographic Imaging
Kak, A. C., & Slaney, M. (2001) · doi:10.1137/1.9780898719277 · Cited by 5,809
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
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-citationFigueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
chambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
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
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Multiplier and gradient methods
Hestenes, M. R. (1969) · Journal of Optimization Theory and Applications · doi:10.1007/bf00927673 · Cited by 2,446
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
An Iterative Regularization Method for Total Variation-Based Image Restoration
Osher, S., Burger, M., Goldfarb, D., Xu, J., & Yin, W. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040605412 · Cited by 1,787
Self-citationOn the numerical solution of heat conduction problems in two and three space variables
Douglas, J., & Rachford, H. H. (1956) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1956-0084194-4 · Cited by 1,744
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
Self-citationAugmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Rockafellar, R. T. (1976) · Mathematics of Operations Research · doi:10.1287/moor.1.2.97 · Cited by 1,175
Fixed point and Bregman iterative methods for matrix rank minimization
Ma, S., Goldfarb, D., & Chen, L. (2011) · Mathematical Programming · doi:10.1007/s10107-009-0306-5 · Cited by 1,048
Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics
Glowinski, R., & Tallec, P. L. (1989) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970838 · Cited by 1,015
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
Studies in Linear and Non-Linear Programming.
Beale, E. M. L., Arrow, K. J., Hurwicz, L., Uzawa, H., Chenery, H. B., Johnson, S. M., Karlin, S., Marschak, T., & Solow, R. M. (1959) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342801 · Cited by 915
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2009) · Cited by 897
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
Chan, T. F., Golub, G. H., & Mulet, P. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596299767 · Cited by 840
An Algorithm for Total Variation Minimization and Applications
Chambolle, A. (2004) · Journal of Mathematical Imaging and Vision · doi:10.1023/b:jmiv.0000011325.36760.1e · Cited by 832
Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
Zhang, X., Burger, M., Bresson, X., & Osher, S. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/090746379 · Cited by 688
Self-citationStudies in Linear and Non-Linear Programming.
Suzuki, G., Arrow, K. J., Hurwicz, L., & Uzawa, H. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002823 · Cited by 520
Fonctions convexes duales et points proximaux dans un espace hilbertien
Moreau, J. J. (1962) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 501
An iterative row-action method for interval convex programming
Censor, Y., & Lent, A. H. (1981) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934676 · Cited by 498
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-citationConvergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
Chen, G., & Teboulle, M. (1993) · SIAM Journal on Optimization · doi:10.1137/0803026 · Cited by 428
Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
Bramble, J. H., Pasciak, J. E., & Vassilev, A. T. (1997) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142994273343 · Cited by 406
A proximal-based decomposition method for convex minimization problems
Chen, G., & Teboulle, M. (1994) · Mathematical Programming · doi:10.1007/bf01582566 · Cited by 392
An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
Yang, J., Zhang, Y., & Yin, W. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080732894 · Cited by 336
Hutchison, D., Mørken, K., Steffen, B., Takeo Kanade, A., Kittler, J., Kleinberg, J. M., Mattern, F., Mitchell, J. C., Naor, M., Lie, K.-A., et al. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02256-2 · Cited by 278
Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
Lemaréchal, C., & Sagastizábal, C. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623494267127 · Cited by 236
A fast Iterative Shrinkage-Thresholding Algorithm with application to wavelet-based image deblurring
Beck, A., & Teboulle, M. (2009) · 2009 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2009.4959678 · Cited by 236
Linearized Bregman Iterations for Frame-Based Image Deblurring
Cai, J.-F., Osher, S., & Shen, Z. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080733371 · Cited by 204
Self-citationSplit Bregman Algorithm, Douglas-Rachford Splitting and Frame Shrinkage
Setzer, S. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02256-2_39 · Cited by 191
Analysis and Generalizations of the Linearized Bregman Method
Yin, W. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/090760350 · Cited by 189
Augmented Lagrangian Method, Dual Methods and Split Bregman Iteration for ROF Model
Tai, X.-C., & Wu, C. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02256-2_42 · Cited by 185
Li, Y., & Osher, S. (2009) · Inverse Problems and Imaging · doi:10.3934/ipi.2009.3.487 · Cited by 146
Self-citationOn the Convergence of Primal–Dual Hybrid Gradient Algorithms for Total Variation Image Restoration
Bonettini, S., & Ruggiero, V. (2012) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-011-0324-9 · Cited by 97
A Fast $\ell$1-TV Algorithm for Image Restoration
Guo, X., Li, F., & Ng, M. K. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080724435 · Cited by 74
A Simple Compressive Sensing Algorithm for Parallel Many-Core Architectures
Borghi, A., Darbon, J., Peyronnet, S., Chan, T. F.-C., & Osher, S. (2012) · Journal of Signal Processing Systems · doi:10.1007/s11265-012-0671-9 · Cited by 31
Self-citationPractical aspects of the Moreau-Yosida regularization I : theoretical properties
Lemaréchal, C., & Sagastizábal, C. A. (1994) · Cited by 15
Cited by
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Condat, L. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0245-9 · Cited by 912
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
Hong, M., Luo, Z.-Q., & Razaviyayn, M. (2016) · SIAM Journal on Optimization · doi:10.1137/140990309 · Cited by 841
Esser, E., Zhang, X., & Chan, T. F. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/09076934x · Cited by 695
Self-citation
Metadata
- Authors
- Zhang, X., Burger, M., & Osher, S.
- Venue
- Journal of Scientific Computing
- Published
- 2010-08-05
- Volume
- 46
- Issue
- 1
- Pages
- 20-46
- ISSN
- 0885-7474 (ISSN-L)
- 1573-7691
- OpenAlex
- W2016910236
- Cited by
- 419
- References
- 51
- FWCI
- 25.27
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.