Unconstrained _1-_2 minimization for sparse recovery via mutual coherence

DOI10.3934/MFC.2020006zbMATH Open1490.94036OpenAlexW3031042291MaRDI QIDQ2124198FDOQ2124198

Authors: Pengbo Geng, Wengu Chen 

Publication date: 19 April 2022

Published in: Mathematical Foundations of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/mfc.2020006

Recommendations

• Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
• On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
• Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction
• \(\alpha\ell_1-\beta\ell_2\) regularization for sparse recovery
• Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
• Sparse Recovery Conditions and Performance Bounds for $\ell _p$-Minimization
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• Convergence of \(\ell_{2/3}\) regularization for sparse signal recovery
• Selective <inline-formula> <tex-math notation="TeX">$\ell_{1}$</tex-math></inline-formula> Minimization for Sparse Recovery
• On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$

zbMATH Keywords

compressed sensingmutual coherencesparse signal recovery\(\ell_1\)-\(\ell_2\) minimizationnon-convex metric

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Simultaneous analysis of Lasso and Dantzig selector
• Atomic Decomposition by Basis Pursuit
• Stable recovery of sparse overcomplete representations in the presence of noise
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Iterative hard thresholding for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Uncertainty principles and ideal atomic decomposition
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Computational Aspects of Constrained L 1-L 2 Minimization for Compressive Sensing
• Stable Recovery of Sparse Signals and an Oracle Inequality
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• A method for finding structured sparse solutions to nonnegative least squares problems with applications
• A remark on the Lasso and the Dantzig selector
• Stable recovery of analysis based approaches
• Analysis Recovery With Coherent Frames and Correlated Measurements
• Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
• A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
• Fast L1-L2 minimization via a proximal operator
• Recovery of Sparse Signals Using Multiple Orthogonal Least Squares
• Support Recovery With Orthogonal Matching Pursuit in the Presence of Noise
• Nearly Optimal Bounds for Orthogonal Least Squares

Cited In (3)

• Compressed data separation via unconstrained l1-split analysis
• The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization
• \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization

Uses Software

• PDCO
• CoSaMP

This page was built for publication: Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence

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