On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
From MaRDI portal
Publication:1689375
DOI10.1016/j.automatica.2015.02.038zbMath1378.90065arXiv1406.3720OpenAlexW2003085133MaRDI QIDQ1689375
Publication date: 12 January 2018
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.3720
error boundlinear convergencedual decompositiondistributed gradient algorithmseparable convex problems
Related Items (17)
Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation ⋮ Recursive least squares and multi-innovation stochastic gradient parameter estimation methods for signal modeling ⋮ Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs ⋮ Tracking-ADMM for distributed constraint-coupled optimization ⋮ Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches ⋮ Computational complexity certification for dual gradient method: application to embedded MPC ⋮ Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks ⋮ Metric selection in fast dual forward-backward splitting ⋮ Distributed model predictive control -- recursive feasibility under inexact dual optimization ⋮ Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity ⋮ Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC ⋮ Iteration complexity analysis of dual first-order methods for conic convex programming ⋮ An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs ⋮ Proximal ADMM for nonconvex and nonsmooth optimization ⋮ A dual approach for optimal algorithms in distributed optimization over networks ⋮ Decentralized convex optimization under affine constraints for power systems control ⋮ Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
Cites Work
- Accelerated gradient methods and dual decomposition in distributed model predictive control
- A class of distributed optimization methods with event-triggered communication
- Introductory lectures on convex optimization. A basic course.
- Bounds for error in the solution set of a perturbed linear program
- Iteration complexity analysis of dual first-order methods for conic convex programming
- Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems
This page was built for publication: On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
