article · IEEE Transactions on Network Science and Engineering · 2024

Online Distributed Optimization With Nonconvex Objective Functions Under Unbalanced Digraphs: Dynamic Regret Analysis

Cited by 4Abstract and details only

Abstract

In this paper, the problem of online distributed optimization subject to a convex set is studied by employing a network of agents. Each agent's objective function is time-varying and nonconvex and the agents exchange information with their neighbors through a time-varying directed graph. Particularly, here the graph is not assumed to be balanced. To handle this problem, an online distributed algorithm is proposed based on the projection-free strategy and the push-sum protocol. The algorithm's performance is measured using dynamic regrets whose offline benchmark is to find a stationary point of the objective function at each time. Under mild assumptions on the graph and objective functions, we prove that if the deviation of the objective function sequence is sublinear with the square root of the time horizon, and the deviation of the objective function gradient sequence is sublinear with the time horizon, then the dynamic regret increases sublinearly. Finally, simulation experiments are presented to verify the effectiveness of the theoretical results.

Cite this paper

APA 7

Qin, Y., Lu, K., & Wang, H. (2024). Online Distributed Optimization With Nonconvex Objective Functions Under Unbalanced Digraphs: Dynamic Regret Analysis. IEEE Transactions on Network Science and Engineering, 11(5), 4241–4251. https://doi.org/10.1109/tnse.2024.3409061

MLA 9

Qin, Yanfu, et al. “Online Distributed Optimization With Nonconvex Objective Functions Under Unbalanced Digraphs: Dynamic Regret Analysis.” IEEE Transactions on Network Science and Engineering, vol. 11, no. 5, 2024, pp. 4241–51, https://doi.org/10.1109/tnse.2024.3409061.

Chicago

Qin, Yanfu, Kaihong Lu, and Hongxia Wang. 2024. “Online Distributed Optimization With Nonconvex Objective Functions Under Unbalanced Digraphs: Dynamic Regret Analysis.” IEEE Transactions on Network Science and Engineering 11 (5): 4241–51. https://doi.org/10.1109/tnse.2024.3409061.

Harvard

Qin, Y., Lu, K. and Wang, H. (2024) ‘Online Distributed Optimization With Nonconvex Objective Functions Under Unbalanced Digraphs: Dynamic Regret Analysis’, IEEE Transactions on Network Science and Engineering, 11(5), pp. 4241–4251. Available at: https://doi.org/10.1109/tnse.2024.3409061.

BibTeX

@article{qin2024online,
  title = {{Online Distributed Optimization With Nonconvex Objective Functions Under Unbalanced Digraphs: Dynamic Regret Analysis}},
  author = {Qin, Yanfu and Lu, Kaihong and Wang, Hongxia},
  journal = {IEEE Transactions on Network Science and Engineering},
  volume = {11},
  number = {5},
  pages = {4241--4251},
  year = {2024},
  doi = {10.1109/tnse.2024.3409061}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.