A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 31678798.
- Also identified by DOI 10.1016/j.neunet.2019.10.008.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
In this paper, an algorithm based on collective neurodynamic system is investigated for distributed constrained convex optimization, whose objective function is a sum of smooth convex functions and non-smooth L<sub>1</sub>-norm functions. Inspired by recent advances in distributed convex optimization, the continuous-time and discrete-time distributed optimization algorithms described by collective neurodynamic systems are proposed. In the systems, each of the smooth objective functions is allocated to each node as well as each of the L<sub>1</sub>-norm functions. However, the L<sub>1</sub>-norm functions are realized by projection operators. Meanwhile, each node satisfies the local linear and bound constraints. Then a connected network is constituted from all the nodes with consensus to find the optimal solutions.
Medical subject headings
- Neural Networks, Computer