19,802 research outputs found
A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming
In this paper we deal with a network of agents seeking to solve in a
distributed way Mixed-Integer Linear Programs (MILPs) with a coupling
constraint (modeling a limited shared resource) and local constraints. MILPs
are NP-hard problems and several challenges arise in a distributed framework,
so that looking for suboptimal solutions is of interest. To achieve this goal,
the presence of a linear coupling calls for tailored decomposition approaches.
We propose a fully distributed algorithm based on a primal decomposition
approach and a suitable tightening of the coupling constraints. Agents
repeatedly update local allocation vectors, which converge to an optimal
resource allocation of an approximate version of the original problem. Based on
such allocation vectors, agents are able to (locally) compute a mixed-integer
solution, which is guaranteed to be feasible after a sufficiently large time.
Asymptotic and finite-time suboptimality bounds are established for the
computed solution. Numerical simulations highlight the efficacy of the proposed
methodology.Comment: 57th IEEE Conference on Decision and Contro
Rate analysis of inexact dual first order methods: Application to distributed MPC for network systems
In this paper we propose and analyze two dual methods based on inexact
gradient information and averaging that generate approximate primal solutions
for smooth convex optimization problems. The complicating constraints are moved
into the cost using the Lagrange multipliers. The dual problem is solved by
inexact first order methods based on approximate gradients and we prove
sublinear rate of convergence for these methods. In particular, we provide, for
the first time, estimates on the primal feasibility violation and primal and
dual suboptimality of the generated approximate primal and dual solutions.
Moreover, we solve approximately the inner problems with a parallel coordinate
descent algorithm and we show that it has linear convergence rate. In our
analysis we rely on the Lipschitz property of the dual function and inexact
dual gradients. Further, we apply these methods to distributed model predictive
control for network systems. By tightening the complicating constraints we are
also able to ensure the primal feasibility of the approximate solutions
generated by the proposed algorithms. We obtain a distributed control strategy
that has the following features: state and input constraints are satisfied,
stability of the plant is guaranteed, whilst the number of iterations for the
suboptimal solution can be precisely determined.Comment: 26 pages, 2 figure
- …