Tracking-ADMM for distributed constraint-coupled optimization
From MaRDI portal
Abstract: We consider constraint-coupled optimization problems in which agents of a network aim to cooperatively minimize the sum of local objective functions subject to individual constraints and a common linear coupling constraint. We propose a novel optimization algorithm that embeds a dynamic average consensus protocol in the parallel Alternating Direction Method of Multipliers (ADMM) to design a fully distributed scheme for the considered set-up. The dynamic average mechanism allows agents to track the time-varying coupling constraint violation (at the current solution estimates). The tracked version of the constraint violation is then used to update local dual variables in a consensus-based scheme mimicking a parallel ADMM step. Under convexity, we prove that all limit points of the agents' primal solution estimates form an optimal solution of the constraint-coupled (primal) problem. The result is proved by means of a Lyapunov-based analysis simultaneously showing consensus of the dual estimates to a dual optimal solution, convergence of the tracking scheme and asymptotic optimality of primal iterates. A numerical study on optimal charging schedule of plug-in electric vehicles corroborates the theoretical results.
Recommendations
- Distributed decision-coupled constrained optimization via proximal-tracking
- Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints
- A novel bound on the convergence rate of ADMM for distributed optimization
- Distributed stochastic gradient tracking methods
- Distributed Optimization With Coupling Constraints
- Distributed Gradient Tracking for Unbalanced Optimization With Different Constraint Sets
- Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization
- Adaptive Penalty-Based Distributed Stochastic Convex Optimization
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- Distributed Global Optimization for a Class of Nonconvex Optimization With Coupled Constraints
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- ADD-OPT: Accelerated Distributed Directed Optimization
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- Constrained Consensus and Optimization in Multi-Agent Networks
- Constraint-Coupled Distributed Optimization: A Relaxation and Duality Approach
- Convergence Rate of Distributed ADMM Over Networks
- Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
- Convergent prediction-correction-based ADMM for multi-block separable convex programming
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- Decentralized Dynamic Optimization Through the Alternating Direction Method of Multipliers
- Discrete-time dynamic average consensus
- Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
- Distributed Model Predictive Control of linear discrete-time systems with local and global constraints
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Saddle-Point Subgradient Algorithms With Laplacian Averaging
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed constrained optimization and consensus in uncertain networks via proximal minimization
- Distributed constrained optimization for multi-agent networks with nonsmooth objective functions
- Distributed optimal in-network resource allocation algorithm design via a control theoretic approach
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
- Fast Distributed Gradient Methods
- Harnessing Smoothness to Accelerate Distributed Optimization
- Interior-point Lagrangian decomposition method for separable convex optimization
- Linear Convergence Rate of a Class of Distributed Augmented Lagrangian Algorithms
- Newton-Raphson Consensus for Distributed Convex Optimization
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Primal recovery from consensus-based dual decomposition for distributed convex optimization
- Tutorial on Dynamic Average Consensus: The Problem, Its Applications, and the Algorithms
Cited in
(27)- Distributed safe control design and probabilistic safety verification for multi-agent systems
- Decentralized Gradient Descent Maximization Method for Composite Nonconvex Strongly-Concave Minimax Problems
- Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation
- Passivity-based analysis of the ADMM algorithm for constraint-coupled optimization
- Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm
- Distributed Personalized Gradient Tracking With Convex Parametric Models
- A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees
- Distributed primal-dual method on unbalanced digraphs with row stochasticity
- Repetitive control tools for an original approach to convex optimization problems under affine periodic constraints
- Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs
- Momentum-based distributed resource scheduling optimization subject to sector-bound nonlinearity and latency
- Proximal ADMM for nonconvex and nonsmooth optimization
- Nash equilibrium seeking in full-potential population games under capacity and migration constraints
- Decentralized convex optimization under affine constraints for power systems control
- Distributed aggregative optimization with affine coupling constraints
- Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints
- Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches
- Distributed model predictive control for linear systems under communication noise: algorithm, theory and implementation
- Distributed event-triggered algorithm for convex optimization with coupled constraints
- Distributed allocation and resource scheduling algorithms resilient to link failure
- Distributed decision-coupled constrained optimization via proximal-tracking
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Distributed optimization of multi-integrator agent systems with mixed neighbor interactions
- Distributed prediction-correction algorithm for convex optimization with coupled constraints
- Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization
- Distributed continuous-time optimization for convex problems with coupling linear inequality constraints
- Momentum-based distributed gradient tracking algorithms for distributed aggregative optimization over unbalanced directed graphs
This page was built for publication: Tracking-ADMM for distributed constraint-coupled optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184513)
