Truncated sparse approximation property and truncated \(q\)-norm minimization

DOI10.1007/s11766-019-3596-2zbMath1438.65134arXiv1806.10788OpenAlexW2972265194WikidataQ127304067 ScholiaQ127304067MaRDI QIDQ2322801

Peng Li, Chen, Wengu

Publication date: 5 September 2019

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

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

zbMATH Keywords

Dantzig selectorlow-rank matrix recoveryrestricted isometry propertysparse signal recoverytruncated norm minimizationtruncated sparse approximation property

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Biomedical imaging and signal processing (92C55)

Related Items

Robust sparse recovery via a novel convex model, On the grouping effect of the \(l_{1-2}\) models

Uses Software

• UNLocBoX

Cites Work

• A mathematical introduction to compressive sensing
• Nonlinear frames and sparse reconstructions in Banach spaces
• Theory of semidefinite programming for sensor network localization
• A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
• Convex multi-task feature learning
• Modern multidimensional scaling: theory and applications
• The geometry of graphs and some of its algorithmic applications
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• ROP: matrix recovery via rank-one projections
• Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION
• Proximal Splitting Methods in Signal Processing
• Compressive Multiplexing of Correlated Signals
• Compressed sensing and best 𝑘-term approximation
• Restricted isometry properties and nonconvex compressive sensing
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
• High-Resolution Radar via Compressed Sensing
• Sparse Approximation Property and Stable Recovery of Sparse Signals From Noisy Measurements
• Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
• Stable low-rank matrix recovery via null space properties
• Rank Awareness in Joint Sparse Recovery
• Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Empirical Bayes Estimation of a Sparse Vector of Gene Expression Changes
• Sparse Signal Reconstruction via Iterative Support Detection