2012 · 407 citations · 17 references
ComputingComputer ScienceAlgorithmsDistributed SystemsOptimizationConvex OptimizationDistributed AlgorithmsDistributed ComputingDistributed CoordinationGlobal OptimizationUnconstrained OptimizationAlternating Direction Method Of MultipliersDistributed Convex OptimizationDistributed OptimizationDistributed Problem SolvingGradient DescentMulti-agent OptimizationObjective Function Formulation
We consider a network of agents that are cooperatively solving a global unconstrained optimization problem, where the objective function is the sum of privately known local objective functions of the agents. Recent literature on distributed optimization methods for solving this problem focused on subgradient based methods, which typically converge at the rate O (1/√k), where k is the number of iterations. In this paper, k we introduce a new distributed optimization algorithm based on Alternating Direction Method of Multipliers (ADMM), which is a classical method for sequentially decomposing optimization problems with coupled constraints. We show that this algorithm converges at the rate O (1/k).
17