A distributed algorithm for random convex programming

We study a distributed approach for solving random convex programs (RCP) for the case in which problem constraints are distributed among nodes in a processor network. We devise a distributed algorithm that allows network nodes to reach consensus on problem solution by exchanging a local set of constraints at each iteration. We prove that the algorithm assures finite-time convergence to problem solution and we provide explicit bounds on the maximum number of constraints to be exchanged among nodes at each communication round. Numerical experiments confirm the theoretical derivation and show that a parallel implementation of the proposed approach speeds-up the solution of the RCP with respect to centralized computation.