Runyue Fang

Runyue Fang

Auto-generated profile, based on publicly available information

Runyue Fang

School of Mathematics and Big Data Anhui University of Science and Technology Huainan Anhui 232001 China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
19 November 2021 in Asian Journal of Control
Verified
Journal Article
Closed access
PDF file
RFRunyue Fang
Runyue Fang
DLDequan Li
Dequan Li
XSXiuyu Shen
Xiuyu Shen
YZYuejin Zhou
Yuejin Zhou

26 July 2021
Verified
Conference Paper
Closed access
RFRunyue Fang
Runyue Fang
DLDequan Li
Dequan Li
XSXiuyu Shen
Xiuyu Shen
This paper investigates an online convex optimization problem on time-varying directed networks, where each agent holds its own convex cost function and the goal is to cooperatively minimize the sum of the global cost function. To tackle such optimization problems, an accelerated distributed online gradient push-sum algorithm is firstly proposed, which combines the momentum acceleration technique and push-sum strategy. Then, we specifically analyze the regret for the proposed algorithm. The theoretical result shows that the individual regret of the proposed algorithm achieves an improved rate with order of $\mathcal{O}\left( {\sqrt {1 + \log T} } \right)$, where T is the time horizon. Moreover, we implement the proposed algorithm in sensor networks for solving the distributed online estimation problem, and the results demonstrate the effectiveness of the proposed algorithm.