6 papers
Linear convergence of Gearhart-Koshy accelerated Kaczmarz methods for tensor linear systems
Yijie Wang, Yonghan Sun, Deren Han +1
The generalized Gearhart-Koshy acceleration is a recent exact affine search technique designed for the method of cyclic projections onto hyperplanes, i.e., the Kaczmarz method. How…
A greedy randomized average block projection method for linear feasibility problems
Lin Zhu, Yuan Lei, Jiaxin Xie
The randomized projection (RP) method is a simple iterative scheme for solving linear feasibility problems and has recently gained popularity due to its speed and low memory requir…
Graph Sparsification by Universal Greedy Algorithms
Ming-Jun Lai, Jiaxin Xie, Zhiqiang Xu
Graph sparsification is to approximate an arbitrary graph by a sparse graph and is useful in many applications, such as simplification of social networks, least squares problems, n…
A note on restricted invertibility with weighted columns
Jiaxin Xie
The restricted invertibility theorem was originally introduced by Bourgain and Tzafriri in and has been considered as one of the most celebrated theorems in geometry and ana…
A symmetric alternating minimization algorithm for total variation minimization
Yuan Lei, Jiaxin Xie
In this paper, we propose a novel symmetric alternating minimization algorithm to solve a broad class of total variation (TV) regularization problems. Unlike the usual …
Subset Selection for Matrices with Fixed Blocks
Jiaxin Xie, Zhiqiang Xu
Subset selection for matrices is the task of extracting a column sub-matrix from a given matrix with such that the pseudoinverse of the sampled m…