A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
From MaRDI portal
(Redirected from Publication:4572835)
Abstract: This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A vector solution is the unique solution to an underdetermined linear system only if the measurement matrix has a row-span intersecting the positive orthant. Focusing on two types of binary measurement matrices, Bernoulli 0-1 matrices and adjacency matrices of general expander graphs, we show that, in both cases, the support size of a unique nonnegative solution can grow linearly, namely O(n), with the problem dimension n. We also provide closed-form characterizations of the ratio of this support size to the signal dimension. For the matrix case, we show that under a necessary and sufficient condition for the linear compressed observations operator, there will be a unique positive semidefinite matrix solution to the compressed linear observations. We further show that a randomly generated Gaussian linear compressed observations operator will satisfy this condition with overwhelmingly high probability.
Recommendations
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- On Nonnegative Solutions of Matrix Equations
- On a nonnegative solution of a system of equations with a nonstrictly Jacobian matrix
- Towards positive definite solutions of a class of nonlinear matrix equations
- Nonnegative-definite and positive-definite solutions to the matrix equation \(\mathbb{A}\times\mathbb{A}^*=\mathbb{B}\) -- revisited
- A note on the unique solvability condition for generalized absolute value matrix equation
- On the unique solvability of the matrix equation \(AX + X^{T}B = C\) in the singular case
- On the positive definite solutions of a nonlinear matrix equation
- Investigation of the existence and uniqueness of extremal and positive definite solutions of nonlinear matrix equations
- The positive definite solution to a nonlinear matrix equation
Cited in
(18)- Linear program relaxation of sparse nonnegative recovery in compressive sensing microarrays
- Development of \(hp\)-inverse model by using generalized polynomial chaos
- Dictionary learning based on nonnegative matrix factorization using parallel coordinate descent
- On non-negative solutions to large systems of random linear equations
- The nonnegative zero-norm minimization under generalized \(Z\)-matrix measurement
- Irreducible infeasible subsystems of semidefinite systems
- Average case recovery analysis of tomographic compressive sensing
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Reconstruction methods in THz single-pixel imaging
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- Sparse solutions of sparse linear systems: fixed-parameter tractability and an application of complex group testing
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained _1 minimization
- Linear positive systems may have a reachable subset from the origin that is either polyhedral or nonpolyhedral
- Hyperbolic wavelet frames and multiresolution in the weighted Bergman spaces
- Multi-class heterogeneous domain adaptation
- Robust sparse recovery with sparse Bernoulli matrices via expanders
This page was built for publication: A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572835)
