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...

Full description

Bibliographic Details

Published in:	IEEE transactions on automatic control Vol. 68; no. 11; pp. 1 - 16
Main Authors:	Lu, Kaihong, Wang, Long
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!