Cairong Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Cairong Chen has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Deren Han
School of Mathematical Sciences, Beihang University, Beijing, People’s Republic of China
12 shared publications - Dongmei Yu
Institute for Optimization and Decision Analytics Liaoning Technical University 123000 Fuxin P.R. China
11 shared publications - Changfeng Ma
School of Artificial Intelligence, Xiamen Institute of Technology, Xiamen, China
7 shared publications - Jiayu Liu
School of Mathematics and Statistics & Key Laboratory of Analytical Mathematics and Applications (Ministry of Education) Fujian Provincial Key Laboratory of Statistics and Artificial Intelligence Fujian Normal University 350117 Fuzhou P.R. China
4 shared publications - Tingting Luo
School of Mathematics and Statistics & Key Laboratory of Analytical Mathematics and Applications (Ministry of Education) Fujian Provincial Key Laboratory of Statistics and Artificial Intelligence Fujian Normal University 350117 Fuzhou P.R. China
4 shared publications - Huiling Wei
School of Business Administration, Liaoning Technical University, Huludao, People’s Republic of China
2 shared publications
Latest Publications
- 23 July 2026
- Published by Global Science Press in Annals of Applied Mathematics
- Vol. 42 (1) , 33-48
A Fixed-Time Stable Neurodynamic Model for Solving General Nonlinear Projection Equations
A general nonlinear projection equation is investigated in this paper. Under mild conditions, the uniqueness of the solution, a bound of the residual and an error bound for this equation are given. Based on the properties of the general nonlinear projection equation, a neurodynamic model for solving this equation is proposed and the fixed-time stability is proved. As an application, the model is applied to solve the semi-smooth projection equation. Numerical results demonstrate the effectiveness of the proposed method.
- 23 July 2026
- Published by Global Science Press in Annals of Applied Mathematics
- Vol. 42 (1) , 33-48
A Fixed-Time Stable Neurodynamic Model for Solving General Nonlinear Projection Equations
A general nonlinear projection equation is investigated in this paper. Under mild conditions, the uniqueness of the solution, a bound of the residual and an error bound for this equation are given. Based on the properties of the general nonlinear projection equation, a neurodynamic model for solving this equation is proposed and the fixed-time stability is proved. As an application, the model is applied to solve the semi-smooth projection equation. Numerical results demonstrate the effectiveness of the proposed method.
- 22 July 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 95 (1) , 481-483
Correction: A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems
- 22 July 2026
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 95 (1) , 481-483
Correction: A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems
- 8 December 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 72 (1) , 45
An extended matrix splitting iteration method for solving the generalized absolute value equation with its applications
- 8 December 2025
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 72 (1) , 45
An extended matrix splitting iteration method for solving the generalized absolute value equation with its applications
- 30 October 2025
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 730, 461-482
Solutions for underdetermined generalized absolute value equations
- 30 October 2025
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 730, 461-482
Solutions for underdetermined generalized absolute value equations
- Open Access
A fixed-time stable dynamical model for solving EVLCPs
A fixed-time stable dynamical system for solving the extended vertical linear complementarity problem (EVLCP) is developed. The system is based on the reformulation of EVLCP as a special case of a new kind of generalized absolute value equations. Some properties of the new kind of generalized absolute value equations are explored which are useful for developing a fixed-time stable dynamical system for solving it. Without using any smoothing technique, we develop a dynamical system for solving the new kind of generalized absolute value equations and prove its fixed-time stability. The model is applicable for solving EVLCP. As two by-products, a new condition which guarantees the unique solvability of EVLCP and a new error bound of EVLCP are given. Numerical results are given to demonstrate our claims.
Open AccessA fixed-time stable dynamical model for solving EVLCPs
A fixed-time stable dynamical system for solving the extended vertical linear complementarity problem (EVLCP) is developed. The system is based on the reformulation of EVLCP as a special case of a new kind of generalized absolute value equations. Some properties of the new kind of generalized absolute value equations are explored which are useful for developing a fixed-time stable dynamical system for solving it. Without using any smoothing technique, we develop a dynamical system for solving the new kind of generalized absolute value equations and prove its fixed-time stability. The model is applicable for solving EVLCP. As two by-products, a new condition which guarantees the unique solvability of EVLCP and a new error bound of EVLCP are given. Numerical results are given to demonstrate our claims.
- Open Access
A generalization of the Gauss-Seidel iteration method for generalized absolute value equations
A parameter-free method, namely the generalization of the Gauss-Seidel (GGS) method, is developed to solve generalized absolute value equations. Convergence of the proposed method is analyzed. Numerical results are given to demonstrate the effectiveness and efficiency of the GGS method. Some results in the recent work of Edalatpour et al. \cite{edhs2017} are extended.
Open AccessA generalization of the Gauss-Seidel iteration method for generalized absolute value equations
A parameter-free method, namely the generalization of the Gauss-Seidel (GGS) method, is developed to solve generalized absolute value equations. Convergence of the proposed method is analyzed. Numerical results are given to demonstrate the effectiveness and efficiency of the GGS method. Some results in the recent work of Edalatpour et al. \cite{edhs2017} are extended.
- 30 January 2025
- Published by Elsevier in Applied Mathematics Letters
- Vol. 164
A monotone block coordinate descent method for solving absolute value equations
- 30 January 2025
- Published by Elsevier in Applied Mathematics Letters
- Vol. 164
A monotone block coordinate descent method for solving absolute value equations
- Open Access
SOR-like iteration and FPI are consistent when they are equipped with certain optimal iterative parameters
Two common methods for solving absolute value equations (AVE) are SOR-like iteration method and fixed point iteration (FPI) method. In this paper, novel convergence analysis, which result wider convergence range, of the SOR-like iteration and the FPI are given. Based on the new analysis, a new optimal iterative parameter with a analytical form is obtained for the SOR-like iteration. In addition, an optimal iterative parameter with a analytical form is also obtained for FPI. Surprisingly, the SOR-like iteration and the FPI are the same whenever they are equipped with our optimal iterative parameters. As a by product, we give two new constructive proof for a well known sufficient condition such that AVE has a unique solution for any right hand side. Numerical results demonstrate our claims.
Open AccessSOR-like iteration and FPI are consistent when they are equipped with certain optimal iterative parameters
Two common methods for solving absolute value equations (AVE) are SOR-like iteration method and fixed point iteration (FPI) method. In this paper, novel convergence analysis, which result wider convergence range, of the SOR-like iteration and the FPI are given. Based on the new analysis, a new optimal iterative parameter with a analytical form is obtained for the SOR-like iteration. In addition, an optimal iterative parameter with a analytical form is also obtained for FPI. Surprisingly, the SOR-like iteration and the FPI are the same whenever they are equipped with our optimal iterative parameters. As a by product, we give two new constructive proof for a well known sufficient condition such that AVE has a unique solution for any right hand side. Numerical results demonstrate our claims.
- Open Access
A monotone block coordinate descent method for solving absolute value equations
In this paper, we proposed a monotone block coordinate descent method for solving absolute value equation (AVE). Under appropriate conditions, we analyzed the global convergence of the algorithm and conduct numerical experiments to demonstrate its feasibility and effectiveness.
Open AccessA monotone block coordinate descent method for solving absolute value equations
In this paper, we proposed a monotone block coordinate descent method for solving absolute value equation (AVE). Under appropriate conditions, we analyzed the global convergence of the algorithm and conduct numerical experiments to demonstrate its feasibility and effectiveness.