RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems

DOI10.1109/TSP.2013.2281030zbMath1394.94697arXiv1307.4579OpenAlexW2083080669MaRDI QIDQ4578825

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (22)

A survey on compressive sensing: classical results and recent advancements ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming ⋮ Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms ⋮ Sparse signal reconstruction via the approximations of $\ell_0$ quasinorm ⋮ A smoothing method for sparse optimization over convex sets ⋮ Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained ℓ₁ minimization ⋮ $k$-sparse vector recovery via truncated $\ell_1 -\ell_2$ local minimization ⋮ A null-space-based weightedl₁minimization approach to compressed sensing ⋮ Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets ⋮ Stability of 1-bit compressed sensing in sparse data reconstruction ⋮ Stability analysis of a class of sparse optimization problems ⋮ Optimality analysis on partial $l_1$-minimization recovery ⋮ Uniqueness of the minimal $l_1$-norm solution to the monotone linear complementarity problem ⋮ The sparsest solutions to $Z$-tensor complementarity problems ⋮ Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction ⋮ Nonuniqueness of solutions of a class of $\ell_0$-minimization problems ⋮ Characterization of ℓ1 minimizer in one-bit compressed sensing ⋮ Uniqueness Conditions for A Class of ℓ₀-Minimization Problems ⋮ A New Computational Method for the Sparsest Solutions to Systems of Linear Equations ⋮ Sparse Solutions of a Class of Constrained Optimization Problems ⋮ The sparsest solution to the system of absolute value equations

This page was built for publication: RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems