Heuristics for Finding Sparse Solutions of Linear Inequalities
From MaRDI portal
Recommendations
Cites work
- A bilinear formulation for vector sparsity optimization
- An affine scaling methodology for best basis selection
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- Atomic Decomposition by Basis Pursuit
- Compressed sensing and best \(k\)-term approximation
- Concave programming for minimizing the zero-norm over polyhedral sets
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- DC approximation approach for \(\ell_0\)-minimization in compressed sensing
- DC approximation approaches for sparse optimization
- DC programming and DCA: thirty years of developments
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fast heuristics for the maximum feasible subsystem problem
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Generalized Orthogonal Matching Pursuit
- Greed is Good: Algorithmic Results for Sparse Approximation
- Integer Programming
- Matching pursuits with time-frequency dictionaries
- Multipath Matching Pursuit
- On the Recovery Limit of Sparse Signals Using Orthogonal Matching Pursuit
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Signal Recovery from Random Measurements via Extended Orthogonal Matching Pursuit
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Theory of compressive sensing via _1-minimization: a non-RIP analysis and extensions
- Uncertainty principles and ideal atomic decomposition
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Heuristics for Finding Sparse Solutions of Linear Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053490)
