The Split Bregman Method for L1-Regularized Problems
SIAM Journal on Imaging Sciences · 2009 · 4,316 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Goldstein, T., & Osher, S. (2009). The split bregman method for L1-Regularized problems. SIAM Journal on Imaging Sciences, 2(2), 323–343. https://doi.org/10.1137/080725891
In text: (Goldstein & Osher, 2009)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
The class of L1-regularized optimization problems has received much attention recently because of the introduction of “compressed sensing,” which allows images and signals to be reconstructed from small amounts of data. Despite this recent attention, many L1-regularized problems still remain difficult to solve, or require techniques that are very problem-specific. In this paper, we show that Bregman iteration can be used to solve a wide variety of constrained optimization problems. Using this technique, we propose a “split Bregman” method, which can solve a very broad class of L1-regularized problems. We apply this technique to the Rudin–Osher–Fatemi functional for image denoising and to a compressed sensing problem that arises in magnetic resonance imaging.
Related papers
Metadata from OpenAlex (CC0). Citations are generated from the published record.