A Novel Monotonic Fixed-Point Algorithm for l1-Regularized Least Square Vector and Matrix Problem
Least square problem with l 1 regularization has been proposed as a promising method for sparse signal reconstruction (e.g., basis pursuit de-noising and compressed sensing) and feature selection (e.g., the Lasso algorithm) in signal processing, statistics, and related fields. These problems can be cast as l 1-regularized least-square program (LSP). In this paper, we propose a novel monotonic fixed point method to solve large-scale l 1-regularized LSP. And we also prove the stability and convergence of the proposed method. Furthermore we generalize this method to least square matrix problem and apply it in nonnegative matrix factorization (NMF). The method is illustrated on sparse signal reconstruction, partner recognition and blind source separation problems, and the method tends to convergent faster and sparser than other l 1-regularized algorithms.
Keywordsl1-regularized LSP fixed point method signal reconstruction NMF
Unable to display preview. Download preview PDF.
- 7.Hale, E., Yin, W., Zhang, Y.: A fixed-point continuation method for l 1-regularized minimization with applications to compressed sensing. Tech. rep., CAAM TR07-07 (2007) Google Scholar
- 10.Figueiredo, M., Nowak, R., Wright, S.: Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems. Appeared in the same issue of IEEE Journal on Selected Topics in Signal Processing (2007)Google Scholar