Distributed multi-step subgradient optimization for multi-agent system

This paper proposes a novel multi-step subgradient scheme to solve distributed optimization problem with a balanced digraph. To this end, matrix diameter and radius are first introduced to describe the convergence rate of the adjacency matrix. Then, we propose a hierarchical and recursive observer t...

Full description

Saved in:
Bibliographic Details
Published in:Systems & control letters Vol. 128; pp. 26 - 33
Main Authors: Li, Chaoyong, Chen, Sai, Li, Jianqing, Wang, Feng
Format: Journal Article
Language:English
Published: Elsevier B.V 01.06.2019
Subjects:
ISSN:0167-6911, 1872-7956
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes a novel multi-step subgradient scheme to solve distributed optimization problem with a balanced digraph. To this end, matrix diameter and radius are first introduced to describe the convergence rate of the adjacency matrix. Then, we propose a hierarchical and recursive observer to estimate the desired optimal solution, and we prove that the proposed strategy can asymptotically obtain an optimal solution, while all networked systems achieve a consensus among estimates in a finite-time. Simulation results verified the effectiveness of the proposed algorithm.
ISSN:0167-6911
1872-7956
DOI:10.1016/j.sysconle.2019.04.008