Ruiping Wen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ruiping Wen has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
Guo-Yan Meng
Xinzhou Teachers College
3 shared publicationsFu-Jiao Ren
Taiyuan Normal University
2 shared publications- Pei-Pei Zhao
School of Mathematics and Statistics, Taiyuan Normal University, Jinzhong, China
2 shared publications Yalei Pei
Shanxi Key Laboratory for Intelligent Optimization Computing and Blockchain Technology, Taiyuan Normal University, Jinzhong 030619, Shanxi, China
2 shared publicationsChuan-Long Wang
Department of Mathematics, Taiyuan Teachers' College, Taiyuan 030012, Shanxi Province, China
1 shared publication- Chuan-Long Wang
Department of Mathematics, Taiyuan Normal University, Taiyuan, People’s Republic of China
1 shared publication
Latest Publications
- Open Access
- 4 February 2026
- Published by Springer Nature in Research Square
Improved parameterized preconditioner for linear system from multiplicative half-quadratic regularized image restoration
Image restoration is a fundamental problem in image processing, recovering a clear image from its degraded observation is an ill-posed problem, which can be addressed effectively by regularized techniques. Image restoration can usually be solved by minimizing a cost function consisting of a data-fidelity term and a regularization term. In this paper, we consider the multiplicative half-quadratic regularized image restoration problem and the Newton method is employed to solve the regularized model. At each step of the Newton iteration, a linear system of equations with symmetric positive definite coefficient matrix needs to be solved. Based on the block triangular decomposition of the coefficient matrix, by introducing a parameter, and taking the truncated Taylor expansion form of the Schur complement inverse matrix, we design a parameterized preconditioner of the coefficient matrix and combine it into the conjugate gradient method to solve the linear system efficiently. The spectral properties of the preconditioned matrix are further analyzed. Numerical experiments demonstrate that the proposed preconditioner for solving the multiplicative half-quadratic regularization image restoration problem is more robust and effective, in reducing both the number of iterations and the overall computation time compared with the existing preconditioners.
- 4 February 2026
- Published by Springer Nature in Research Square
Open AccessImproved parameterized preconditioner for linear system from multiplicative half-quadratic regularized image restoration
Image restoration is a fundamental problem in image processing, recovering a clear image from its degraded observation is an ill-posed problem, which can be addressed effectively by regularized techniques. Image restoration can usually be solved by minimizing a cost function consisting of a data-fidelity term and a regularization term. In this paper, we consider the multiplicative half-quadratic regularized image restoration problem and the Newton method is employed to solve the regularized model. At each step of the Newton iteration, a linear system of equations with symmetric positive definite coefficient matrix needs to be solved. Based on the block triangular decomposition of the coefficient matrix, by introducing a parameter, and taking the truncated Taylor expansion form of the Schur complement inverse matrix, we design a parameterized preconditioner of the coefficient matrix and combine it into the conjugate gradient method to solve the linear system efficiently. The spectral properties of the preconditioned matrix are further analyzed. Numerical experiments demonstrate that the proposed preconditioner for solving the multiplicative half-quadratic regularization image restoration problem is more robust and effective, in reducing both the number of iterations and the overall computation time compared with the existing preconditioners.
- Open Access
- 25 November 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (23) , 3781
NRSAI: An Adaptive and Efficient Preconditioner for Large Sparse Linear Systems
This paper presents a new Residual-based Sparse Approximate Inverse algorithm, designed to be automatic, computationally efficient, and highly parallelizable. After briefly reviewing Frobenius-norm-based preconditioning techniques and identifying two key challenges in this class of methods, we introduce an improved approach that integrates adaptive strategies from the Power Sparse Approximate Inverse algorithm and incomplete LU factorization. The method leverages the Hamilton–Cayley theorem for effective sparsity pattern construction and employs LU decomposition for efficient implementation. Theoretical analysis establishes the convergence properties and computational features of the proposed algorithm. Numerical experiments using real-world data demonstrate that the proposed algorithm significantly outperforms established methods—including the Sparse Approximate Inverse, Power Sparse Approximate Inverse and Residual-based Sparse Approximate Inverse algorithms—with a Generalized Minimal Residual iterative solver, confirming its superior efficiency and practical applicability.
- 25 November 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (23) , 3781
Open AccessNRSAI: An Adaptive and Efficient Preconditioner for Large Sparse Linear Systems
This paper presents a new Residual-based Sparse Approximate Inverse algorithm, designed to be automatic, computationally efficient, and highly parallelizable. After briefly reviewing Frobenius-norm-based preconditioning techniques and identifying two key challenges in this class of methods, we introduce an improved approach that integrates adaptive strategies from the Power Sparse Approximate Inverse algorithm and incomplete LU factorization. The method leverages the Hamilton–Cayley theorem for effective sparsity pattern construction and employs LU decomposition for efficient implementation. Theoretical analysis establishes the convergence properties and computational features of the proposed algorithm. Numerical experiments using real-world data demonstrate that the proposed algorithm significantly outperforms established methods—including the Sparse Approximate Inverse, Power Sparse Approximate Inverse and Residual-based Sparse Approximate Inverse algorithms—with a Generalized Minimal Residual iterative solver, confirming its superior efficiency and practical applicability.
- Open Access
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 10 (3) , 6492-6511
A new algorithm by embedding structured data for low-rank tensor ring completion
In this paper, we put up with a new algorithm for tensor completion problems that include missing slices or row/column fibers, where embedding a structured tensor by a multi-way delay-embedding transform (MDT) makes the tensor to be completed have a special structure. The main idea is to employ a tensor completion algorithm based on the tensor ring rank, constructing latent tensor ring factors with a structure that approximates the original tensor starting from the tensor structure. It is also proved that the sequence generated by the new algorithm converges to the optimal solution. Finally, the feasibility of the proposed algorithm is verified by experiments. Compared with other completed algorithms based on tensor ring rank, the completed accuracy is improved, up to 30%.
- 1 January 2025
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 10 (3) , 6492-6511
Open AccessA new algorithm by embedding structured data for low-rank tensor ring completion
In this paper, we put up with a new algorithm for tensor completion problems that include missing slices or row/column fibers, where embedding a structured tensor by a multi-way delay-embedding transform (MDT) makes the tensor to be completed have a special structure. The main idea is to employ a tensor completion algorithm based on the tensor ring rank, constructing latent tensor ring factors with a structure that approximates the original tensor starting from the tensor structure. It is also proved that the sequence generated by the new algorithm converges to the optimal solution. Finally, the feasibility of the proposed algorithm is verified by experiments. Compared with other completed algorithms based on tensor ring rank, the completed accuracy is improved, up to 30%.
- Open Access
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Electronic Research Archive
- Vol. 32 (11) , 5926-5942
A hybrid singular value thresholding algorithm with diagonal-modify for low-rank matrix recovery
In this paper, a new hybrid singular value thresholding with diagonal-modify algorithm based on the augmented Lagrange multiplier (ALM) method was proposed for low-rank matrix recovery, in which only part singular values were treated by a hybrid threshold operator with diagonal-update, and which allowed the algorithm to make use of simple arithmetic operation and keep the computational cost of each iteration low. The new algorithm decreased the complexity of the singular value decomposition and shortened the computing time. The convergence of the new algorithm was discussed. Finally, numerical experiments shown that the new algorithm greatly improved the solving efficiency of a matrix recovery problem and saved the calculation cost, and its effect was obviously better than that of the other algorithms mentioned in experiments.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Electronic Research Archive
- Vol. 32 (11) , 5926-5942
Open AccessA hybrid singular value thresholding algorithm with diagonal-modify for low-rank matrix recovery
In this paper, a new hybrid singular value thresholding with diagonal-modify algorithm based on the augmented Lagrange multiplier (ALM) method was proposed for low-rank matrix recovery, in which only part singular values were treated by a hybrid threshold operator with diagonal-update, and which allowed the algorithm to make use of simple arithmetic operation and keep the computational cost of each iteration low. The new algorithm decreased the complexity of the singular value decomposition and shortened the computing time. The convergence of the new algorithm was discussed. Finally, numerical experiments shown that the new algorithm greatly improved the solving efficiency of a matrix recovery problem and saved the calculation cost, and its effect was obviously better than that of the other algorithms mentioned in experiments.
- 6 February 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (2) , 1-24
Extension of the unextendible product bases of 5-qubit under coarsening the system
- 6 February 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (2) , 1-24
Extension of the unextendible product bases of 5-qubit under coarsening the system
- Open Access
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 8 (6) , 14047-14063
An accelerated alternating directional method with non-monotone technique for matrix recovery
Low-rank and sparse structures have been frequently exploited in matrix recovery and robust PCA problems. In this paper, we develop an alternating directional method and its variant equipped with the non-monotone search procedure for solving a non-convex optimization model of low-rank and sparse matrix recovery problems, where the concerned matrix with incomplete data is separable into a low-rank part and a sparse part. The main idea is to use the alternating minimization method for the low-rank matrix part, and to use the non-monotone line search technique for the sparse matrix part to iteratively update, respectively. To some extent, the non-monotone strategy relaxes the single-step descent into a multi-step descent and then greatly improves the performance of the alternating directional method. Theoretically, we prove the global convergence of the two proposed algorithms under some mild conditions. Finally, the comparison of numerical experiments shows that the alternate directional method with non-monotone technique is more effective than the original monotone method and the previous method. The efficiency and effectiveness of the proposed algorithms are demonstrated by solving some instances of random incomplete matrix recovery problems and some problems of the background modeling in video processing.
- 1 January 2023
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 8 (6) , 14047-14063
Open AccessAn accelerated alternating directional method with non-monotone technique for matrix recovery
Low-rank and sparse structures have been frequently exploited in matrix recovery and robust PCA problems. In this paper, we develop an alternating directional method and its variant equipped with the non-monotone search procedure for solving a non-convex optimization model of low-rank and sparse matrix recovery problems, where the concerned matrix with incomplete data is separable into a low-rank part and a sparse part. The main idea is to use the alternating minimization method for the low-rank matrix part, and to use the non-monotone line search technique for the sparse matrix part to iteratively update, respectively. To some extent, the non-monotone strategy relaxes the single-step descent into a multi-step descent and then greatly improves the performance of the alternating directional method. Theoretically, we prove the global convergence of the two proposed algorithms under some mild conditions. Finally, the comparison of numerical experiments shows that the alternate directional method with non-monotone technique is more effective than the original monotone method and the previous method. The efficiency and effectiveness of the proposed algorithms are demonstrated by solving some instances of random incomplete matrix recovery problems and some problems of the background modeling in video processing.
- Open Access
- 17 August 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-22
Singularity Analysis of Composite Laminated Piezoelectric Rectangular Plate Structure with 1 : 2 Internal Resonance
This study investigates the dynamical behavior of the composite laminated piezoelectric rectangular plate with 1 : 2 internal resonance near the singularity using the extended singularity theory method. Based on the previous four-dimensional averaged equations of polar coordinates where the partial derivative terms are not equal to zero, the universal unfolding with codimension 3 of the proposed system is given. The main material parameters that affect the dynamic behavior of the laminated piezoelectric rectangular composite plate near the singularity under transverse excitation are revealed by the transition set of universal unfolding with codimension 3. In addition, the plots of the transition set in three bifurcation parameters space are discussed. These numerical results can show that the stability near the singularity of the proposed system is better when period ratio is less than zero.
- 17 August 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-22
Open AccessSingularity Analysis of Composite Laminated Piezoelectric Rectangular Plate Structure with 1 : 2 Internal Resonance
This study investigates the dynamical behavior of the composite laminated piezoelectric rectangular plate with 1 : 2 internal resonance near the singularity using the extended singularity theory method. Based on the previous four-dimensional averaged equations of polar coordinates where the partial derivative terms are not equal to zero, the universal unfolding with codimension 3 of the proposed system is given. The main material parameters that affect the dynamic behavior of the laminated piezoelectric rectangular composite plate near the singularity under transverse excitation are revealed by the transition set of universal unfolding with codimension 3. In addition, the plots of the transition set in three bifurcation parameters space are discussed. These numerical results can show that the stability near the singularity of the proposed system is better when period ratio is less than zero.
- Open Access
- 24 December 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-14
A Singular Value Thresholding with Diagonal-Update Algorithm for Low-Rank Matrix Completion
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 recommendation systems. In this paper, an SVT with diagonal-update (D-SVT) algorithm was put forward, which allows the algorithm to make use of simple arithmetic operation and keep the computational cost of each iteration low. The low-rank matrix would be reconstructed well. The convergence of the new algorithm was discussed in detail. Finally, the numerical experiments show the effectiveness of the new algorithm for low-rank matrix completion.
- 24 December 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-14
Open AccessA Singular Value Thresholding with Diagonal-Update Algorithm for Low-Rank Matrix Completion
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 recommendation systems. In this paper, an SVT with diagonal-update (D-SVT) algorithm was put forward, which allows the algorithm to make use of simple arithmetic operation and keep the computational cost of each iteration low. The low-rank matrix would be reconstructed well. The convergence of the new algorithm was discussed in detail. Finally, the numerical experiments show the effectiveness of the new algorithm for low-rank matrix completion.
- Open Access
- 16 March 2020
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2020 (1) , 1-13
Toeplitz matrix completion via a low-rank approximation algorithm
In this paper, we propose a low-rank matrix approximation algorithm for solving the Toeplitz matrix completion (TMC) problem. The approximation matrix was obtained by the mean projection operator on the set of feasible Toeplitz matrices for every iteration step. Thus, the sequence of the feasible Toeplitz matrices generated by iteration is of Toeplitz structure throughout the process, which reduces the computational time of the singular value decomposition (SVD) and approximates well the solution. On the theoretical side, we provide a convergence analysis to show that the matrix sequences of iterates converge. On the practical side, we report the numerical results to show that the new algorithm is more effective than the other algorithms for the TMC problem.
- 16 March 2020
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2020 (1) , 1-13
Open AccessToeplitz matrix completion via a low-rank approximation algorithm
In this paper, we propose a low-rank matrix approximation algorithm for solving the Toeplitz matrix completion (TMC) problem. The approximation matrix was obtained by the mean projection operator on the set of feasible Toeplitz matrices for every iteration step. Thus, the sequence of the feasible Toeplitz matrices generated by iteration is of Toeplitz structure throughout the process, which reduces the computational time of the singular value decomposition (SVD) and approximates well the solution. On the theoretical side, we provide a convergence analysis to show that the matrix sequences of iterates converge. On the practical side, we report the numerical results to show that the new algorithm is more effective than the other algorithms for the TMC problem.