Distributed Randomized Gradient-Free Optimization Protocol of Multiagent Systems Over Weight-Unbalanced Digraphs

In this paper, a distributed randomized gradient-free optimization protocol of multiagent systems over weight-unbalanced digraphs described by row-stochastic matrices is proposed to solve a distributed constrained convex optimization problem. Each agent possesses its local nonsmooth, but Lipschitz c...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on cybernetics 2021-01, Vol.51 (1), p.473-482
Main Authors: Wang, Dong, Yin, Jianjie, Wang, Wei
Format: Article
Language:English
Subjects:
Algorithms
Approximation algorithms
Computational geometry
Constraints
Continuity (mathematics)
Convergence
Convexity
Cost function
Diminishing step size
distributed optimization
Graph theory
Multi-agent systems
Multiagent systems
Nickel
Optimization
Protocols
randomized gradient-free
State estimation
Unbalance
Weight
weight-unbalanced digraph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a distributed randomized gradient-free optimization protocol of multiagent systems over weight-unbalanced digraphs described by row-stochastic matrices is proposed to solve a distributed constrained convex optimization problem. Each agent possesses its local nonsmooth, but Lipschitz continuous, objective function and assigns the weight to information gathered from in-neighbor agents to update its decision state estimation, which is applicable and straightforward to implement. In addition, our algorithm relaxes the requirements of diminishing step sizes to only a nonsummable condition under convex bounded constraint sets. The boundedness and ultimate limit, instead of the supermartingale convergence theorem, are utilized to analyze the consistency and convergence and demonstrate convergence rates with different step sizes. Finally, the validity of the proposed algorithm is verified through numerical examples.
ISSN:2168-2267
2168-2275
DOI:10.1109/TCYB.2018.2890140