Name
Title | ||
|---|---|---|
Split Bregman algorithms for sparse group Lasso with application to MRI reconstruction |
Abstract | ||
|---|---|---|
Sparse group lasso, concerning with group-wise and within-group sparsity, is generally considered difficult to solve due to the mixed-norm structure. In this paper, we propose efficient algorithms based on split Bregman iteration to solve sparse group lasso problems, including a synthesis prior form and an analysis prior form. These algorithms have low computational complexity and are suitable for large scale problems. The convergence of the proposed algorithms is also discussed. Moreover, the proposed algorithms are used for magnetic resonance imaging reconstruction. Numerical results show the effectiveness of the proposed algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s11045-014-0282-7 | Multidim. Syst. Sign. Process. |
Keywords | Field | DocType |
Sparse group lasso,Split Bregman iteration,Convergence,MRI reconstruction | Convergence (routing),Bregman iteration,Mathematical optimization,Group lasso,Sparse approximation,Algorithm,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
26 | 3 | 0923-6082 |
Citations | PageRank | References |
3 | 0.40 | 21 |
Authors | ||
2 | ||