Distributed Continuous Time Optimization Algorithms over Unbalanced Graphs

This paper investigates two distributed optimization schemes with or without feasible set constraints over unbalanced graphs, respectively. To overcome the inaccuracy convergence problem of unbalanced graphs, we propose two continuous time algorithms with an inexact gradient tracking dynamic. The fi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Chinese Control and Decision Conference S. 3491 - 3495
Hauptverfasser: Cheng, Songsong, Fan, Yuan
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 22.05.2021
Schlagworte:
Continuous time algorithms
Convergence
Distributed optimization
Feasible set constraint
Heuristic algorithms
Optimization
Unbalanced graphs
ISSN:1948-9447
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper investigates two distributed optimization schemes with or without feasible set constraints over unbalanced graphs, respectively. To overcome the inaccuracy convergence problem of unbalanced graphs, we propose two continuous time algorithms with an inexact gradient tracking dynamic. The first one is a distributed optimization algorithm without feasible set constraints and the second one is improved from the first one with feasible set constraints. Moreover, we provide the convergence analyses for the two optimization algorithms.
ISSN:1948-9447
DOI:10.1109/CCDC52312.2021.9602111