Split Bregman algorithms for multiple measurement vector problem

DOI10.1007/S11045-013-0251-6MaRDI QIDQ336036zbMATH OpenOpenAlexFDO

Authors Jian Zou, Qiheng Zhang, Y. L. Fu, Haifeng Li

Publication date 10 November 2016

Published in Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11045-013-0251-6

zbMATH Keywords

convergenceMRI reconstructionmultiple measurement vector problemsplit Bregman iteration

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• The Split Bregman Method for L1-Regularized Problems
• A fast splitting method for efficient split Bregman iterations
• Forward-backward splitting with Bregman distances
• Bregman three-operator splitting methods
• A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings
• The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization
• scientific article; zbMATH DE number 996056
• The linearized Bregman method via split feasibility problems: analysis and generalizations
• Bregman forward-backward operator splitting

Cites work

• A coordinate gradient descent method for nonsmooth separable minimization
• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• Algorithms for simultaneous sparse approximation. II: Convex relaxation
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating l₁-norm minimization
• Distributed Spectrum Sensing for Cognitive Radio Networks by Exploiting Sparsity
• Efficient block-coordinate descent algorithms for the group Lasso
• Fixed point and Bregman iterative methods for matrix rank minimization
• Model Selection and Estimation in Regression with Grouped Variables
• Rank Awareness in Joint Sparse Recovery
• Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
• Sparse solutions to linear inverse problems with multiple measurement vectors
• Split Bregman methods and frame based image restoration
• Structured Compressed Sensing: From Theory to Applications
• Subspace Methods for Joint Sparse Recovery
• The Split Bregman Method for L1-Regularized Problems
• The benefit of group sparsity
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Theoretical and Empirical Results for Recovery From Multiple Measurements

Cited in

(5)

• A fast algorithm for recovery of jointly sparse vectors based on the alternating direction methods
• Stochastic greedy algorithms for multiple measurement vectors
• Split Bregman algorithms for sparse group lasso with application to MRI reconstruction
• Sparse randomized Kaczmarz for support recovery of jointly sparse corrupted multiple measurement vectors
• Analysis of convergence for the alternating direction method applied to joint sparse recovery

Describes a project that uses

Uses Software

• SLEP
• Yall1

This page was built for publication: Split Bregman algorithms for multiple measurement vector problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336036)