.png){kind=icon}
Return
Accelerated iterative simultaneous hard thresholding algorithm for joint sparse optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.rinam.2026.100711.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Joint sparse optimization (JSO) leverages the shared sparsity structure across multiple measurement vectors to enhance the signal recovery capability in various applications. In this paper, we propose an accelerated iterative simultaneous hard thresholding algorithm with gradient-based momentum for the JSO, and establish its approximate global convergence under the simultaneous restricted isometry property. Numerical experiments on simulated data demonstrate that the proposed algorithm converges faster and exhibits superior stability compared to several existing simultaneous algorithms.
Keywords:
Joint sparse optimization
Simultaneous hard thresholding
Gradient-based momentum
Approximate global convergence
Journal
R
IF:
1.3
Papers:
81
Citations:
9
Organization
Cited Papers
ShareSaveShareSaveJoint sparse optimization: lower-order regularization method and application in cell fate conversion.png)
IF0
PREAI
ShareSaveShareSave no more
no more