Distributed Online Optimization With Long-Term Constraints

In this article, we consider distributed online convex optimization problems, where the distributed system consists of various computing units connected through a time-varying communication graph. In each time step, each computing unit selects a constrained vector, experiences a loss equal to an arb...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on automatic control Ročník 67; číslo 3; s. 1089 - 1104
Hlavní autoři:	Yuan, Deming, Proutiere, Alexandre, Shi, Guodong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.03.2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Absolute constraint violation Algorithms Communication graphs Computational geometry Computer networks Constraint violation Constraints Convex functions Convex optimization Convexity Cumulative constraints Decentralized algorithms Distributed algorithms Distributed computer systems Distributed database systems Distributed online convex optimization distributed online convex optimization (DOCO) Distributed systems Functions long-term constraints longterm constraints one-point bandit feedback Online convex optimizations Online optimization Optimization regret Robots State-of-the-art algorithms Time-varying systems Unsolicited e-mail Upper bound Upper bounds
ISSN:	0018-9286, 1558-2523, 1558-2523
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!