Algorithms on the sparse solution of under-determined linear systems
From MaRDI portal
Recommendations
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Solution of Sparse Underdetermined Systems of Linear Equations
- Sparse solutions of underdetermined linear systems
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
Cited in
(20)- An algorithm for minimum L-infinity solution of under-determined linear systems
- Efficient LED-SAC sparse estimator using fast sequential adaptive coordinate-wise optimization (LED-2SAC)
- An algorithm for solving sparse nonlinear least squares problems
- Rapid compressed sensing reconstruction: a semi-tensor product approach
- Outlier deletion based improvement on the stomp algorithm for sparse solution of large-scale underdetermined problems
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Sparse solutions of underdetermined linear systems
- Solution of Sparse Underdetermined Systems of Linear Equations
- On sparse solutions of underdetermined linear systems
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Sparse decomposition by iterating Lipschitzian-type mappings
- A fast sparse signal recovery algorithm based on approximate l₀ norm and hybrid optimization
- A new computational method for the sparsest solutions to systems of linear equations
- Greedy Gauss-Newton algorithms for finding sparse solutions to nonlinear underdetermined systems of equations
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- The Lawson‐Hanson algorithm with deviation maximization: Finite convergence and sparse recovery
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
This page was built for publication: Algorithms on the sparse solution of under-determined linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5399977)
