Solving Sparse Linear Inverse Problems: Analysis of Reweighted l1 and l2 Methods
暂无分享,去创建一个
[1] Restricted Isometry Constants where p sparse , 2011 .
[2] David P. Wipf,et al. A New View of Automatic Relevance Determination , 2007, NIPS.
[3] George Eastman House,et al. Sparse Bayesian Learning and the Relevance Vector Machine , 2001 .
[4] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[5] Bhaskar D. Rao,et al. Latent Variable Bayesian Models for Promoting Sparsity , 2011, IEEE Transactions on Information Theory.
[6] A. Bruckstein,et al. A Non-Negative and Sparse Enough Solution of an Underdetermined Linear System of Equations is Unique , 2007 .
[7] Bhaskar D. Rao,et al. Subset selection in noise based on diversity measure minimization , 2003, IEEE Trans. Signal Process..
[8] Bhaskar D. Rao,et al. Variational EM Algorithms for Non-Gaussian Latent Variable Models , 2005, NIPS.
[9] Stephen P. Boyd,et al. Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices , 2003, Proceedings of the 2003 American Control Conference, 2003..
[10] I. Daubechies,et al. Iteratively reweighted least squares minimization for sparse recovery , 2008, 0807.0575.
[11] Rémi Gribonval,et al. Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.
[12] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[13] Michael Elad,et al. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[14] Wotao Yin,et al. Iteratively reweighted algorithms for compressive sensing , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.
[15] David P. Wipf,et al. Iterative Reweighted 1 and 2 Methods for Finding Sparse Solutions , 2010, IEEE J. Sel. Top. Signal Process..
[16] Stephen P. Boyd,et al. Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.
[17] Geoffrey E. Hinton,et al. Bayesian Learning for Neural Networks , 1995 .
[18] Dmitry M. Malioutov,et al. Optimal sparse representations in general overcomplete bases , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.
[19] Jean-Jacques Fuchs,et al. On sparse representations in arbitrary redundant bases , 2004, IEEE Transactions on Information Theory.
[20] D. Donoho. For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .
[21] Bhaskar D. Rao,et al. An affine scaling methodology for best basis selection , 1999, IEEE Trans. Signal Process..
[22] Rémi Gribonval,et al. Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$ , 2009, IEEE Transactions on Information Theory.
[23] Mário A. T. Figueiredo. Adaptive Sparseness Using Jeffreys Prior , 2001, NIPS.
[24] E. M. L. Beale,et al. Nonlinear Programming: A Unified Approach. , 1970 .