Chenliang Li
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
Chenliang Li has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Yuhan Chen
School of Electronic Engineering and Automation and the School of Mathematics and Computational Science, Center for Applied Mathematics of Guangxi, Guangxi University Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin, Guangxi, China
3 shared publications - Zhiwei Ai
School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, China
3 shared publications Cuiyu Liu
Guilin University of Electronic Technology, Guilin, China
2 shared publications- Cong Guo
School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004, China
1 shared publication - Cuiyu Liu
Guilin University of Electronic Technology
1 shared publication Jun-Tao Hong
School of Mathematics and Computing Science
1 shared publication
Latest Publications
- Open Access
Block Subgradient Greedy Kaczmarz Methods for Robotic Grasping Problems
The robotic grasping problem is firstly cast as a linear complementarity problem and reformulated into nonsmooth equations. We propose two block Kaczmarz methods to solve the equations. The K-means clustering algorithm is utilized to partition the nonsmooth equations. Based on the resulting block information, the subgradient greedy randomized Kaczmarz method and the subgradient multi-step greedy Kaczmarz method are constructed. Asymptotic convergence of the proposed block subgradient Kaczmarz methods is given. Numerical results confirm the superior computational accuracy of the new methods.
Open AccessBlock Subgradient Greedy Kaczmarz Methods for Robotic Grasping Problems
The robotic grasping problem is firstly cast as a linear complementarity problem and reformulated into nonsmooth equations. We propose two block Kaczmarz methods to solve the equations. The K-means clustering algorithm is utilized to partition the nonsmooth equations. Based on the resulting block information, the subgradient greedy randomized Kaczmarz method and the subgradient multi-step greedy Kaczmarz method are constructed. Asymptotic convergence of the proposed block subgradient Kaczmarz methods is given. Numerical results confirm the superior computational accuracy of the new methods.
- 8 September 2025
- Published by Springer Nature in Calcolo
- Vol. 62 (4) , 1-21
Anderson acceleration of the tensor relaxation Jacobi method for solving Sylvester tensor equations
- 8 September 2025
- Published by Springer Nature in Calcolo
- Vol. 62 (4) , 1-21
Anderson acceleration of the tensor relaxation Jacobi method for solving Sylvester tensor equations
- Open Access
Accelerated Computation of Linear Complementarity Problem in Dexterous Robotic Grasping via Newton-Subgradient Non-Smooth Multi-Step Greedy Kaczmarz Method
Real-time computational capability for simultaneous grasping force and displacement determination constitutes a critical enabler for stable and reliable grasping performance in dexterous robotic grasping. To accelerate the computational efficiency of LCP in the dexterous grasping problem, as well as to ensure the stability and reproducibility of the algorithm’s output, the NSNMGK method, which incorporates sequential projection iterations across all greedy-selected active constraint rows within each NSNGRK framework iteration cycle, is developed. In each NSNMGK iteration, sequential projection operations are systematically applied to all active constraint rows, satisfying the greedy criterion. This processing strategy ensures the full utilization of qualifying constraints within the greedy subset through a same generalized Jacobian evaluation per iteration cycle. The methodology effectively mitigates inherent limitations of conventional randomized row selection, including unpredictable iteration counts and computational overhead from repeated Jacobian updates, while maintaining deterministic convergence behavior. The method’s convergence theory is rigorously established, with benchmark analyses demonstrating marked improvements in computational efficiency over the NSNGRK framework. Experimental validation in dexterous robotic grasping scenarios further confirms enhanced convergence rates through reduced iteration counts and shortened computational durations relative to existing approaches.
Open AccessAccelerated Computation of Linear Complementarity Problem in Dexterous Robotic Grasping via Newton-Subgradient Non-Smooth Multi-Step Greedy Kaczmarz Method
Real-time computational capability for simultaneous grasping force and displacement determination constitutes a critical enabler for stable and reliable grasping performance in dexterous robotic grasping. To accelerate the computational efficiency of LCP in the dexterous grasping problem, as well as to ensure the stability and reproducibility of the algorithm’s output, the NSNMGK method, which incorporates sequential projection iterations across all greedy-selected active constraint rows within each NSNGRK framework iteration cycle, is developed. In each NSNMGK iteration, sequential projection operations are systematically applied to all active constraint rows, satisfying the greedy criterion. This processing strategy ensures the full utilization of qualifying constraints within the greedy subset through a same generalized Jacobian evaluation per iteration cycle. The methodology effectively mitigates inherent limitations of conventional randomized row selection, including unpredictable iteration counts and computational overhead from repeated Jacobian updates, while maintaining deterministic convergence behavior. The method’s convergence theory is rigorously established, with benchmark analyses demonstrating marked improvements in computational efficiency over the NSNGRK framework. Experimental validation in dexterous robotic grasping scenarios further confirms enhanced convergence rates through reduced iteration counts and shortened computational durations relative to existing approaches.
- Open Access
Calculation of Robot Multi-Fingered Grasping Force and Displacement Based on the Newton–Subgradient Non-Smooth Greedy Randomized Kaczmarz Method for Solving Linear Complementarity Problem
The calculation of grasping force and displacement is important for multi-fingered stable grasping and research on slipping damage. By linearizing the friction cone, the robot multi-fingered grasping problem can be represented as a linear complementarity problem (LCP) with a saddle-point coefficient matrix. Because the solution methods for LCP proposed in the field of numerical computation cannot be applied to this problem and the Pivot method can only be used for solving specific grasping problems, the LCP is converted into a non-smooth system of equations for solving it. By combining the Newton method with the subgradient and Kaczmarz methods, a Newton–subgradient non-smooth greedy randomized Kaczmarz (NSNGRK) method is proposed to solve this non-smooth system of equations. The convergence of the proposed method is established. Our numerical experiments indicate its feasibility and effectiveness in solving the grasping force and displacement problems of multi-fingered grasping.
Open AccessCalculation of Robot Multi-Fingered Grasping Force and Displacement Based on the Newton–Subgradient Non-Smooth Greedy Randomized Kaczmarz Method for Solving Linear Complementarity Problem
The calculation of grasping force and displacement is important for multi-fingered stable grasping and research on slipping damage. By linearizing the friction cone, the robot multi-fingered grasping problem can be represented as a linear complementarity problem (LCP) with a saddle-point coefficient matrix. Because the solution methods for LCP proposed in the field of numerical computation cannot be applied to this problem and the Pivot method can only be used for solving specific grasping problems, the LCP is converted into a non-smooth system of equations for solving it. By combining the Newton method with the subgradient and Kaczmarz methods, a Newton–subgradient non-smooth greedy randomized Kaczmarz (NSNGRK) method is proposed to solve this non-smooth system of equations. The convergence of the proposed method is established. Our numerical experiments indicate its feasibility and effectiveness in solving the grasping force and displacement problems of multi-fingered grasping.
- 14 November 2024
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- p. 1-16
Modulus-Based Cascadic Multigrid Method for Quasi-variational Inequality Problems
- 14 November 2024
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- p. 1-16
Modulus-Based Cascadic Multigrid Method for Quasi-variational Inequality Problems
- 25 October 2024
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- Vol. 7 (3) , 987-1001
Overlapping Domain Decomposition Methods Based on Tensor Format for Solving High-Dimensional Partial Differential Equations
- 25 October 2024
- Published by Springer Nature in Communications on Applied Mathematics and Computation
- Vol. 7 (3) , 987-1001
Overlapping Domain Decomposition Methods Based on Tensor Format for Solving High-Dimensional Partial Differential Equations
- 28 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (3) , 4397-4405
A Tensor Multigrid Method for Solving Sylvester Tensor Equations
In this paper, we propose a tensor multigrid method and an iterative tensor multigrid method to solve the Sylvester tensor equations which may arise from the discretization of high order partial differential equations (PDEs). The convergence and complexity of the tensor multigrid algorithm are given. Finally, the feasibility and effectiveness of the new methods are verified by some numerical examples Note to Practitioners —Sylvester tensor equation plays a very important role in the field of stability and control theory. It is significant to find an effective method to solve high order Sylvester tensor equations because of the large computational work. Based on the advantages of the multigrid method, this paper proposes a tensor multigrid method and an iterative tensor multigrid method, the latter aiming to maintain accuracy while potentially reducing time consumption. The experimental results show the superiority of our methods compared with the existing methods.
- 28 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (3) , 4397-4405
A Tensor Multigrid Method for Solving Sylvester Tensor Equations
In this paper, we propose a tensor multigrid method and an iterative tensor multigrid method to solve the Sylvester tensor equations which may arise from the discretization of high order partial differential equations (PDEs). The convergence and complexity of the tensor multigrid algorithm are given. Finally, the feasibility and effectiveness of the new methods are verified by some numerical examples Note to Practitioners —Sylvester tensor equation plays a very important role in the field of stability and control theory. It is significant to find an effective method to solve high order Sylvester tensor equations because of the large computational work. Based on the advantages of the multigrid method, this paper proposes a tensor multigrid method and an iterative tensor multigrid method, the latter aiming to maintain accuracy while potentially reducing time consumption. The experimental results show the superiority of our methods compared with the existing methods.
- Open Access
- 22 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (10) , 2389
Overlapping Domain Decomposition Method with Cascadic Multigrid for Image Restoration
In the process of image restoration, it is usually necessary to solve large-scale inverse problems, where the computational cost is very high for large or high-resolution images. The domain decomposition method is one of the most effective algorithms to solve large-scale problems, which can effectively decrease the computational cost. The cascadic multigrid method has a good effect on the linear model of image restoration and can obtain high quality restored images. In this paper, the overlapping domain decomposition method (DDM) with the cascadic multigrid method (CMG) and the DDM with new extrapolation cascadic multigrid method (NECMG) are presented to solve the image restoration problems of denoising and deblurring. We first divide the image problem into some overlapping and independent subproblems. Then, each subproblem is solved independently by CMG or NECMG with the edge-preserving operator. Numerical experiments show that the new method is effective.
- 22 May 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (10) , 2389
Open AccessOverlapping Domain Decomposition Method with Cascadic Multigrid for Image Restoration
In the process of image restoration, it is usually necessary to solve large-scale inverse problems, where the computational cost is very high for large or high-resolution images. The domain decomposition method is one of the most effective algorithms to solve large-scale problems, which can effectively decrease the computational cost. The cascadic multigrid method has a good effect on the linear model of image restoration and can obtain high quality restored images. In this paper, the overlapping domain decomposition method (DDM) with the cascadic multigrid method (CMG) and the DDM with new extrapolation cascadic multigrid method (NECMG) are presented to solve the image restoration problems of denoising and deblurring. We first divide the image problem into some overlapping and independent subproblems. Then, each subproblem is solved independently by CMG or NECMG with the edge-preserving operator. Numerical experiments show that the new method is effective.
- 10 May 2023
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 30 (5)
Preconditioned tensor format conjugate gradient squared and biconjugate gradient stabilized methods for solving stein tensor equations
This article is concerned with solving the high order Stein tensor equation arising in control theory. The conjugate gradient squared (CGS) method and the biconjugate gradient stabilized (BiCGSTAB) method are attractive methods for solving linear systems. Compared with the large‐scale matrix equation, the equivalent tensor equation needs less storage space and computational costs. Therefore, we present the tensor formats of CGS and BiCGSTAB methods for solving high order Stein tensor equations. Moreover, a nearest Kronecker product preconditioner is given and the preconditioned tensor format methods are studied. Finally, the feasibility and effectiveness of the new methods are verified by some numerical examples.
- 10 May 2023
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 30 (5)
Preconditioned tensor format conjugate gradient squared and biconjugate gradient stabilized methods for solving stein tensor equations
This article is concerned with solving the high order Stein tensor equation arising in control theory. The conjugate gradient squared (CGS) method and the biconjugate gradient stabilized (BiCGSTAB) method are attractive methods for solving linear systems. Compared with the large‐scale matrix equation, the equivalent tensor equation needs less storage space and computational costs. Therefore, we present the tensor formats of CGS and BiCGSTAB methods for solving high order Stein tensor equations. Moreover, a nearest Kronecker product preconditioner is given and the preconditioned tensor format methods are studied. Finally, the feasibility and effectiveness of the new methods are verified by some numerical examples.
- 21 February 2023
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 72 (9) , 1385-1402
A new preconditioned AOR method for solving multi-linear systems
In this paper, a new preconditioned AOR method for solving the multi-linear systems with -tensor is presented. The convergence of the new method and the corresponding comparison for the spectral radius of preconditioned iterative tensors are given. Numerical examples demonstrate that the new method is feasible and effective. As an application, we also show the efficiency of our preconditioner for solving higher order Markov chains.- 21 February 2023
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 72 (9) , 1385-1402
A new preconditioned AOR method for solving multi-linear systems
In this paper, a new preconditioned AOR method for solving the multi-linear systems with -tensor is presented. The convergence of the new method and the corresponding comparison for the spectral radius of preconditioned iterative tensors are given. Numerical examples demonstrate that the new method is feasible and effective. As an application, we also show the efficiency of our preconditioner for solving higher order Markov chains.