Journal
IEEE ACCESS
Volume 6, Issue -, Pages 44894-44904Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2018.2855958
Keywords
Composite trigonometric function; iteratively re-weighted method; null-space of the measurement matrix; quasi-Newton algorithm; smooth approximations of non-smooth functions; unconstrained convex optimization
Categories
Funding
- National Natural Science Foundation of China [61671168]
- Natural Science Foundation of Heilongjiang Province [QC2016085]
- Fundamental Research Funds for the Central Universities [HEUCFJ180801, HEUCF180801]
Ask authors/readers for more resources
Accurate signal recovery from an underdetermined system of linear equation (USLE) is a topic of considerable interest; such as compressed sensing (CS), recovery of low-rank matrix, blind source separation, and related fields. In order to improve the accuracy of signal recovery from an USLE in CS, we develop a new algorithm called composite trigonometric function null-space re-weighted approximate l(0)-norm (CTNRAL0). The proposed algorithm deploys composite trigonometric function as a nonconvex penalty for sparsity which can better approximate l(0)-norm and can yield more accurate solution. To solve nonconvex minimization formulation efficiently, we adopt a gradual nonconvexity method. In addition, the null space measurement matrix is applied in the CTNRAL0 algorithm, which reduces the dimension of the matrix. The proposed algorithm has been compared with the smoothed l(0)-norm and null-space re-weighted approximate l(0)-norm algorithm via numerical simulations to show its improved performance in the noise environment, while computation cost required is comparable. Furthermore, compared with the interior-point LP solvers and iteratively re-weighted least squares algorithm, the proposed algorithm computation cost can reduce by 1 or 2 orders of magnitude.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available