On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
Authors:
- 1 May 2015
- journal article
- Published by Elsevier in Automatica
- Vol. 55, 209-216
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- An $O(1/k)$ Gradient Method for Network Resource Allocation ProblemsIEEE Transactions on Control of Network Systems, 2014
- Rate Analysis of Inexact Dual First-Order Methods Application to Dual DecompositionIEEE Transactions on Automatic Control, 2013
- A class of distributed optimization methods with event-triggered communicationComputational Optimization and Applications, 2013
- Accelerated gradient methods and dual decomposition in distributed model predictive controlAutomatica, 2013
- Parallel and distributed optimization methods for estimation and control in networksJournal of Process Control, 2011
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient MethodsSIAM Journal on Optimization, 2009
- A decentralized solution to the DC-OPF of interconnected power systemsIEEE Transactions on Power Systems, 2003
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex MinimizationMathematics of Operations Research, 1993
- A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality ProblemMathematics of Operations Research, 1987
- Bounds for error in the solution set of a perturbed linear programLinear Algebra and its Applications, 1973