Randomized Constraints Consensus for Distributed Robust Linear Programming

@article{Chamanbaz2017RandomizedCC,
  title={Randomized Constraints Consensus for Distributed Robust Linear Programming},
  author={Mohammadreza Chamanbaz and Giuseppe Notarstefano and Roland Bouffanais},
  journal={IFAC-PapersOnLine},
  year={2017},
  volume={50},
  pages={4973-4978}
}

Figures from this paper

Randomized Constraints Consensus for Distributed Robust Mixed-Integer Programming

A network of processors aiming at cooperatively solving mixed-integer convex programs subject to uncertainty can stop the algorithm after a finite number of communication rounds so that candidate optimal solutions are consensual.

RandomizedConstraintsConsensus for DistributedRobustMixed-IntegerProgramming 1

It is shown that processors can stop the algorithm after a finite number of communication rounds (either because verification has been successful for a sufficient number of rounds or because a given threshold has been reached), so that candidate optimal solutions are consensual.

Primal Decomposition and Constraint Generation for Asynchronous Distributed Mixed-Integer Linear Programming

This paper reformulates the primal decomposition resource allocation problem as a linear program with an exponential number of unknown constraints and designs a distributed protocol that allows agents to compute an optimal allocation by generating and exchanging only few of the unknown constraints.

Distributed Optimization for Smart Cyber-Physical Networks

The purpose of this survey is to provide an introduction to distributed optimization methodologies, namely (primal) consensus-based, duality-based and constraint exchange methods, and an analysis of the basic schemes is supplied, and state-of-the-art extensions are reviewed.

A Sequential Deep Learning Algorithm for Sampled Mixed-integer Optimisation Problems

This work introduces and analyse two e-cient algorithms with a sequential design that are aimed at dealing with sampled problems within this class and shows that both algorithms exhibit dusk-time convergence towards the optimal solution.

Distributed Motion Tomography for Reconstruction of Flow Fields*

This paper considers a group of mobile sensing agents in a flow field and presents a distributed method for motion tomography (MT) that estimates the underlying flow field by formulating a constrained consensus problem that belongs to a class of projected consensus algorithms.

References

SHOWING 1-10 OF 17 REFERENCES

Distributed Random Convex Programming via Constraints Consensus

A setup in which instances of the random constraints are not held by a single centralized processing unit, but are instead distributed among different nodes of a network, to make all nodes converge to the same solution as the centralized RCP problem.

Distributed Constrained Optimization and Consensus in Uncertain Networks via Proximal Minimization

A scenario-based methodology is followed, allowing agents to use a different set of uncertainty scenarios in their local optimization programs, and an iterative algorithm is developed that allows for the convergence of the resulting scheme to some optimizer of the centralized problem.

Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach

This chapter proposes a parallel computing framework to distributedly solve robust convex optimization (RCO) when the constraints are affected by nonlinear uncertainty by randomly sampling the uncertainty set and shows that if the sequence of digraphs are uniformly jointly strongly connected (UJSC), each node asymptotically converges to a common optimal solution to the SP.

Asynchronous Gossip-Based Random Projection Algorithms Over Networks

A completely decentralized and asynchronous gossip-based random projection (GRP) algorithm that solves the distributed problem using only local communications and computations is proposed and the convergence properties of the algorithm for a diminishing and a constant stepsize which are uncoordinated among agents are analyzed.

Uncertain convex programs: randomized solutions and confidence levels

This paper considers an alternative ‘randomized’ or ‘scenario’ approach for dealing with uncertainty in optimization, based on constraint sampling, and studies the constrained optimization problem resulting by taking into account only a finite set of N constraints, chosen at random among the possible constraint instances of the uncertain problem.

Distributed Random Projection Algorithm for Convex Optimization

A distributed random projection algorithm for constrained convex optimization problems that can be used by multiple agents connected over a time-varying network, where each agent has its own objective function and its own constrained set.

Sequential Randomized Algorithms for Convex Optimization in the Presence of Uncertainty

A rigorous analysis of the theoretical properties of the solutions obtained by new sequential randomized algorithms for convex optimization problems in the presence of uncertainty, for full constraint satisfaction and partial constraint satisfaction, are given.

A Randomized Cutting Plane Method with Probabilistic Geometric Convergence

A randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body that can be implemented using hit-and-run versions of Markov-chain Monte Carlo algorithms is proposed.

Graphs and networks for the analysis of autonomous agent systems

This thesis analyzes two issues related to autonomous agent systems, and more precisely, to the influence of the inter-agent communication network on the system behaviour and studies two paradigmatic systems in which this dependence can be taken into account.