Sparsest representations and approximations of an underdetermined linear system
From MaRDI portal
Publication:4569345
Recommendations
- For most large underdetermined systems of linear equations the minimal 𝓁1‐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 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 2107186 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A mathematical introduction to compressive sensing
- A necessary and sufficient condition for exact sparse recovery by \(\ell_1\) minimization
- Boosting as a regularized path to a maximum margin classifier
- Compressed sensing and best \(k\)-term approximation
- Compressed sensing recovery via nonconvex shrinkage penalties
- Compressive sensing and structured random matrices
- Compressive sensing by random convolution
- Compressive sensing for subsurface imaging using ground penetrating radar
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Group Bound: Confidence Intervals for Groups of Variables in Sparse High Dimensional Regression Without Assumptions on the Design
- High-Resolution Radar via Compressed Sensing
- High-dimensional generalized linear models and the lasso
- High-dimensional graphs and variable selection with the Lasso
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Material reconstruction for spectral computed tomography with detector response function
- On compressive sensing applied to radar
- On sparse solutions of underdetermined linear systems
- On the conditions used to prove oracle results for the Lasso
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Portfolio optimization with linear and fixed transaction costs
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Simultaneous reconstruction and segmentation for dynamic SPECT imaging
- Sparse representations in unions of bases
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Sparsity and level set regularization for diffuse optical tomography using a transport model in 2D
- Sparsity oracle inequalities for the Lasso
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- Statistics for high-dimensional data. Methods, theory and applications.
- The Adaptive Lasso and Its Oracle Properties
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- The Lasso problem and uniqueness
- The restricted isometry property and its implications for compressed sensing
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Cited in
(3)- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- 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\)
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)
