An Imaging Algorithm Based on Generalized Minimax-concave Penalty in Radio Interferometry
Abstract Reconstructing the sky brightness distribution from the incomplete visibilities involves an ill-posed inverse problem. Although compressive sensing methods based on convex optimization have demonstrated outstanding performance in radio interferometry, convex optimization yields a computable but biased approximate solution for compressive sensing. To reduce the bias and efficiently obtain an accurate solution, we proposed an imaging algorithm based on generalized minimax-concave penalty, which maintains the convexity of the sparsity-regularized least-squares objective function. Furthermore, we employ the forward-backward splitting algorithm to solve the optimization problem and adaptively update the regularization parameter by using a maximum likelihood estimator. We have verified the effectiveness of the proposed method based on the Very Large Array and DAocheng Radio Telescope.
Authors
- Xiaocheng Yang (ORCID: https://orcid.org/0000-0001-8511-6122)
- Bo Wei (ORCID: https://orcid.org/0000-0001-8033-5668)
- Gaofeng Wu (ORCID: https://orcid.org/0000-0002-2851-2038)
- Xuning Lv
- Lei Deng (ORCID: https://orcid.org/0000-0002-0584-1146)
- Lin Wu
- Jingye Yan
- Yang Yang
Institutions
- Zhejiang Sci-Tech University (CN)
- National Space Science Center (CN)
- Science and Technology Department of Sichuan Province (CN)
Publication Details
- Journal
- The Astronomical Journal
- Published
- 2026-03-11
- DOI
- https://doi.org/10.3847/1538-3881/ae45a1
- Primary Topic
- Radio Astronomy Observations and Technology
- Type
- article
- Field-Weighted Citation Impact
- 0.00