Mirjeta Pasha

Toluwani Okunola, Mirjeta Pasha, Misha E. Kilmer

When reconstructing images from noisy measurements, such as in medical scans or scientific imaging, we face an inverse problem: recovering an unknown image from indirect, corrupted observations. These problems are typically ill-posed, meaning small amounts of noise can lead to inaccurate reconstructions. Regularization techniques address this by incorporating prior assumptions about the solution, such as smoothness or sparsity. However, standard methods often blur sharp edges--the boundaries between tissues or structures--losing critical detail. A powerful strategy for edge preservation is iterative reweighting, which solves a sequence of weighted subproblems with adaptively updated weights. Non-cumulative schemes derive weights from the current iterate alone and can be solved efficiently using the Recycled Majorization-Minimization Generalized Krylov Subspace method (RMM-GKS). The cumulative approach of Gazzola et al. progressively accumulates edge information across iterations, achieving superior edge preservation but at high computational cost. This work introduces CR-$\ell_q$-RMM-GKS, which combines cumulative edge detection with computational efficiency. We integrate Gazzola's cumulative weighting with RMM-GKS, which handles general $\ell_q$ penalties ($0 < q \le 2$), automatically selects regularization parameters, and recycles Krylov subspaces between iterations, reducing the nested structure to two levels. Numerical experiments in signal deblurring and tomography demonstrate that CR-$\ell_q$-RMM-GKS produces significantly sharper edge reconstructions than standard non-cumulative methods. In particular, CR-$\ell_1$-RMM-GKS outperforms both standard $\ell_1$ methods and CR-$\ell_2$-RMM-GKS, indicating that cumulative weighting and $\ell_1$ penalties are highly complementary.

Rudi Smith, Mirjeta Pasha, Andrés Galindo-Olarte et al.

We present efficient, sketching-based methods for the summation of tensors in Tucker format. Leveraging the algebraic structure of Khatri-Rao and Kronecker products, our approach enables compressed arithmetic on Tucker tensors while controlling rank growth and computational cost. The proposed sketching framework avoids the explicit formation of large intermediate tensors, instead operating directly on the factor matrices and core tensors to produce accurate low-rank approximations of tensor sums. Furthermore, we analyze the computational complexity and the theoretical approximation properties of the proposed methodology. Numerical experiments demonstrate the effectiveness of our approach on four problems: two synthetic test cases, a parameter-dependent elliptic equation (commonly referred to as the cookie problem) solved via GMRES, and a one-dimensional linear transport problem discretized via high-order discontinuous Galerkin methods, where repeated tensor summation arises as a core computational bottleneck. Across these examples, the sketching-based summation achieves substantial computational savings while preserving high accuracy relative to direct summation and re-compression.

Toluwani Okunola, Mirjeta Pasha, Misha E. Kilmer et al.

Many practical imaging systems suffer from uncertainty in acquisition geometry -- such as projection angles in computed tomography or sensor positions in photoacoustic tomography -- leading to nonlinear inverse problems that require joint estimation of both the image and the forward model parameters. Standard approaches that assume a known linear forward operator fail to account for these uncertainties, resulting in significant reconstruction artifacts. We propose a nonlinear recycled majorization-minimization generalized Krylov subspace (NL-RMM-GKS) framework for large-scale inverse problems with uncertain forward operators. The method extends MM-GKS to nonlinear settings by combining majorization-minimization for nonsmooth regularization with Krylov subspace projection and subspace recycling, ensuring bounded memory usage. Two complementary formulations are developed: an alternating minimization approach that alternates between image updates and Gauss-Newton parameter estimation, and a variable projection approach that eliminates the image variable and optimizes directly over the parameters using inexact inner solves. We further introduce streaming variants that process data sequentially, enabling reconstruction from large or dynamically acquired datasets without storing the full operator. For dynamic problems, we incorporate two temporal regularization strategies -- optical flow and anisotropic total variation -- as plug-in choices within the framework. We carry out rigorous numerical experiments in fan-beam computed tomography and photoacoustic tomography to demonstrate that our proposed framework achieves high-quality reconstructions with bounded memory requirements, making it suitable for large-scale dynamic imaging problems.