Sparsest representations and approximations of an underdetermined linear system

DOI10.1088/1361-6420/AAB246OpenAlexW2734989685MaRDI QIDQ4569345FDOQ4569345

Authors: Patrick J. C. Tardivel, R. Servien, D. Concordet 

Publication date: 28 June 2018

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1361-6420/aab246

Recommendations

• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)

zbMATH Keywords

lassobasis pursuitsparsest approximationsparsest representations

Mathematics Subject Classification ID

Numerical analysis (65-XX) Systems theory; control (93-XX)

Cites Work

• The Adaptive Lasso and Its Oracle Properties
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Statistics for high-dimensional data. Methods, theory and applications.
• On the conditions used to prove oracle results for the Lasso
• High-dimensional generalized linear models and the lasso
• High-dimensional graphs and variable selection with the Lasso
• Title not available (Why is that?)
• Group Bound: Confidence Intervals for Groups of Variables in Sparse High Dimensional Regression Without Assumptions on the Design
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Sparsity oracle inequalities for the Lasso
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Boosting as a regularized path to a maximum margin classifier
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Title not available (Why is that?)
• Stable signal recovery from incomplete and inaccurate measurements
• The Lasso problem and uniqueness
• Compressed sensing and best \(k\)-term approximation
• Title not available (Why is that?)
• A mathematical introduction to compressive sensing
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Portfolio optimization with linear and fixed transaction costs
• Recovery of sparsest signals via \(\ell^q \)-minimization
• Sparse representations in unions of bases
• The restricted isometry property and its implications for compressed sensing
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
• Compressive sensing and structured random matrices
• Compressive sensing by random convolution
• Compressive sensing for subsurface imaging using ground penetrating radar
• High-Resolution Radar via Compressed Sensing
• On compressive sensing applied to radar
• On sparse solutions of underdetermined linear systems
• Highly sparse representations from dictionaries are unique and independent of the sparseness measure
• Compressed sensing recovery via nonconvex shrinkage penalties
• A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
• Simultaneous reconstruction and segmentation for dynamic SPECT imaging
• Sparsity and level set regularization for diffuse optical tomography using a transport model in 2D
• Material reconstruction for spectral computed tomography with detector response function

Cited In (3)

• New and improved conditions for uniqueness of sparsest solutions of underdetermined linear systems
• The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution

Uses Software

• ElemStatLearn

This page was built for publication: Sparsest representations and approximations of an underdetermined linear system

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