On the _1-norm invariant convex k-sparse decomposition of signals

DOI10.1007/S40305-013-0030-YzbMATH Open1310.94030arXiv1305.6021OpenAlexW2071392157MaRDI QIDQ743785FDOQ743785

Authors: Guangwu Xu, Zhiqiang Xu 

Publication date: 30 September 2014

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Abstract: Inspired by an interesting idea of Cai and Zhang, we formulate and prove the convex $k$-sparse decomposition of vectors which is invariant with respect to $el{l}_1$ norm. This result fits well in discussing compressed sensing problems under RIP, but we believe it also has independent interest. As an application, a simple derivation of the RIP recovery condition $delt{a}_k+het{a}_{k,k}<1$ is presented.

Full work available at URL: https://arxiv.org/abs/1305.6021

Recommendations

• scientific article; zbMATH DE number 7370569
• On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
• Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
• The non-convex sparse problem with nonnegative constraint for signal reconstruction
• An improved condition of sparse signal reconstruction via \({l_1}\)-\({l_2}\) norm minimization
• Convergence of \(\ell_{2/3}\) regularization for sparse signal recovery
• scientific article; zbMATH DE number 7750674
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• Sparse Signal Estimation by Maximally Sparse Convex Optimization
• Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee

zbMATH Keywords

sparse recoveryrestricted isometry property\(\ell_1\) minimizationconvex \(k\)-sparse decomposition

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonlinear programming (90C30)

Cites Work

• Decoding by Linear Programming
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• New Bounds for Restricted Isometry Constants
• Stable Recovery of Sparse Signals and an Oracle Inequality
• Compressed Sensing and Affine Rank Minimization Under Restricted Isometry

Cited In (15)

• The \( \ell _1 \)-analysis in phase retrieval with redundant dictionary
• \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery
• Weighted \(\ell_p\)-minimization for sparse signal recovery under arbitrary support prior
• Uniform RIP analysis for the \(\ell_p- \omega \ell_q\) minimization
• Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
• Stable signal recovery from phaseless measurements
• A null-space-based weightedl₁minimization approach to compressed sensing
• Performance analysis for unconstrained analysis based approaches
• Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
• BranchHull: convex bilinear inversion from the entrywise product of signals with known signs
• The recovery of complex sparse signals from few phaseless measurements
• New restricted isometry property analysis for \(\ell_1-\ell_2\) minimization methods
• Stable image reconstruction using transformed total variation minimization
• Affine phase retrieval for sparse signals via \(\ell_1\) minimization

This page was built for publication: On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals

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