A Scaling-Function Approach for Distributed Constrained Optimization in Unbalanced Multiagent Networks

This article aims at developing a scaling-function approach for distributed optimization of unbalanced multiagent networks under convex constraints. The distinguishing feature of the algorithm is that it does not employ agents' out-degree information, nor does it require the estimation of the left eigenvector, corresponding to the zero eigenvalue, of the Laplacian matrix. Existing approaches for unbalanced networks either demand the knowledge on agents' out-degrees, which is impractical in applications, where an agent might not be aware of the detection and employment of its information by other agents, or require every agent to be equipped with a network-sized estimator, causing an additional n(2) storage and communication cost with n being the network size. The results exhibit an inherent connection between the selection of the scaling factor and the convergence property of the algorithm, among other known factors such as the network topology and the boundedness of the subgradients of the local objective functions. Numerical examples are provided to validate the theoretical findings.

Automated summary

This article presents a scaling-function approach for distributed optimization of unbalanced multiagent networks under convex constraints. The algorithm does not require agents' out-degree information or estimation of the left eigenvector of the Laplacian matrix. Numerical examples validate the theoretical findings.