Conditions for a unique non-negative solution to an underdetermined system

This paper investigates conditions for an underdeter-mined linear system to have a unique nonnegative solution. A necessary condition is derived which requires the measurement matrix to have a row-span intersecting the positive orthant. For systems that satisfy this necessary condition, we provide equivalent characterizations for having a unique nonnegative solution. These conditions generalize existing ones to the cases where the measurement matrix may have different column sums. Focusing on binary measurement matrices especially ones that are adjacency matrices of expander graphs, we obtain an explicit threshold. Any nonnegative solution that is sparser than the threshold is the unique nonnegative solution. Compared with previous ones, this result is not only more general as it does not require constant degree condition, but also stronger as the threshold is larger even for cases with constant degree.

[1]  E.J. Candes.  Compressive Sampling , 2022 .

[2]  D. Donoho,et al.  Sparse nonnegative solution of underdetermined linear equations by linear programming. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Daniel A. Spielman,et al.  Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.

[4]  Carsten Lund,et al.  An information-theoretic approach to traffic matrix estimation , 2003, SIGCOMM '03.

[5]  Richard G. Baraniuk,et al.  Compressive Sensing , 2008, Computer Vision, A Reference Guide.

[6]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[7]  David L. Donoho,et al.  Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications , 2008, Discret. Comput. Geom..

[8]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[9]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[10]  Nick G. Duffield,et al.  Network Tomography of Binary Network Performance Characteristics , 2006, IEEE Transactions on Information Theory.

[11]  Michael Elad,et al.  On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations , 2008, IEEE Transactions on Information Theory.

[12]  Alexandros G. Dimakis,et al.  Sparse Recovery of Nonnegative Signals With Minimal Expansion , 2011, IEEE Transactions on Signal Processing.

[13]  D. Gale.  15. Neighboring Vertices on a Convex Polyhedron , 1957 .

[14]  Stephen P. Boyd,et al.  Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.

[15]  Patrick Thiran,et al.  Using End-to-End Data to Infer Lossy Links in Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  Patrick Thiran,et al.  Network loss inference with second order statistics of end-to-end flows , 2007, IMC '07.

[17]  J. G. Wendel.  A Problem in Geometric Probability. , 1962 .

[18]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[19]  Piotr Indyk,et al.  Sparse Recovery Using Sparse Random Matrices , 2010, LATIN.

[20]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[21]  Weiyu Xu,et al.  Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.

[22]  Robert Nowak,et al.  Internet tomography , 2002, IEEE Signal Process. Mag..

[23]  Alexandros G. Dimakis,et al.  Sparse Recovery of Positive Signals with Minimal Expansion , 2009, ArXiv.