Jun Li

Dr. Jun Li


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
9 February 2024 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
LRLiang Ran
Liang Ran
HLHuaqing Li
Huaqing Li
LZLifeng Zheng
Lifeng Zheng
JLJun Li
Jun Li
ZLZhe Li
Zhe Li
JHJinhui Hu
Jinhui Hu
This paper investigates the generalized Nash equilibria (GNE) seeking problem for noncooperative games, where all players dedicate to selfishly minimizing their own cost functions subject to local constraints and coupled constraints. To tackle the considered problem, we initially form an explicit local equilibrium condition for its variational formulation. By employing proximal splitting operators, a novel distributed primal-dual splitting algorithm with full-decision information (Dist_PDS_FuDeIn) is designed, eliminating the need for global step-sizes. Furthermore, to address scenarios where players lack access to all other players' decisions, a local estimation is introduced to approximate the decision information of other players, and a fully distributed primal-dual splitting algorithm with partial-decision information (Dist_PDS_PaDeIn) is then proposed. Both algorithms enable the derivation of new distributed forward-backward-like extensions. Theoretically, a new analytical approach for convergence is presented, demonstrating that the proposed algorithms converge to the variational GNE of games, and their convergence rates are also proven, provided that uncoordinated step-sizes are positive and less than explicit upper bounds. Moreover, the approach not only generalizes the forward-backward splitting technique but also improves convergence rates of several well-known algorithms. Finally, the advantages of Dist_PDS_FuDeIn and Dist_PDS_PaDeIn are illustrated through comparative simulations.

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

12 July 2023 in IEEE Transactions on Industrial Cyber-Physical Systems
Verified
Journal Article
Open access
JLJun Li
Jun Li
HLHuaqing Li
Huaqing Li
THTingwen Huang
Tingwen Huang
LZLifeng Zheng
Lifeng Zheng
LJLianghao Ji
Lianghao Ji
Shen YinShen Yin
Shen Yin
It is projected that plug-in electric vehicles (PEVs) would steadily increase as household appliances. However, PEVs' high power consumption, stochastic usage patterns, and storage capacity will surely result in a rise in the elasticity of demand response and pose significant difficulties for price-based residential demand response management (PRDRM). This paper aims to optimize a two-tier globally shared nonconvex PRDRM problem with local constraints and PEVs, known as social welfare: maximizing retailer profits and minimizing the combined residential costs. This is done by balancing residential electricity use with retail electricity prices in an unknown market environment. The proposed online/offline model-free reinforcement learning-based economic dispatch (MFRL-ED) methods can adaptively decide on the ideal retail price sequence by integrating the daily residential-retailer behavior model with the agent-environment interaction method, providing a basic MFRL-ED solution for PRDRM without a system identification step and an accurate load-retail model. Experiments show that MFRL-ED methods provide an effective class of PRDRM solutions.

6 August 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
HLHuaqing Li
Huaqing Li
LRLiang Ran
Liang Ran
LZLifeng Zheng
Lifeng Zheng
ZLZhe Li
Zhe Li
JHJinhui Hu
Jinhui Hu
THTingwen Huang
Tingwen Huang
This paper considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the game, we first introduce a new local edge-based equilibrium condition with full information. Considering challenges when communication delays occur, we then devise an asynchronous distributed algorithm to seek a generalized Nash equilibrium. This asynchronous scheme arbitrarily activates one player to start new computations independently at different iteration instants, which means that the picked player can use the involved out-dated information from itself and its neighbors to perform new updates. In theoretical aspect, we provide explicit conditions on algorithm parameters, for instance, the step-sizes to establish a sublinear convergence rate for the synchronous version. Next, the asynchronous algorithm guarantees almost sure convergence in expectation under the same step-size conditions and some standard assumptions. Finally, the viability and performance of the proposed algorithm are demonstrated by numerical studies on the Cournot competition.

9 August 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
LRLiang Ran
Liang Ran
HLHuaqing Li
Huaqing Li
LZLifeng Zheng
Lifeng Zheng
JLJun Li
Jun Li
This paper focuses on a distributed nonsmooth composite optimization problem over a multiagent networked system, in which each agent is equipped with a local Lipschitz-differentiable function and two possibly nonsmooth functions, one of which incorporates a linear mapping. To address this problem, we introduce a synchronous distributed algorithm featuring uncoordinated relaxed factors. It serves as a generalized relaxed version of the recent method TriPD-Dist. Notably, the considered problem in the presence of asynchrony and delays remains relatively unexplored. In response, a new asynchronous distributed primal-dual proximal algorithm is first proposed, rooted in a comprehensive asynchronous model. It is operated under the assumption that agents utilize possibly outdated information from their neighbors, while considering arbitrary, time-varying, yet bounded delays. With some special adjustments, new asynchronous distributed extensions of existing centralized methods are obtained via the proposed asynchronous algorithm. Theoretically, a new convergence analysis technique of the proposed algorithms is provided. Specifically, a sublinear convergence rate is explicitly derived by showcasing that the iteration behaves as a nonexpansive operator. In addition, the proposed asynchronous algorithm converges the optimal solution in expectation under the same step-size conditions as its synchronous counterpart. Finally, numerical studies substantiate the efficacy of the proposed algorithms and validate their performance in practical scenarios.

6 July 2024 in Neurocomputing
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