On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
From MaRDI portal
Publication:3604873
DOI10.1109/TIT.2008.929920zbMATH Open1319.15007OpenAlexW2135161976MaRDI QIDQ3604873FDOQ3604873
Authors: Alfred M. Bruckstein, Michael Elad, Michael Zibulevsky 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.929920
Recommendations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- New and improved conditions for uniqueness of sparsest solutions of underdetermined linear systems
- On sparse solutions of underdetermined linear systems
- Sparse nonnegative solution of underdetermined linear equations by linear programming
Linear equations (linear algebraic aspects) (15A06) Positive matrices and their generalizations; cones of matrices (15B48)
Cited In (30)
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Development of \(hp\)-inverse model by using generalized polynomial chaos
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem
- Sign-constrained least squares estimation for high-dimensional regression
- Matrix-wise \(\ell_0\)-constrained sparse nonnegative least squares
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Alternating direction method for a class of Sylvester matrix equations with linear matrix inequality constraint
- New and improved conditions for uniqueness of sparsest solutions of underdetermined linear systems
- Stable low-rank matrix recovery via null space properties
- Fast nonnegative least squares through flexible Krylov subspaces
- Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks.
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- The non-convex sparse problem with nonnegative constraint for signal reconstruction
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Simultaneous sensing error recovery and tomographic inversion using an optimization-based approach
- Sparse recovery with integrality constraints
- Non-negative sparse recovery via momentum-boosted adaptive thresholding algorithm
- Projected shrinkage algorithm for box-constrained \(\ell _1\)-minimization
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- A survey on compressive sensing: classical results and recent advancements
- Iterative positive thresholding algorithm for non-negative sparse optimization
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions
- Multi-class heterogeneous domain adaptation
- Counting the faces of randomly-projected hypercubes and orthants, with applications
- Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration
- Algorithm for inequality-constrained least squares problems
- An alternating direction method for nonnegative solutions of the matrix equation \(AX+YB=C\)
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
This page was built for publication: On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604873)
