Robust Distributed Linear Programming

This paper presents a robust, distributed algorithm to solve general linear programs. The algorithm design builds on the characterization of the solutions of the linear program as saddle points of a modified Lagrangian function. We show that the resulting continuous-time saddle-point algorithm is provably correct but, in general, not distributed because of a global parameter associated with the nonsmooth exact penalty function employed to encode the inequality constraints of the linear program. This motivates the design of a discontinuous saddle-point dynamics that, while enjoying the same convergence guarantees, is fully distributed and scalable with the dimension of the solution vector. We also characterize the robustness against disturbances and link failures of the proposed dynamics. Specifically, we show that it is integral-input-to-state stable but not input-to-state stable. The latter fact is a consequence of a more general result, that we also establish, which states that no algorithmic solution for linear programming is input-to-state stable when uncertainty in the problem data affects the dynamics as a disturbance. Our results allow us to establish the resilience of the proposed distributed dynamics to disturbances of finite variation and recurrently disconnected communication among the agents. Simulations in an optimal control application illustrate the results.

[1]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[2]  Jochen Könemann,et al.  Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems , 2007, SIAM J. Comput..

[3]  George B. Dantzig,et al.  Linear Programming 1: Introduction , 1997 .

[4]  B. V. Dean,et al.  Studies in Linear and Non-Linear Programming. , 1959 .

[5]  P. Samuelson,et al.  Linear Programming & Economic Analysis , 1958 .

[6]  D. R. Kuehn,et al.  The Application of Linear Programming Techniques in Process Control , 1964, IEEE Transactions on Applications and Industry.

[7]  Dimitri P. Bertsekas,et al.  Convex Analysis and Optimization , 2003 .

[8]  H. Kushner,et al.  Stochastic Approximation and Recursive Algorithms and Applications , 2003 .

[9]  Magnus Egerstedt,et al.  Role-Assignment in Multi-Agent Coordination , 2006 .

[10]  B. V. Dean,et al.  Studies in Linear and Non-Linear Programming. , 1959 .

[11]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[12]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[13]  Giuseppe Notarstefano,et al.  Distributed Abstract Optimization via Constraints Consensus: Theory and Applications , 2011, IEEE Transactions on Automatic Control.

[14]  Frank Dürr,et al.  Exact convex formulations of network-oriented optimal operator placement , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[15]  Chaohong Cai,et al.  Smooth Lyapunov Functions for Hybrid Systems Part II: (Pre)Asymptotically Stable Compact Sets , 2008, IEEE Transactions on Automatic Control.

[16]  W. Rudin Principles of mathematical analysis , 1964 .

[17]  J. Cortés Discontinuous dynamical systems , 2008, IEEE Control Systems.

[18]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[19]  W. Sharpe A Linear Programming Algorithm for Mutual Fund Portfolio Selection , 1967 .

[20]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[21]  Roger J.-B. Wets,et al.  On the continuity of the value of a linear program and of related polyhedral-valued multifunctions , 1982 .

[22]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[23]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[24]  Zdenek Hanzálek,et al.  Optimal flow routing in multi-hop sensor networks with real-time constraints through linear programming. , 2007, 2007 IEEE Conference on Emerging Technologies and Factory Automation (EFTA 2007).

[25]  Ion Necoara,et al.  Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC , 2013, SIAM J. Control. Optim..

[26]  Jing Wang,et al.  A control perspective for centralized and distributed convex optimization , 2011, IEEE Conference on Decision and Control and European Control Conference.

[27]  David Angeli,et al.  A characterization of integral input-to-state stability , 2000, IEEE Trans. Autom. Control..

[28]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[29]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[30]  F. Clarke Optimization And Nonsmooth Analysis , 1983 .

[31]  Ruggero Carli,et al.  Distributed partition-based optimization via dual decomposition , 2013, 52nd IEEE Conference on Decision and Control.

[32]  Eduardo Sontag Comments on integral variants of ISS , 1998 .

[33]  Giuseppe Notarstefano,et al.  A distributed simplex algorithm for degenerate linear programs and multi-agent assignments , 2012, Autom..

[34]  Fernando Paganini,et al.  Stability of primal-dual gradient dynamics and applications to network optimization , 2010, Autom..

[35]  Ruggero Carli,et al.  Multi-agent perimeter patrolling subject to mobility constraints , 2012, 2012 American Control Conference (ACC).

[36]  Sonia Martínez,et al.  On Distributed Convex Optimization Under Inequality and Equality Constraints , 2010, IEEE Transactions on Automatic Control.

[37]  I. Necoara,et al.  Rate analysis of inexact dual first order methods: Application to distributed MPC for network systems , 2013, 1302.3129.

[38]  Constantine Caramanis,et al.  Theory and Applications of Robust Optimization , 2010, SIAM Rev..

[39]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[40]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[41]  Eduardo Sontag Further facts about input to state stabilization , 1990 .

[42]  Johan A. K. Suykens,et al.  Application of a Smoothing Technique to Decomposition in Convex Optimization , 2008, IEEE Transactions on Automatic Control.

[43]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.