A Reduced Half Thresholding Algorithm

In this paper, a reduced half thresholding algorithm and its accelerated version, a reduced fast half thresholding algorithm, are proposed for solving large-scale L 1 / 2 -regularized problems. At each iteration, the large-scale original problem is reduced into a sequence of small-scale subproblems,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scientific computing Ročník 96; číslo 2
Hlavní autoři: Liang, Xiubo, Wang, Guoqiang, Yu, Bo
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.08.2023
Témata:
Algorithms
Computational Mathematics and Numerical Analysis
Mathematical and Computational Engineering
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Theoretical
Sparse optimization
Thresholding algorithms
regularization
ISSN:0885-7474, 1573-7691
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, a reduced half thresholding algorithm and its accelerated version, a reduced fast half thresholding algorithm, are proposed for solving large-scale L 1 / 2 -regularized problems. At each iteration, the large-scale original problem is reduced into a sequence of small-scale subproblems, and the subproblems are solved by the (fast) half thresholding algorithm. Global convergence of the reduced half thresholding algorithm is proven, and two techniques: the Newton acceleration technique and the shrinking technique are presented to improve the performance. Compared with the state-of-the-art algorithms, the numerical results show that the presented algorithms are promising. As an example, our algorithms are efficient to recover the signal recovery problem with 19,264,097 samples and signal length 29,890,095
ISSN:0885-7474
1573-7691
DOI:10.1007/s10915-023-02250-1