期刊文献+

A new piecewise quadratic approximation approach for L_0 norm minimization problem

A new piecewise quadratic approximation approach for L_0 norm minimization problem
原文传递
导出
摘要 In this paper, we consider the problem of finding sparse solutions for underdetermined systems of linear equations, which can be formulated as a class of L_0 norm minimization problem. By using the least absolute residual approximation, we propose a new piecewis, quadratic function to approximate the L_0 norm.Then, we develop a piecewise quadratic approximation(PQA) model where the objective function is given by the summation of a smooth non-convex component and a non-smooth convex component. To solve the(PQA) model,we present an algorithm based on the idea of the iterative thresholding algorithm and derive the convergence and the convergence rate. Finally, we carry out a series of numerical experiments to demonstrate the performance of the proposed algorithm for(PQA). We also conduct a phase diagram analysis to further show the superiority of(PQA) over L_1 and L_(1/2) regularizations. In this paper, we consider the problem of finding sparse solutions for underdetermined systems of linear equations, which can be formulated as a class of L_0 norm minimization problem. By using the least absolute residual approximation, we propose a new piecewis, quadratic function to approximate the L_0 norm.Then, we develop a piecewise quadratic approximation(PQA) model where the objective function is given by the summation of a smooth non-convex component and a non-smooth convex component. To solve the(PQA) model,we present an algorithm based on the idea of the iterative thresholding algorithm and derive the convergence and the convergence rate. Finally, we carry out a series of numerical experiments to demonstrate the performance of the proposed algorithm for(PQA). We also conduct a phase diagram analysis to further show the superiority of(PQA) over L_1 and L_(1/2) regularizations.
出处 《Science China Mathematics》 SCIE CSCD 2019年第1期185-204,共20页 中国科学:数学(英文版)
基金 supported by National Natural Science Foundation of China (Grant No. 11771275)
关键词 SPARSE optimization non-convex approximation ITERATIVE THRESHOLDING algorithm sparse optimization non-convex approximation iterative thresholding algorithm
  • 相关文献

参考文献1

二级参考文献15

  • 1Natarajan B K. Sparse approximate solutions to linear sys- tems. SIAM Journal oll Computing, 1995, 24(2): 227-234.
  • 2Chen S, Donoho D L, Saunders M A. Atomic decomposi- tion by basis pursuit. SIAM Journal on Scientit]c Comput- ing, 1998, 20(1): 33-61.
  • 3Candes E, Wakin M, Boyd S. Enhancing sparsity by reweighted L1 minimization. Journal of Fourier Analysis and Applications, 2008, 14(5): 877--905.
  • 4Chartrand R. Exact reconstructions of sparse signals via nonconvex minimization. IEEE Signal Processing Letters, 2007, 14(I0): 707--710.
  • 5Chartrand R, Staneva V. Restricted isometry properties and nonconvex compressive sensing. Inverse Problems, 2008, 24(3): 1-14.
  • 6Donoho D L. Neighborly polytopes and the sparse solu- tion of underdetermined linear equations [Online], available: http: //www-stat.stanford.edu/ donoho/ Reports/ 2005/ NPaSSULE-01-28-05.pdf, November 8, 2011.
  • 7Donoho D L. High-dimensional centrally symmetric poly- topes with neighborliness proportional to dimension. Dis- crete and Computational Geometry, 2006, 35(4): 617-652.
  • 8Donoho D L, Stodden V. Breakdown point of model selection when the number of variables exceeds the number of observa- tions. In: Proceedings of the International Joint Conference on Neural Networks. Vancouver, USA: IEEE, 2006. 1916- 1921.
  • 9Xu Z B, Zhang H, Wang Y, Chang X Y, Yong L. L1/2 reg- ularization. Science in China Series F: Information Sciences, 2010, 53(6): 1159-1169.
  • 10Chen X, Xu F M, Ye Y. Lower bound theory of nonzero entries in solutions of L2-Lp minimization. SIAM Journal on Scientific Computing, 2010, 32(5): 2832-2852.

共引文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部