Cuijuan Zhang
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
Cuijuan Zhang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Huaqing Li
Southwest University
2 shared publications - Jun Li
Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing, College of Electronic and Information Engineering, Southwest University, Chongqing, China
2 shared publications - Lianghao Ji
Chongqing University of Posts and Telecommunications
2 shared publications - Xing Guo
School of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, China
2 shared publications Huaqing Li
1 shared publication- Liang Ran
Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing, College of Electronic and Information Engineering, Southwest University, Chongqing, China
1 shared publication
Latest Publications
- 4 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 14 (1) , 254-271
Distributed Generalized Aggregative Equilibrium Seeking via Inexact Krasnosel’skii-Mann Iteration Over Time-Varying Communication Graphs
This paper investigates the generalized aggregative equilibrium (GAE) under globally-shared affine coupling constraints within the context of aggregative games involving a collective of agents. Specifically, the study is centered on a non-smooth composite game scenario, wherein each agent possesses a local Lipschitz-differentiable function coupled with a lower semi-continuous function. Utilizing the operator splitting technique, the dynamic tracking method and the successive approximation theorem, we progressively formulate three GAE seeking algorithms from requiring full decision information to partial decision information. These algorithms leverage the local, time-varying communication framework and the deployment of splitting operators characterized by maximal monotone, alleviate the stringent requirement for strongly monotone. By employing the inexact Krasnosel'skii-Mann (KM) iteration and the aggregation invariance, we derive strict bounds on the non-vanishing iterative steps, establishing convergence toward the variational GAE (v-GAE). Finally, the effectiveness and superiority of the proposed algorithms are demonstrated through their application to the time-varying networked Nash-Cournot game model.
- 4 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Emerging Topics in Computing
- Vol. 14 (1) , 254-271
Distributed Generalized Aggregative Equilibrium Seeking via Inexact Krasnosel’skii-Mann Iteration Over Time-Varying Communication Graphs
This paper investigates the generalized aggregative equilibrium (GAE) under globally-shared affine coupling constraints within the context of aggregative games involving a collective of agents. Specifically, the study is centered on a non-smooth composite game scenario, wherein each agent possesses a local Lipschitz-differentiable function coupled with a lower semi-continuous function. Utilizing the operator splitting technique, the dynamic tracking method and the successive approximation theorem, we progressively formulate three GAE seeking algorithms from requiring full decision information to partial decision information. These algorithms leverage the local, time-varying communication framework and the deployment of splitting operators characterized by maximal monotone, alleviate the stringent requirement for strongly monotone. By employing the inexact Krasnosel'skii-Mann (KM) iteration and the aggregation invariance, we derive strict bounds on the non-vanishing iterative steps, establishing convergence toward the variational GAE (v-GAE). Finally, the effectiveness and superiority of the proposed algorithms are demonstrated through their application to the time-varying networked Nash-Cournot game model.
- 15 November 2024
- Published by Elsevier in Neurocomputing
- Vol. 615
Data-driven distributed output consensus control for multi-agent systems with unknown internal state
- 15 November 2024
- Published by Elsevier in Neurocomputing
- Vol. 615
Data-driven distributed output consensus control for multi-agent systems with unknown internal state
- 24 April 2024
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 112 (12) , 10095-10108
Time-varying formation optimization tracking of multi-agent systems with semi-Markov switching topology
- 24 April 2024
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 112 (12) , 10095-10108
Time-varying formation optimization tracking of multi-agent systems with semi-Markov switching topology
- 1 July 2019
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 39 (1) , 492-501
An Orthogonal Matching Pursuit Algorithm Based on Singular Value Decomposition
- 1 July 2019
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 39 (1) , 492-501
An Orthogonal Matching Pursuit Algorithm Based on Singular Value Decomposition