Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines

DOI10.1137/18M1185375zbMath1409.65036OpenAlexW2914793064WikidataQ128413196 ScholiaQ128413196MaRDI QIDQ3119537

Mustafa Çelebi Pinar

Publication date: 12 March 2019

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/18m1185375

zbMATH Keywords

linear programming\(\ell_1\)-normquadratic perturbationbasis pursuitHuber loss functionstrictly convex quadratic programmingconvex quadratic splinesexact recovery of a sparse vector

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Spline approximation (41A15)

Related Items (1)

Sparse solutions to an underdetermined system of linear equations via penalized Huber loss

Uses Software

• PDCO

Cites Work

• Unnamed Item
• A mathematical introduction to compressive sensing
• On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery
• Testing the nullspace property using semidefinite programming
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• New characterizations of \(\ell_ 1\) solutions to overdetermined systems of linear equations
• Duality in robust linear regression using Huber's \(M\)-estimator
• On the characterization of quadratic splines
• Necessary and sufficient conditions of solution uniqueness in 1-norm minimization
• Making Do with Less: An Introduction to Compressed Sensing
• On Sparse Representations in Arbitrary Redundant Bases
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
• Nonlinear Perturbation of Linear Programs
• Atomic Decomposition by Basis Pursuit
• The Linear l₁ Estimator and the Huber M-Estimator
• Sparse Regularization via Convex Analysis
• A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Complementarity Theorems for Linear Programming
• Compressed sensing
• Robust Statistics

This page was built for publication: Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines