This technical note proposes a decentralized-partial-consensus optimization (DPCO) problem with inequality constraints. The partial-consensus matrix originating from the Laplacian matrix is constructed to tackle the partial-consensus constraints. A continuous-time algorithm based on multiple interconnected recurrent neural networks (RNNs) is derived to solve the optimization problem. In addition, based on nonsmooth analysis and Lyapunov theory, the convergence of continuous-time algorithm is further proved. Finally, several examples demonstrate the effectiveness of main results.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1109/TNNLS.2021.3098668 | DOI Listing |
Publication Analysis
Top Keywords
continuous-time algorithm
8
rnn-based algorithm
4
algorithm decentralized-partial-consensus
4
decentralized-partial-consensus constrained
4
constrained optimization
4
optimization technical
4
technical note
4
note proposes
4
proposes decentralized-partial-consensus
4
decentralized-partial-consensus optimization
4
Similar Publications
Want AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!