Lower bound theory of nonzero entries in solutions of l2-l p minimization

SIAM Journal on Scientific Computing

Volumn 32, Issue 5, 2010, Pages 2832-2852

  Chen, Xiaojun ^a   Xu, Fengmin ^b   Ye, Yinyu ^a,c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b XI'AN JIAOTONG UNIVERSITY   (China)

^c Stanford University   (United States)

Author keywords

First order condition; Linear least squares problem; Second order condition; Smoothing approximation; Sparse solution; Variable selection

Indexed keywords

COMPUTATION THEORY; ERROR ANALYSIS; LEAST SQUARES APPROXIMATIONS; NUMERICAL MODELS; OPTIMAL SYSTEMS; PROBLEM SOLVING;

FIRST-ORDER CONDITIONS; LINEAR LEAST-SQUARE PROBLEMS; LOW BOUND; MINIMISATION; NONZERO ENTRIES; NUMERICAL SOLUTION; SECOND-ORDER CONDITIONS; SMOOTHING APPROXIMATION; SPARSE SOLUTIONS; VARIABLES SELECTIONS;

NUMERICAL METHODS;

EID: 78149326445     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/090761471     Document Type: Article

References (29)

1. C. Blake and C. Merz, Repository of Machine Learning Databases [DB/OL], Department of Information and Computer Science, University of California, Irvine, CA, 1998, http://www.ics.uci.edu/~mlearn/MLRepository.html.
2. L. Breiman, Better subset regression using the nonnegative garrote, Technometrics, 37 (1995), pp. 373-384.
3. A. M. Bruckstein, D. L. Donoho, and M. Elad, From sparse solutions of systems of equations to sparse modeling of signals and images, SIAM Rev., 51 (2009), pp. 34-81.
4. J. V. Burke, A. S. Lewis, and M. L. Overton, A robust gradient sampling algorithm for nonsmooth, nonconvex optimization, SIAM J. Optim., 15 (2005), pp. 751-779.
5. E. J. Candes, M. B. Wakin, and S. P. Boyd, Enhancing sparsity by reweighted l1 minimization, J. Fourier Anal. Appl., 14 (2008), pp. 877-905.
6. E. Candes, J. Romberg, and T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Trans. Inform. Theory, 52 (2006), pp. 489-509.
7. R. Chartrand, Exact reconstructions of sparse signals via nonconvex minimization, IEEE Signal Process. Lett., 14 (2007), pp. 707-710.
8. R. Chartrand, Nonconvex regularization for shape preservation, in 2007 IEEE International Conference on Image Processing, San Antonio, TX, 2007, pp. I293-I296.
9. R. Chartrand and W. Yin, Iteratively reweighted algorithms for compressive sensing, in 2008 IEEE International Conference on Acoustics, Speech, and Signal Processing, Las Vegas, NV, 2008, pp. 3869-3872.
10. S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by basis pursuit, SIAM J. Sci. Comput., 43 (2001), pp. 129-159.
11. X. Chen and Y. Ye, On homotopy-smoothing methods for box-constrained variational inequalities, SIAM J. Control Optim., 37 (1999), pp. 589-616.
12. X. Chen and W. Zhou, Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization, SIAM J. Imaging Sci., 3 (2010), pp. 765-790.
13. F. H. Clarke, Optimization and Nonsmooth Analysis, Classics Appl. Math. 5, SIAM, Philadelphia, 1990.
14. G. Davis, S. Mallat, and M. Avellaneda, Adaptive greedy approximations, Const. Approx., 13 (1997), pp. 57-98.
15. D. L. Donoho, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
16. B. Efron, T. Hastie, I. Johnstone, and R. Tibshirani, Least angle regreeion, Ann. Statist., 23 (2004), pp. 407-499.
17. J. Fan and R. Li, Variable selection via nonconcave penalized likelihood and its oracle properties, J. Amer. Statist. Assoc., 96 (2001), pp. 1348-1360.
18. T. Hastie, R. Tibshirani, and J. Friedman, The elements of statistical learning: Data mining, in Inference and Prediction, Springer-Verlag, New York, 2001.
19. A. E. Hoerl and R. Kennard, Ridge regression: Biased estimation for nonorthogonal problems, Technometrics, 12 (1970), pp. 55-67.
20. K. C. Kiwiel, Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization, SIAM J. Optim., 18 (2007), pp. 379-388.
21. S. Mallat and Z. Zhang, Matching pursuits with time-frequency dictionaries, IEEE Trans. Signal Process., 41 (1993), pp. 3397-3415.
22. M. Nikolova, Analysis of the recovery of edges in images and signals by minimizing nonconvex regularized least-squares, Multiscale Model. Simul., 4 (2005), pp. 960-991.
23. M. Nikolova, M. K. Ng, S. Zhang, and W. Ching, Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization, SIAM J. Imaging Sci., 1 (2008), pp. 2-25.
24. Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, in Proceedings of the 27th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, IEEE, 1993, pp. 40-44.
25. R. Tibshirani, Regression shrinkage and selection via the Lasso, J. R. Stat. Soc. Ser. B Stat. Methodol., 58 (1996), pp. 267-288.
26. J. A. Tropp and A. C. Gilbert, Signal recovery from random measurements via orthogonal matching pursuit, IEEE Trans. Inform. Theory, 53 (2007), pp. 4655-4667.
27. J. A. Tropp, A. C. Gilbert, S. Muthukrishnan, and M. J. Strauss, Improved sparse approximation over quasi-incoherent dictionaries, in 2003 International Conference on Image Processing, Barcelona, Spain, 2003, pp. 37-40.
28. Z. Xu, H. Zhang, Y. Wang, and X. Chang, L1/2 regularizer, Sci. China Ser. F, 52 (2009), pp. 1-9.
29. C. Zhang and X. Chen, Smoothing projected gradient method and its application to stochastic linear complementarity problems, SIAM J. Optim., 20 (2009), pp. 627-649.