Efficient Decomposition-Based Algorithms for $\ell_1$-Regularized Inverse Problems with Column-Orthogonal and Kronecker Product Matrices
Abstract
We consider an -regularized inverse problem where both the forward and regularization operators have a Kronecker product structure. By leveraging this structure, a joint decomposition can be obtained using generalized singular value decompositions. We show how this joint decomposition can be effectively integrated into the Split Bregman and Majorization-Minimization methods to solve the -regularized inverse problem. Furthermore, for cases involving column-orthogonal regularization matrices, we prove that the joint decomposition can be derived directly from the singular value decomposition of the system matrix. As a result, we show that framelet and wavelet operators are efficient for these decomposition-based algorithms in the context of -regularized image deblurring problems.
Cite
@article{arxiv.2409.00883,
title = {Efficient Decomposition-Based Algorithms for $\ell_1$-Regularized Inverse Problems with Column-Orthogonal and Kronecker Product Matrices},
author = {Brian Sweeney and Malena I. Español and Rosemary Renaut},
journal= {arXiv preprint arXiv:2409.00883},
year = {2024}
}
Comments
24 pages, 9 figures