Analysis of convergence for the alternating direction method applied to joint sparse recovery

DOI10.1016/J.AMC.2015.07.104MaRDI QIDQ668704zbMATH OpenOpenAlexFDO

Authors Xiaobo Yang, Jiaxin Xie, Yuan Lei, Anping Liao

Publication date 19 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2015.07.104

zbMATH Keywords

sparse recoveryalternating direction methodcompressed sensingjoint sparsitymultiple measurement vectorsrow sparse matrices

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52) Inverse problems in linear algebra (15A29) Numerical solution to inverse problems in abstract spaces (65J22)

Recommendations

• A fast algorithm for recovery of jointly sparse vectors based on the alternating direction methods
• Split Bregman algorithms for multiple measurement vector problem
• Stochastic greedy algorithms for multiple measurement vectors
• scientific article; zbMATH DE number 6142618
• On the convergence properties of alternating direction method of multipliers

Cites work

• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A fast algorithm for recovery of jointly sparse vectors based on the alternating direction methods
• A sparse signal reconstruction perspective for source localization with sensor arrays
• Adaptive Compressed Sensing Radar Oriented Toward Cognitive Detection in Dynamic Sparse Target Scene
• Algorithms for simultaneous sparse approximation. II: Convex relaxation
• An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
• Atomic decomposition by basis pursuit
• Decoding by Linear Programming
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Greedy Algorithms for Joint Sparse Recovery
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• High-Resolution Radar via Compressed Sensing
• Sparse Bayesian Learning for Basis Selection
• Sparse solutions to linear inverse problems with multiple measurement vectors
• Stable recovery of sparse overcomplete representations in the presence of noise
• The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding versus Dynamic Range
• The null space property for sparse recovery from multiple measurement vectors
• The restricted isometry property and its implications for compressed sensing
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Uncertainty principles and ideal atomic decomposition

Cited in

(8)

• A remark on joint sparse recovery with OMP algorithm under restricted isometry property
• Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
• A fast algorithm for recovery of jointly sparse vectors based on the alternating direction methods
• General parameterized proximal point algorithm with applications in statistical learning
• Stochastic greedy algorithms for multiple measurement vectors
• Convergence analysis on the alternating direction method of multipliers for the cosparse optimization problem
• Some results on OMP algorithm for MMV problem
• On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals

Describes a project that uses

Uses Software

• PDCO

This page was built for publication: Analysis of convergence for the alternating direction method applied to joint sparse recovery

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