# Sparse nonnegative solution of underdetermined linear equations by linear programming.

```@article{Donoho2005SparseNS,
title={Sparse nonnegative solution of underdetermined linear equations by linear programming.},
author={David L. Donoho and Jared Tanner},
journal={Proceedings of the National Academy of Sciences of the United States of America},
year={2005},
volume={102 27},
pages={
9446-51
}
}```
• Published 2005
• Mathematics
• Proceedings of the National Academy of Sciences of the United States of America
Consider an underdetermined system of linear equations y = Ax with known y and d x n matrix A. We seek the nonnegative x with the fewest nonzeros satisfying y = Ax. In general, this problem is NP-hard. However, for many matrices A there is a threshold phenomenon: if the sparsest solution is sufficiently sparse, it can be found by linear programming. We explain this by the theory of convex polytopes. Let a(j) denote the jth column of A, 1 < or = j < or = n, let a0 = 0 and P denote the convex…
585 Citations

## Figures and Tables from this paper

A Non-Negative and Sparse Enough Solution of an Underdetermined Linear System of Equations is Unique
• Computer Science
• 2007
It is shown that if there exists a sufficiently sparse solution to this problem, it is necessarily unique, and a greedy algorithm is presented that is guaranteed to find this sparse solution.
Sparse Solutions of Underdetermined Linear Systems
• Computer Science, Mathematics
• 2021
About the restricted isometry property (RIP) of matrices, an elementary proof to a known result that the probability that the random matrix with iid Gaussian variables possesses the PIP is strictly positive is provided.
Sparse non-negative solution of a linear system of equations is unique
• Computer Science
2008 3rd International Symposium on Communications, Control and Signal Processing
• 2008
It is shown that if there exists a sufficiently sparse solution to this problem, it is necessarily unique, and a greedy algorithm is presented that is guaranteed to find this sparse solution.
On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
• Mathematics
IEEE Transactions on Information Theory
• 2008
It is shown that for matrices A with a row-span intersecting the positive orthant, if this problem admits a sufficiently sparse solution, it is necessarily unique, and the bound on the required sparsity depends on a coherence property of the matrix A.
A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
• Mathematics
IEEE Transactions on Signal Processing
• 2011
It is shown that, in two types of binary measurement matrices, Bernoulli 0-1 matrices and adjacency matrices of general expander graphs, the support size of a unique nonnegative solution can grow linearly, namely O(n), with the problem dimension n .
Recovering Sparse Nonnegative Signals via Non-convex Fraction Function Penalty
• Computer Science
• 2017
The l0-norm is replaced with a non-convex fraction function, and it is proved that the optimal solution of the problem (P 0) could be approximately obtained by solving the regularization problem (FP a,λ) if some specific conditions satisfied.
A Direct Formulation for Sparse PCA Using Semidefinite Programming
• Computer Science
SIAM Rev.
• 2007
A modification of the classical variational representation of the largest eigenvalue of a symmetric matrix is used, where cardinality is constrained, and a semidefinite programming-based relaxation is derived for the sparse PCA problem.
Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing
It is shown that enumerating the support vectors of k-sparse solutions to a system Ax=b of r-s parse linear equations is fixed-parameter tractable in the combined parameter r,k, where d is the total number of minimal solutions.
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Computer Science, Mathematics
SIAM Rev.
• 2010
It is shown that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space.

## References

SHOWING 1-10 OF 38 REFERENCES
Neighborly Polytopes And Sparse Solution Of Underdetermined Linear Equations
For large d, the overwhelming majority of systems of linear equations with d equations and 4d/3 unknowns have the following property: if there is a solution with fewer than .49d nonzeros, it is the unique minimum ` solution.
On sparse representations in arbitrary redundant bases
• J. Fuchs
• Mathematics
IEEE Transactions on Information Theory
• 2004
The purpose of this contribution is to generalize some recent results on sparse representations of signals in redundant bases and give a sufficient condition for the unique sparsest solution to be the unique solution to both a linear program or a parametrized quadratic program.
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
• D. Donoho
• Mathematics
Discret. Comput. Geom.
• 2006
The face numbers of randomly projected cross polytopes in the proportional-dimensional case where d ∼ δn, where the projector A is chosen uniformly at random from the Grassmann manifold of d-dimensional orthoprojectors of Rn, are studied.
Neighborliness of randomly projected simplices in high dimensions.
• Mathematics
Proceedings of the National Academy of Sciences of the United States of America
• 2005
There is a "phase transition" in the ability of linear programming to find the sparsest nonnegative solution to systems of underdetermined linear equations.
Greed is good: algorithmic results for sparse approximation
• J. Tropp
• Computer Science
IEEE Transactions on Information Theory
• 2004
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant dictionaries and develops a sufficient condition under which OMP can identify atoms from an optimal approximation of a nonsparse signal.
Neighborly and cyclic polytopes
Introduction. Let S be a finite set of points in n-space. A pair of points p and q of S are called neighbors if the segment joining them is an edge of the convex polytope spanned by S. Some years ago
Sparse representations in unions of bases
• Computer Science
IEEE Trans. Inf. Theory
• 2003
It is proved that the result of Donoho and Huo, concerning the replacement of the /spl lscr//sup 0/ optimization problem with a linear programming problem when searching for sparse representations has an analog for dictionaries that may be highly redundant.
Regular simplices and Gaussian samples
• Mathematics
Discret. Comput. Geom.
• 1994
It is shown that if a suitable type of simplex inRn is randomly rotated and its vertices projected onto a fixed subspace, they are as a point set affine-equivalent to a Gaussian sample in that subspace and the conditions on the vertices of the simplex are necessary for this equivalence.
A generalized uncertainty principle and sparse representation in pairs of bases
• Mathematics, Computer Science
IEEE Trans. Inf. Theory
• 2002
The main contribution in this paper is the improvement of an important result due to Donoho and Huo (2001) concerning the replacement of the l/sub 0/ optimization problem by a linear programming minimization when searching for the unique sparse representation.