Open Access
2014 Asynchronous Gossip-Based Gradient-Free Method for Multiagent Optimization
Deming Yuan
Abstr. Appl. Anal. 2014(SI63): 1-6 (2014). DOI: 10.1155/2014/618641


This paper considers the constrained multiagent optimization problem. The objective function of the problem is a sum of convex functions, each of which is known by a specific agent only. For solving this problem, we propose an asynchronous distributed method that is based on gradient-free oracles and gossip algorithm. In contrast to the existing work, we do not require that agents be capable of computing the subgradients of their objective functions and coordinating their step size values as well. We prove that with probability 1 the iterates of all agents converge to the same optimal point of the problem, for a diminishing step size.


Download Citation

Deming Yuan. "Asynchronous Gossip-Based Gradient-Free Method for Multiagent Optimization." Abstr. Appl. Anal. 2014 (SI63) 1 - 6, 2014.


Published: 2014
First available in Project Euclid: 6 October 2014

zbMATH: 07022736
MathSciNet: MR3193527
Digital Object Identifier: 10.1155/2014/618641

Rights: Copyright © 2014 Hindawi

Vol.2014 • No. SI63 • 2014
Back to Top