The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Analysis and Generalizations of the Linearized Bregman Method
Abstract
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregman method has the exact regularization property; namely, it converges to an exact solution of the basis pursuit problem whenever its smooth parameter $\alpha$ is greater than a certain value. The analysis is based on showing that the linearized Bregman algorithm is equivalent to gradient descent applied to a certain dual formulation. This result motivates generalizations of the algorithm enabling the use of gradient-based optimization techniques such as line search, Barzilai–Borwein, limited memory BFGS (L-BFGS), nonlinear conjugate gradient, and Nesterov's methods. In the numerical simulations, the two proposed implementations, one using Barzilai–Borwein steps with nonmonotone line search and the other using L-BFGS, gave more accurate solutions in much shorter times than the basic implementation of the linearized Bregman method with a so-called kicking technique.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064 · cited 1×
“They include iterative soft-thresholding algorithms [50, 22, 24, 21, 18, 37, 36, 5, 62], GPSR [29], SPGL1 [58], 1 s [42], FPC AS [61], Nesterov-type algorithms [48, 3], and others.”
MethodA New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975
Self-citation
Cited by
Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation
Lin, Z., Liu, R., & Su, Z. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.0367 · Cited by 992
Esser, E., Zhang, X., & Chan, T. F. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/09076934x · Cited by 695
On the Convergence of Decentralized Gradient Descent
Yuan, K., Ling, Q., & Yin, W. (2013) · arXiv · doi:10.48550/arxiv.1310.7063 · Cited by 635
Self-citationOn the Convergence of Decentralized Gradient Descent
Yuan, K., Ling, Q., & Yin, W. (2016) · SIAM Journal on Optimization · doi:10.1137/130943170 · Cited by 633
Self-citationWu, C., & Tai, X.-C. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/090767558 · Cited by 615
Metadata
- Authors
- Yin, W.
- Venue
- SIAM Journal on Imaging Sciences
- Published
- 2010-01
- Volume
- 3
- Issue
- 4
- Pages
- 856-877
- ISSN
- 1936-4954 (ISSN-L)
- OpenAlex
- W2072378378
- Cited by
- 189
- References
- 2
- FWCI
- 14.84
- 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.