Split Bregman algorithms for multiple measurement vector problem
type: Item
instance of: scholarly article
title: Split Bregman algorithms for multiple measurement vector problem
zbMATH Open document ID: 1349.94098
author: Jian Zou
author: Qiheng Zhang
author: Y. L. Fu
author: Haifeng Li
published in: Multidimensional Systems and Signal Processing
publication date: 2016-11-10T00:00:00Z
Mathematics Subject Classification ID: 94A12
zbMATH DE Number: 6650261
zbMATH Keywords: multiple measurement vector problem
zbMATH Keywords: split Bregman iteration
zbMATH Keywords: convergence
zbMATH Keywords: MRI reconstruction
describes a project that uses: Yall1
describes a project that uses: SLEP
MaRDI profile type: Publication
full work available at URL: s11045-013-0251-6
OpenAlex ID: W2081976260
cites work: Distributed Spectrum Sensing for Cognitive Radio Networks by Exploiting Sparsity
cites work: Theoretical and Empirical Results for Recovery From Multiple Measurements
cites work: Algorithms for simultaneous sparse approximation. II: Convex relaxation
cites work: Split Bregman Methods and Frame Based Image Restoration
cites work: Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
cites work: Sparse solutions to linear inverse problems with multiple measurement vectors
cites work: Rank Awareness in Joint Sparse Recovery
cites work: Structured Compressed Sensing: From Theory to Applications
cites work: Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
cites work: The Split Bregman Method for L1-Regularized Problems
cites work: The benefit of group sparsity
cites work: Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization
cites work: Subspace Methods for Joint Sparse Recovery
cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
cites work: Fixed point and Bregman iterative methods for matrix rank minimization
cites work: Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
cites work: Efficient block-coordinate descent algorithms for the group Lasso
cites work: Algorithms for simultaneous sparse approximation. I: Greedy pursuit
cites work: A coordinate gradient descent method for nonsmooth separable minimization
cites work: Model Selection and Estimation in Regression with Grouped Variables
DOI: 10.1007/S11045-013-0251-6
Recommended article: The Split Bregman Method for L1-Regularized Problems
Recommended article: A fast splitting method for efficient split Bregman iterations
Recommended article: Forward-backward splitting with Bregman distances
Recommended article: Bregman three-operator splitting methods
Recommended article: A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings
Recommended article: The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization
Recommended article: Q3126807
Recommended article: The linearized Bregman method via split feasibility problems: analysis and generalizations
Recommended article: Bregman forward-backward operator splitting
description: scientific article; zbMATH DE number 6650261