Practical Implementation Issues of Lagrangian Based Distributed Optimization Algorithms
Abstract
In this article, we illustrate practical issues arising in the development of efficient implementation of distributed algorithms that solve a general (concave) constrained maximization problem. Such optimizations arise in many situations. One typical example is those of resource allocation in computer networks, where the system aims at maximizing some global function of the users individual throughput subject to link capacity constraints.