IEEE Transactions on Cybernetics · 2015 · 153 citations · 34 references
ComputingComputer ScienceAlgorithmsDistributed SystemsOptimizationConsensus AlgorithmsConstrained OptimizationConvex OptimizationDistributed AlgorithmsDistributed ComputingDistributed ConsensusConvergence Rate AnalysisDistributed Constraint OptimizationDistributed Convex OptimizationDistributed OptimizationPrimal-dual Algorithms
In this paper, we study the distributed constrained optimization problem where the objective function is the sum of local convex cost functions of distributed nodes in a network, subject to a global inequality constraint. To solve this problem, we propose a consensus-based distributed regularized primal-dual subgradient method. In contrast to the existing methods, most of which require projecting the estimates onto the constraint set at every iteration, only one projection at the last iteration is needed for our proposed method. We establish the convergence of the method by showing that it achieves an O ( K (-1/4) ) convergence rate for general distributed constrained optimization, where K is the iteration counter. Finally, a numerical example is provided to validate the convergence of the propose method.
34
Fast linear iterations for distributed averaging
Lin Xiao, Stephen Boyd · Systems & Control Letters · 2004 · 2.8K citations