Distributed Optimization With Local Domains: Applications in MPC and Network Flows
From MaRDI portal
Abstract: In this paper we consider a network with nodes, where each node has exclusive access to a local cost function. Our contribution is a communication-efficient distributed algorithm that finds a vector minimizing the sum of all the functions. We make the additional assumption that the functions have intersecting local domains, i.e., each function depends only on some components of the variable. Consequently, each node is interested in knowing only some components of , not the entire vector. This allows for improvement in communication-efficiency. We apply our algorithm to model predictive control (MPC) and to network flow problems and show, through experiments on large networks, that our proposed algorithm requires less communications to converge than prior algorithms.
Recommendations
- Distributed optimization with arbitrary local solvers
- Distributed Optimization in Networked Systems
- Distributed optimization over networks
- Distributed optimization: advances in theories, methods, and applications
- scientific article; zbMATH DE number 4081262
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Distributed Optimization With Coupling Constraints
- Distributed Optimization for MPC of Linear Networks With Uncertain Dynamics
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
- Distributed optimization with hybrid linear constraints for multi‐agent networks
Cited in
(18)- Local models-an approach to distributed multi-objective optimization
- Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
- Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
- Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm
- Cooperative fixed-time/finite-time distributed robust optimization of multi-agent systems
- A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints
- Exact spectral-like gradient method for distributed optimization
- Partition-based multi-agent optimization in the presence of lossy and asynchronous communication
- A proximal alternating direction method for multi-block coupled convex optimization
- EFIX: exact fixed point methods for distributed optimization
- Convergence of a distributed optimal control coordination method via the small-gain theorem
- Newton-like method with diagonal correction for distributed optimization
- Majorized iPADMM for Nonseparable Convex Minimization Models with Quadratic Coupling Terms
- Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval
- Linear convergence rate analysis of a class of exact first-order distributed methods for weight-balanced time-varying networks and uncoordinated step sizes
- Enhancing strong neighbor-based optimization for distributed model predictive control systems
- Consensus-based Dantzig-Wolfe decomposition
- An expanded analysis of local fractional integral inequalities via generalized \((s, P)\)-convexity
This page was built for publication: Distributed Optimization With Local Domains: Applications in MPC and Network Flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2982693)
