Nonconvex fraction function recovery sparse signal by convex optimization algorithm

arXiv1905.05436MaRDI QIDQ6318684FDOQ6318684

Authors: Angang Cui, Ji-Gen Peng, Hai-Yang Li, M. Wen 

Publication date: 14 May 2019

Abstract: In this paper, we will generate a convex iterative FP thresholding algorithm to solve the problem $(F{P}_a^{lambda})$. Two schemes of convex iterative FP thresholding algorithms are generated. One is convex iterative FP thresholding algorithm-Scheme 1 and the other is convex iterative FP thresholding algorithm-Scheme 2. A global convergence theorem is proved for the convex iterative FP thresholding algorithm-Scheme 1. Under an adaptive rule, the convex iterative FP thresholding algorithm-Scheme 2 will be adaptive both for the choice of the regularized parameter $lambda$ and parameter $a$. These are the advantages for our two schemes of convex iterative FP thresholding algorithm compared with our previous proposed two schemes of iterative FP thresholding algorithm. At last, we provide a series of numerical simulations to test the performance of the convex iterative FP thresholding algorithm-Scheme 2, and the simulation results show that our convex iterative FP thresholding algorithm-Scheme 2 performs very well in recovering a sparse signal.

This page was built for publication: Nonconvex fraction function recovery sparse signal by convex optimization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6318684)