Indexed by:
Abstract:
This article proposes a novel iterative weighted group thresholding method for group sparse recovery of signals from underdetermined linear systems. Based on an equivalent weighted group minimization problem with l(p)(p)-norm (0 < p <= 1), we derive closed-form solutions for a subproblem with respect to some specific values of p when using the proximal gradient method. Then, we design the corresponding algorithmic framework, including stopping criterion and the method of nonmonotone line search, and prove that the solution sequence generated by the proposed algorithm converges under some mild conditions. Moreover, based on the proposed algorithm, we develop a homotopy algorithm with an adaptively updated group threshold. Extensive computational experiments on the simulated and real data show that our approach is competitive with state-of-the-art methods in terms of exact group selection, estimation accuracy, and computation time.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS
ISSN: 2162-237X
Year: 2021
Issue: 1
Volume: 32
Page: 63-76
1 4 . 2 5 5
JCR@2021
1 0 . 2 0 0
JCR@2023
ESI Discipline: COMPUTER SCIENCE;
ESI HC Threshold:106
JCR Journal Grade:1
CAS Journal Grade:1
Cited Count:
WoS CC Cited Count: 7
SCOPUS Cited Count: 7
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0