Abstract
This paper considers a category of nonsmooth distributed optimization on multi-agent systems, where agents own privacies and collectively minimize a sum of local cost functions. Taking the restrictions on communication among agents into consideration, a nonautonomous-differential-inclusion neurodynamic approach is proposed over a weighed topology graph. The convergence of neural network is analyzed and its state exponentially converges to an optimal solution of distributed optimization under certain conditions. Since no additional conditions are required to guarantee the convergence, the neural network is superior to distributed algorithms based on penalty method, which need to estimate penalty parameters. Compared with some existed approaches, the neural network has the advantage of possessing fewer state variables. Finally, illustrative examples and an application in distributed quantile regression are delineated to testify the effectiveness of the presented neural network.
| Original language | English |
|---|---|
| Pages (from-to) | 13909-13920 |
| Number of pages | 12 |
| Journal | Neural Computing and Applications |
| Volume | 33 |
| Issue number | 20 |
| DOIs | |
| State | Published - Oct 2021 |
| Externally published | Yes |
Keywords
- Convergence
- Distributed convex optimization
- Multi-agent system
- Neural network
Fingerprint
Dive into the research topics of 'A nonautonomous-differential-inclusion neurodynamic approach for nonsmooth distributed optimization on multi-agent systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver