Optimal Design of Distributed Inexact Gradient Tracking: Exact Worst-case Convergence Rate and Explicit Parameters

arXiv:2609.20265 · math.OC, cs.SY, eess.SY · Submitted 2026-07-29 · Read on arXiv

math.OC, cs.SY, eess.SY

Submitted: 2026-07-29

Updated: 2026-07-29

Terminology

• Objective Function — 25× in this paper · explained in 2 episodes
• Adjacency Matrix — 4× in this paper · explained in 1 episode
• Robustness — 3× in this paper · explained in 5 episodes
• American Control Conference — 2× in this paper
• IEEE Conference on Decision and Control — 2× in this paper
• Multi-Agent System — 2× in this paper · explained in 6 episodes
• Adaptation — 1× in this paper · explained in 1 episode
• Cooperation — 1× in this paper · explained in 2 episodes
• Decoupling — 1× in this paper · explained in 2 episodes
• Frequency-Domain Analysis — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification