Breaking through the thresholds: an analysis for iterative reweighted ℓ1 minimization via the Grassmann angle framework

It is now well understood that the ℓ<inf>1</inf> minimization algorithm is able to recover sparse signals from incomplete measurements [2], [1], [3] and sharp recoverable sparsity thresholds have also been obtained for the ℓ<inf>1</inf> minimization algorithm. However, even though iterative reweighted ℓ<inf>1</inf> minimization algorithms or related algorithms have been empirically observed to boost the recoverable sparsity thresholds for certain types of signals, no rigorous theoretical results have been established to prove this fact. In this paper, we try to provide a theoretical foundation for analyzing the iterative reweighted ℓ<inf>1</inf> algorithms. In particular, we show that for a nontrivial class of signals, the iterative reweighted ℓ<inf>1</inf> minimization can indeed deliver recoverable sparsity thresholds larger than that given in [1], [3]. Our results are based on a high-dimensional geometrical analysis (Grassmann angle analysis) of the null-space characterization for ℓ<inf>1</inf> minimization and weighted ℓ<inf>1</inf> minimization algorithms.

[1]  L. Santaló.  Geometría integral en espacios de curvatura constante , 1952 .

[2]  B. Grünbaum.  Grassmann angles of convex polytopes , 1968 .

[3]  P Mcmullen,et al.  Non-linear angle-sum relations for polyhedral cones and polytopes , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  Rolf Schneider,et al.  Random projections of regular simplices , 1992, Discret. Comput. Geom..

[5]  J. K. Böröczky,et al.  Random projections of regular polytopes , 1999 .

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

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

[8]  David L. Donoho,et al.  High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension , 2006, Discret. Comput. Geom..

[9]  D. Donoho,et al.  Thresholds for the Recovery of Sparse Solutions via L1 Minimization , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

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

[11]  B. Hassibi,et al.  Compressed sensing over the Grassmann manifold: A unified analytical framework , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[12]  Weiyu Xu,et al.  On sharp performance bounds for robust sparse signal recoveries , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  Weiyu Xu,et al.  Weighted ℓ1 minimization for sparse recovery with prior information , 2009, 2009 IEEE International Symposium on Information Theory.