Accelerated linearized Bregman method (Q1945379)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Accelerated linearized Bregman method |
scientific article |
Statements
Accelerated linearized Bregman method (English)
0 references
8 April 2013
0 references
The authors consider the following optimization problem \[ \min_{x\in\mathbb{R}^n}\, J(x)\quad\text{s.t. } Ax=b, \] and as the important instance the so-called basis pursuit problem \[ \min_{x\in\mathbb{R}^n}\,\| x\|_1\quad\text{s.t. }Ax=b, \] and propose and analyse an accelerated linearized Bregman method for solving the basis pursuit and related sparse optimization problems.
0 references
convex optimization
0 references
linearized Bregman method
0 references
accelerated linearized Bregman method
0 references
compressed sensing
0 references
basis pursuit
0 references
matrix completion
0 references
0 references
0 references
0 references
0 references