Scholarlink

<p>We present a hybrid systems framework for distributed multi-agent optimization in which agents execute computations in continuous time and communicate in discrete time. The optimization algorithm is analogous to a continuous-time form of parallelized coordinate descent. Agents implement an update-and-hold strategy in which gradients are computed at communication times and held constant during flows between communications. The completeness of solutions under these hybrid dynamics is established. Then, we prove that this system is globally exponentially stable to a minimizer of a possibly nonconvex, smooth objective function that satisfies the Polyak-Łojasiewicz (PL) condition. Simulation results are presented for three different applications and illustrate the convergence rates and the impact of initial conditions upon convergence.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Distributed Nonconvex Optimization with Exponential Convergence Rate via Hybrid Systems Methods

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年4月3日

查看全文
  • Katherine R. Hendrickson,
  • Dawn M. Hustig-Schultz,
  • Matthew T. Hale,
  • Ricardo G. Sanfelice

摘要

We present a hybrid systems framework for distributed multi-agent optimization in which agents execute computations in continuous time and communicate in discrete time. The optimization algorithm is analogous to a continuous-time form of parallelized coordinate descent. Agents implement an update-and-hold strategy in which gradients are computed at communication times and held constant during flows between communications. The completeness of solutions under these hybrid dynamics is established. Then, we prove that this system is globally exponentially stable to a minimizer of a possibly nonconvex, smooth objective function that satisfies the Polyak-Łojasiewicz (PL) condition. Simulation results are presented for three different applications and illustrate the convergence rates and the impact of initial conditions upon convergence.