Toplitz matrix completion (TMC) is to fill a low-rank Toeplitz matrix from a small subset of its
entries. Based on the augmented Lagrange multiplier (ALM) algorithm for matrix completion, …

In this paper, we present a quasi-Chebyshev accelerated iteration method for solving a
system of linear equations. Compared with the Chebyshev semi-iterative method, the main …

In this paper, a new gradient projection method is proposed, which generates a feasible matrix
sequences. The decent property of this method is proved. Based on the decent property, …

In this study, we propose a modified quasi-Chebyshev acceleration to the nonoverlopping
multisplitting iteration method for solving the linear systems Ax = b where A is a real symmetric …

There has been a lot of study on the SOR-like methods for solving the augmented system of
linear equations since the outstanding work of Golub, Wu and Yuan (BIT 41(2001)71-85) …

In this paper we present a new splitting method for solving a linear systems with non-Hermitian
positive definite coefficient matrix. This splitting overcomes the computation complexity of …

The singular value thresholding (SVT) algorithm plays an important role in the well‐known
matrix reconstruction problem, and it has many applications in computer vision and …

Despite matrix completion requiring the global solution of a non-convex objective, there are
many computational efficient algorithms which are effective for a broad class of matrices. …

In this paper, we will present the block splitting iterative methods with general weighting
matrices for solving linear systems of algebraic equations Ax=b when the coefficient matrix A is …

In this paper, we generalize the nonstationary parallel multisplitting iterative method for solving
the symmetric positive definite linear systems. With several choices of variable weighting …