arrow
Return

Truncated iterative thresholding algorithm for compressed sensing via fraction function

delete2026-01-01
delete0
PRE
AI
A
Angang Cui *
L
Lijun Zhang
S
Shengli Xue
H
Hong Yang
DOI:10.1007/s11075-026-02319-6delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Recently, the nonconvex fraction function has been well studied to recover the sparse signals, and the numerical results have shown that the fraction function performs very well in sparse signal recovery. However, the proposed FP algorithm for solving the fraction function minimization can only be proven to converge to a stationary point owing to the nonconvexity of the fraction function, and it is unclear what this stationary point is. More specifically, due to the nonconvex nature, this stationary point is hardly possible to be regarded as the global minimizer. In this paper, different from the previous proposed FP algorithm, a new algorithm and its adaptive version algorithm are studied to solve the fraction function minimization again. Under some conditions, both these two new algorithms can converge to the neighborhood of the global optimal solution of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _{0}$$\end{document}-norm minimization problem. The established convergence results of the new algorithms can provide a theoretical guarantee for a wide range of applications of the nonconvex fraction function in compressed sensing relevant problems. We also provide some numerical simulations to verify the performance of the proposed adaptive algorithm, and the numerical results show the effectiveness of the adaptive algorithm in sparse signal recovery.
Keywords:
Compressed sensing
Fraction function
Truncated iterative thresholding algorithm
Adaptive truncated iterative thresholding algorithm
Convergence

Journal

N
Numerical Algorithms
IF:
2
Papers:
181
Citations:
5.5K

Organization

N
northwestern polytechnical university
Scholars:
1.2W
Papers: 4.3K
Citations: 0
Y
Yulin University
Scholars:
1.1K
Papers: 713
Citations: 953