Cuijuan Zhang

Cuijuan Zhang

Auto-generated profile, based on publicly available information

Cuijuan Zhang

Chongqing Key Laboratory of Image Cognition, Chongqing University of Posts and Telecommunications, Chongqing, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 April 2024 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
CZCuijuan Zhang
Cuijuan Zhang
LJLianghao Ji
Lianghao Ji
SYShasha Yang
Shasha Yang
XGXing Guo
Xing Guo
JLJun Li
Jun Li
HLHuaqing Li
Huaqing Li

1 July 2019 in Circuits, Systems, and Signal Processing
Verified
Journal Article
Closed access
PDF file
CZCui-Juan Zhang
Cui-Juan Zhang

15 November 2024 in Neurocomputing
Verified
Journal Article
Closed access
CZCuijuan Zhang
Cuijuan Zhang
LJLianghao Ji
Lianghao Ji
SYShasha Yang
Shasha Yang
XGXing Guo
Xing Guo
HLHuaqing Li
Huaqing Li

4 February 2026 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
JLJun Li
Jun Li
HLHuaqing Li
Huaqing Li
LZLifeng Zheng
Lifeng Zheng
LRLiang Ran
Liang Ran
LJLianghao Ji
Lianghao Ji
CZCuijuan Zhang
Cuijuan Zhang
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.