Weijian Li

Weijian Li

Auto-generated profile, based on publicly available information

Weijian Li

Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
27 April 2021 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
WLWeijian Li
Weijian Li
XZXianlin Zeng
Xianlin Zeng
SLShu Liang
Shu Liang
Yiguang HongYiguang Hong
Yiguang Hong
We develop an exponentially convergent distributed algorithm to minimize a sum of nonsmooth cost functions with a set constraint. The set constraint generally leads to the nonlinearity in distributed algorithms, and results in difficulties to derive an exponential rate. In this article, we remove the consensus constraints by an exact penalty method, and then propose a distributed projected subgradient algorithm by virtue of a differential inclusion and a differentiated projection operator. Resorting to nonsmooth approaches, we prove the convergence for this algorithm, and moreover, provide both the sublinear and exponential rates under some mild assumptions.

14 February 2023 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
GCGuanpu Chen
Guanpu Chen
GXGehui Xu
Gehui Xu
WLWeijian Li
Weijian Li
Yiguang HongYiguang Hong
Yiguang Hong
To efficiently solve the nonsmooth distributed optimization with both local constraints and coupled constraints, we propose a distributed continuous-time algorithm based on the mirror descent (MD) method. In this article, we introduce the Bregman damping into distributed MD-based dynamics, which not only successfully applies the MD idea to the distributed primal-dual framework, but also ensures the boundedness of all variables and the convergence of the entire dynamics. Our approach generalizes the classic distributed projection-based dynamics, and establishes a connection between MD methods and distributed Euclidean-projected approaches. Also, we prove the convergence of the proposed distributed dynamics with an $ \mathcal {O}(1/t)$ rate. For practical implementation, we further give a discrete-time algorithm based on the proposed dynamics with an $ \mathcal {O}(1/\sqrt{k})$ convergence rate.

9 June 2023 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
WLWeijian Li
Weijian Li
ZCZihan Chen
Zihan Chen
YLYoucheng Lou
Youcheng Lou
Yiguang HongYiguang Hong
Yiguang Hong
A weight-balanced network plays an important role in the exact convergence of distributed optimization algorithms, but is not always satisfied in practice. Different from most of existing works focusing on designing distributed algorithms, we analyze the convergence of a well-known distributed projected subgradient algorithm over time-varying general graph sequences, i.e., the weight matrices of the network are only required to be row stochastic instead of doubly stochastic. We first show that there may exist a graph sequence such that the algorithm is not convergent when the network switches freely within finitely many graphs. Then to guarantee its convergence under any uniformly jointly strongly connected graph sequence, we provide a necessary and sufficient condition on the cost functions, i.e., the intersection of optimal solution sets to all local optimization problems is not empty. Furthermore, we surprisingly find that the algorithm is convergent for any periodically switching graph sequence, but the converged solution minimizes a weighted sum of local cost functions, where the weights depend on the Perron vectors of some product matrices of the underlying switching graphs. Finally, we consider a slightly broader class of quasi-periodically switching graph sequences, and show that the algorithm is convergent for any quasi-periodic graph sequence if and only if the network switches between only two graphs. This work helps us understand impacts of communication networks on the convergence of distributed algorithms, and complements existing results from a different viewpoint.

12 September 2025 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
WLWeijian Li
Weijian Li
XZXianlin Zeng
Xianlin Zeng
LPLacra Pavel
Lacra Pavel
We develop a first-order accelerated algorithm for a class of constrained bilinear saddle-point problems with applications to network systems. The algorithm is a modified time-varying primal-dual version of an accelerated mirror-descent dynamics. It deals with constraints such as simplices and convex set constraints effectively, and converges with a rate of $\mathcal {O}(1/t^{2})$. Furthermore, we employ the acceleration scheme for constrained distributed optimization and bilinear zero-sum games, and obtain two variants of distributed accelerated algorithms.

27 October 2021 in Control Theory and Technology
Verified
Journal Article
Closed access
PDF file
WLWeijian Li
Weijian Li
WDWen Deng
Wen Deng
XZXianlin Zeng
Xianlin Zeng
Yiguang HongYiguang Hong
Yiguang Hong

25 September 2025 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
WLWeijian Li
Weijian Li
LPLacra Pavel
Lacra Pavel
We consider seeking generalized Nash equilibria (GNE) for noncooperative games with coupled nonlinear constraints over networks. We first revisit a well-known gradient-play dynamics from a passivity-based perspective, and address that the strict monotonicity of the pseudo-gradient is a critical assumption to ensure the exact convergence of the dynamics. Then we propose two novel passivity-based gradient-play dynamics by introducing parallel feedforward compensators (PFCs) and output feedback compensators (OFCs). We show that the proposed dynamics can reach exact GNEs in merely monotone regimes if the PFCs are strictly passive or if the OFCs are output strictly passive. Following that, resorting to passivity, we develop a unifying framework to generalize the gradient-play dynamics, and moreover, design a class of explicit dynamics with convergence guarantees. In addition, we explore the relation between the proposed dynamics and some existing methods, and extend our results to partial-decision information settings.