Distributed Optimization for Smart Cyber-Physical Networks
arXiv:1906.10760 · doi:10.1561/2600000020
Abstract
The presence of embedded electronics and communication capabilities as well as sensing and control in smart devices has given rise to the novel concept of cyber-physical networks, in which agents aim at cooperatively solving complex tasks by local computation and communication. Numerous estimation, learning, decision and control tasks in smart networks involve the solution of large-scale, structured optimization problems in which network agents have only a partial knowledge of the whole problem. Distributed optimization aims at designing local computation and communication rules for the network processors allowing them to cooperatively solve the global optimization problem without relying on any central unit. The purpose of this survey is to provide an introduction to distributed optimization methodologies. Principal approaches, namely (primal) consensus-based, duality-based and constraint exchange methods, are formalized. An analysis of the basic schemes is supplied, and state-of-the-art extensions are reviewed.
References in corpus (15)
- Constrained Consensus
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Diffusion Adaptation Strategies for Distributed Optimization and Learning over Networks
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- Distributed Constrained Optimization by Consensus-Based Primal-Dual Perturbation Method
- D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization
- Distributed Random Projection Algorithm for Convex Optimization
- A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
- Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms with Directed Gossip Communication
- Decentralized Quasi-Newton Methods
- DQM: Decentralized Quadratically Approximated Alternating Direction Method of Multipliers
- A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization
- A Distributed Asynchronous Method of Multipliers for Constrained Nonconvex Optimization
- Distributed Gradient Methods with Variable Number of Working Nodes
- A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming
Cited by in corpus (13)
- Multi-Robot Pickup and Delivery via Distributed Resource Allocation
- ChoiRbot: A ROS 2 Toolbox for Cooperative Robotics
- DISROPT: a Python Framework for Distributed Optimization
- Recurrent Averaging Inequalities in Multi-Agent Control and Social Dynamics Modeling
- ADMM-Tracking Gradient for Distributed Optimization over Asynchronous and Unreliable Networks
- Robust Online Learning over Networks
- Distributed Safe Control Design and Probabilistic Safety Verification for Multi-Agent Systems
- Online Distributed Learning with Quantized Finite-Time Coordination
- Distributed Optimization Over Markovian Switching Random Network
- A Distributed Methodology for Approximate Uniform Global Minimum Sharing
- Multi-Agent Optimization and Learning: A Non-Expansive Operators Perspective
- Asynchronous Distributed Learning with Quantized Finite-Time Coordination
- Constraint-coupled Optimization with Unknown Costs: A Distributed Primal Decomposition Approach