Work

Distributed optimization on random graphs

Year: 2018

Type: article

Abstract: We consider the distributed optimization problem for the sum of convex functions where the underlying communications network connecting agents at each time is drawn at random from a collection of directed graphs. We propose a modified version of the subgradient-push algorithm that is provably almost surely convergent to an optimizer on any such sequence of random directed graphs, establishing the first of this kind.

Source: IFAC-PapersOnLine

DOI: 10.1016/j.ifacol.2018.12.067

Authors: Pouya Rezaeinia, Bahman Gharesifard, Tamas Linder, Behrouz Touri

Institutions: University of British Columbia, Queen's University, University of California San Diego

Language: English

Topic: Distributed Control Multi-Agent Systems

Subfield: Control and Systems Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2903930957

FWCI: 0.253

Cites: 14

Cited by: 7

Related to: 10