T. T. Chang

Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems

2023 · arXiv (Cornell University)

This paper addresses safe distributed online optimization over an unknown set of linear safety constraints. A network of agents aims at jointly minimizing a global, time-varying function, which is only partially observable to each individual …