Sparse solutions of underdetermined linear systems
From MaRDI portal
Recommendations
- On sparse solutions of underdetermined linear systems
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Algorithms on the sparse solution of under-determined linear systems
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
Cited in
(24)- Exploiting the sparsity in the solution of linear ordinary differential equations
- Finding sparse systems of parameters
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- Error analysis of reweighted l₁ greedy algorithm for noisy reconstruction
- Special issue on sparse approximate solution of linear systems
- Fast implementation of ^1-greedy algorithm
- Solving sparse rational linear systems
- Solution of Sparse Underdetermined Systems of Linear Equations
- On sparse solutions of underdetermined linear systems
- scientific article; zbMATH DE number 3898147 (Why is no real title available?)
- scientific article; zbMATH DE number 1153374 (Why is no real title available?)
- scientific article; zbMATH DE number 2065130 (Why is no real title available?)
- scientific article; zbMATH DE number 2067340 (Why is no real title available?)
- Sparse analysis
- Sparse Approximate Solutions to Linear Systems
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Sparse Linear Complementarity Problems
- Greedy Gauss-Newton algorithms for finding sparse solutions to nonlinear underdetermined systems of equations
- Sparsity-assisted signal smoothing
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Algorithms on the sparse solution of under-determined linear systems
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Solving underdetermined systems with error-correcting codes
This page was built for publication: Sparse solutions of underdetermined linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3163856)