Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization (Q368088)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6209009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization |
scientific article; zbMATH DE number 6209009 |
Statements
Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization (English)
0 references
18 September 2013
0 references
The Bregman method and a linearized Bregman method for solving total variation-based image restoration are reviewed. The authors propose an accelerated algorithm for the Bregman method to solve the linearly constrained \(\ell _1-\ell _2\) minimization. The proposed accelerated Bregman method is equivalent to the accelerated augmented Lagrangian method. The global convergence rate of the proposed algorithm is established. Some numerical test results are presented to show that the proposed method is faster than the original Bregman method and the accelerated linearized Bregman method.
0 references
Bregman iteration
0 references
accelerated Bregman method
0 references
compressive sensing
0 references
\(\ell _1-\ell _2\) minimization
0 references
augmented Lagrangian method
0 references
numerical examples
0 references
linearized Bregman method
0 references
image restoration
0 references
algorithm
0 references
global convergence
0 references
0 references
0 references
0 references
0.841679036617279
0 references
0.8388498425483704
0 references
0.822681725025177
0 references
0.8156387209892273
0 references
0.8082574009895325
0 references
