Journal
IFAC PAPERSONLINE
Volume 50, Issue 1, Pages 14326-14331Publisher
ELSEVIER
DOI: 10.1016/j.ifacol.2017.08.1874
Keywords
Optimization and control of large-scale network systems; Large scale optimization problems; Cyber-Physical Systems; Convex optimization; Distributed control and estimation
Categories
Funding
- European Research Council (ERC) under the European Union [638992 - OPT4SMART]
Ask authors/readers for more resources
In this paper we consider a distributed optimization scenario in which a set of agents has to solve a convex optimization problem with separable cost function, local constraint sets and a coupling inequality constraint. We propose a novel distributed algorithm based on a relaxation of the primal problem and an elegant exploration of duality theory. Despite its complex derivation based on several duality steps, the distributed algorithm has a very simple and intuitive structure. That is, each node solves a local version of the original problem relaxation, and updates suitable dual variables. We prove the algorithm correctness and show its effectiveness via numerical computations. (C) 2017, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available