{"title":"Accelerated iterative simultaneous hard thresholding algorithm for joint sparse optimization","authors":"Heran Huang , Zihe Zheng , Xinlin Hu , Yifan Ye","doi":"10.1016/j.rinam.2026.100711","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":36918,"journal":{"name":"Results in Applied Mathematics","volume":"30 ","pages":"Article 100711"},"PeriodicalIF":1.5000,"publicationDate":"2026-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Results in Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2590037426000294","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/5/22 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
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.