Online Distributed Optimization With Nonconvex Objective Functions Via Dynamic Regrets

In this paper, the problem of online distributed optimization subject to a convex set is studied by employing a network of agents, where the objective functions allocated to agents are nonconvex. Each agent only has access to its own objective function information at the previous time, and can only...

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on automatic control Ročník 68; číslo 11; s. 1 - 16
Hlavní autoři:	Lu, Kaihong, Wang, Long
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.11.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Benchmark testing Convexity Deviation Distributed algorithms Dynamic regrets Graph theory Heuristic algorithms Linear programming Mirrors multi-agent networks nonconvex optimization online distributed optimization Optimization Power system dynamics
ISSN:	0018-9286, 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!