A double optimal solution (DOS) of a least-squares problem A x= b, A∈ R q× n with q≠ n is
derived in an m+ 1-dimensional varying affine Krylov subspace (VAKS); two minimization …

We present a simple yet efficient two-stage extended Kaczmarz-type algorithm for solving
large least squares problem. During each stage, the current iterate is projected onto a …

Background and objective Establishing accurate one-to-one morphological correspondence
between different hippocampal surfaces is a solid foundation for the analysis of AD-induced …

The randomized Kaczmarz algorithm is one of the most popular approaches for solving
large-scale linear systems due to its simplicity and efficiency. In this paper, we introduce two …

Image reconstruction in multispectral computed tomography (MSCT) requires solving a
challenging nonlinear inverse problem, commonly tackled via iterative optimization …

The randomized Kaczmarz algorithm is one of the most popular approaches for solving
large-scale linear systems due to its simplicity and efficiency. In this paper, we propose two …

Nonconvex optimization problems have always been one focus in deep learning, in which
many fast adaptive algorithms based on momentum are applied. However, the full gradient …

In this paper, two randomized block Kaczmarz methods to compute inner inverses of any
rectangular matrix A are presented. These are iterative methods without matrix …

In this paper, based on Lagrangian functions of the optimization problem we develop a
sketch-and-project method for solving the linear matrix equation AXB= C by introducing …

In view of the advantages of simplicity and effectiveness of the Kaczmarz method, which was
originally employed to solve the large-scale system of linear equations $ Ax= b $, we study …