Constraint Coupled Distributed Optimization: a Relaxation and Duality Approach

11/25/2017
by   Ivano Notarnicola, et al.
0

In this paper we consider a distributed optimization scenario in which agents of a network want to minimize the sum of local convex cost functions, each one depending on a local variable, subject to convex local and coupling constraints, with the latter involving all the decision variables. 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 finds a primal-dual optimal solution pair of a local, relaxed version of the original problem, and then linearly updates other dual variables. We prove that agents' estimates asymptotically converge to an optimal solution of the given problem, namely to a point satisfying both local and coupling constraints and having optimal cost. This primal recovery property is obtained without any averaging mechanism typically used in dual methods. To corroborate the theoretical results, we show how the methodology applies to an instance of a Distributed Model Predictive Control scheme in a microgrid control scenario.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/15/2020

A Multi-Agent Primal-Dual Strategy for Composite Optimization over Distributed Features

This work studies multi-agent sharing optimization problems with the obj...
research
10/30/2019

Duality and Stability in Complex Multiagent State-Dependent Network Dynamics

Many of the current challenges in science and engineering are related to...
research
02/26/2021

Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums

We study structured nonsmooth convex finite-sum optimization that appear...
research
11/12/2021

Faster Primal-Dual Convergence for Min-Max Resource Sharing and Stronger Bounds via Local Weak Duality

We revisit the (block-angular) min-max resource sharing problem, which i...
research
11/30/2017

Improved Linear Embeddings via Lagrange Duality

Near isometric orthogonal embeddings to lower dimensions are a fundament...
research
09/23/2019

Persuasion and Incentives Through the Lens of Duality

Lagrangian duality underlies both classical and modern mechanism design....
research
06/30/2011

Dual Modelling of Permutation and Injection Problems

When writing a constraint program, we have to choose which variables sho...

Please sign up or login with your details

Forgot password? Click here to reset