Metraipolis › archive › dc_46fcea01b45f

Adding Heavy-Ball Momentum to Distributed Constrained Optimization for Energy Resource Management Subject to Time-Delays and Quantization — arXiv:2610.24421

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.24421
License (as archived)
CC0-1.0
Archived
2026-10-20T11:41:02.107Z
SHA-256 of the archived text
095233294eea52f501eafb88ebac2783d194e6ddcff95fef9e44557e590a3fdc
Stable URL of this page
https://metraipolis.com/documento/dc_46fcea01b45f

How to cite

Adding Heavy-Ball Momentum to Distributed Constrained Optimization for Energy Resource Management Subject to Time-Delays and Quantization — arXiv:2610.24421 — arXiv (en), https://arxiv.org/abs/2610.24421 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_46fcea01b45f (Metraipolis archive dc_46fcea01b45f, sha256 095233294eea52f501eafb88ebac2783d194e6ddcff95fef9e44557e590a3fdc)
BibTeX
@misc{dc46fcea01b45f,
  title = {Adding Heavy-Ball Momentum to Distributed Constrained Optimization for Energy Resource Management Subject to Time-Delays and Quantization — arXiv:2610.24421},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.24421},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_46fcea01b45f; sha256 095233294eea52f501eafb88ebac2783d194e6ddcff95fef9e44557e590a3fdc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.24421. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper studies a hybrid discrete-time signed gradient-consensus method with heavy-ball momentum, paired communication delays, and fixed logarithmic quantization. The method preserves the aggregate supply-demand equality at every iteration. For a static connected undirected graph and bounded delays, a Lyapunov-Krasovskii analysis establishes practical stability by isolating the discontinuous quantization error as an additive disturbance and closing a computable invariant-sublevel argument. The resulting ergodic residual bound is quadratic in the quantization resolution, and exact convergence to the smooth penalized equality-constrained optimizer is recovered in the unquantized case. For delay-free unquantized quadratic costs, an exact modal analysis identifies the heavy-ball stability region and optimal parameters, with the predicted rate validated on a fixed sparse network. A reproducible delayed experiment reports all constants and a certificate whose guaranteed steady-state level lies below the reported initialization. A separate mixed generator-battery experiment exercises the signed update directly. Finite smooth penalties approximate, but do not generally enforce, the local box constraints exactly.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno).
Categorie arXiv: Systems and Control (eess.SY) ; Distributed, Parallel, and Cluster Computing (cs.DC); Multiagent Systems (cs.MA); Dynamical Systems (math.DS); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.24421 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-20T11:41:00.018Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).