Back to Search
Start Over
Randomized Gradient-Free Method for Multiagent Optimization Over Time-Varying Networks.
- Source :
- IEEE Transactions on Neural Networks & Learning Systems; Jun2015, Vol. 26 Issue 6, p1342-1347, 6p
- Publication Year :
- 2015
-
Abstract
- In this brief, we consider the multiagent optimization over a network where multiple agents try to minimize a sum of nonsmooth but Lipschitz continuous functions, subject to a convex state constraint set. The underlying network topology is modeled as time varying. We propose a randomized derivative-free method, where in each update, the random gradient-free oracles are utilized instead of the subgradients (SGs). In contrast to the existing work, we do not require that agents are able to compute the SGs of their objective functions. We establish the convergence of the method to an approximate solution of the multiagent optimization problem within the error level depending on the smoothing parameter and the Lipschitz constant of each agent’s objective function. Finally, a numerical example is provided to demonstrate the effectiveness of the method. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 2162237X
- Volume :
- 26
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Neural Networks & Learning Systems
- Publication Type :
- Periodical
- Accession number :
- 102771729
- Full Text :
- https://doi.org/10.1109/TNNLS.2014.2336806