On sparse solutions of underdetermined linear systems
From MaRDI portal
Recommendations
- Sparse solutions of underdetermined linear systems
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Algorithms on the sparse solution of under-determined linear systems
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Cited in
(20)- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Sparse solutions of underdetermined linear systems
- Sparse Approximate Solutions to Linear Systems
- Special issue on sparse approximate solution of linear systems
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Sparsest representations and approximations of an underdetermined linear system
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- Error analysis of reweighted l₁ greedy algorithm for noisy reconstruction
- Sparse solutions to an underdetermined system of linear equations via penalized Huber loss
- Solution of Sparse Underdetermined Systems of Linear Equations
- Identification of alterations in the Jacobian of biochemical reaction networks from steady state covariance data at two conditions
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- The sparsity of underdetermined linear system via \(l_p\) minimization for \(0 < p < 1\)
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- scientific article; zbMATH DE number 3898147 (Why is no real title available?)
- Exploiting the sparsity in the solution of linear ordinary differential equations
- Sparse decomposition by iterating Lipschitzian-type mappings
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Greedy Gauss-Newton algorithms for finding sparse solutions to nonlinear underdetermined systems of equations
This page was built for publication: On 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 Q3560376)
