Over the past few decades, various numerical methods have been developed to solve linear inverse problems with sparse solutions. However, there remains a shortage of efficient algorithms specifically tailored for large-scale problems. In this paper, we work toward bridging this gap by developing the so-called General Decomposition Pursuit algorithm, which is designed to directly tackle a large-scale problem. This algorithmic framework is notably distinct from any existing sparsity-aware method. The main mechanism of the algorithm involves decomposing a large problem into several mutually coupled small subproblems and then combining the (inexact) solutions of these subproblems to generate a sparse solution to the original problem. The global convergence of the algorithm is shown under the restricted isometry property. Simulations with synthetic data and applications in medical image reconstruction indicate that the proposed algorithm, when equipped with an appropriate inner solver for subproblems, can outperform several mainstream algorithms in success rates for locating the sparse solution to the problem.

Publication:

INVERSE PROBLEMS

http://dx.doi.org/10.1088/1361-6420/ae6477

Author:

Zhao, Yun-Bin(corresponding author)

Chinese Univ Hong Kong, Shenzhen Int Ctr Ind & Appl Math, SRIBD, Shenzhen, Peoples R China;

Email：yunbinzhao@cuhk.edu.cn

Sun, Zhong-Feng

Shandong Univ Technol, Sch Math & Stat, Zibo, Shandong, Peoples R China;

Email：zfsun@sdut.edu.cn

Liu, Xin

Chinese Acad Sci, State Key Lab Math Sci, AMSS, Beijing, Peoples R China;

Univ Chinese Acad Sci, Beijing, Peoples R China;

Email：liuxin@lsec.cc.ac.cn;

Yu, Quan

Hunan Univ, Sch Math, Changsha, Hunan, Peoples R China

Email：quanyu@hnu.edu.cn