.png){kind=icon}
.png){kind=icon}
Return
Dual-Augmented Lagrangian Method for Efficient Sparse Reconstruction
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2009.2030111.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose an efficient algorithm for sparse signal reconstruction problems. The proposed algorithm is an augmented Lagrangian method based on the dual problem. It is efficient when the number of unknown variables is much larger than the number of observations because of the dual formulation. Moreover, the primal variable is explicitly updated and the sparsity in the solution is exploited. Numerical comparison with the state-of-the-art algorithms shows that the proposed algorithm is favorable when the design matrix is poorly conditioned or dense and very large.
Keywords:
Augmented Lagrangian
L1-regularization
optimization
sparse signal reconstruction
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W