An Alternating Direction Method for Linear Programming

This paper presents a new, simple, massively parallel algorithm for linear programming, called the alternating step method. The algorithm is unusual in that it does not maintain primal feasibility, dual feasibility, or complementary slackness; rather, all these conditions are gradually met as the method proceeds. We derive the algorithm from an extension of the alternating direction method of multipliers for convex programming, giving a new algorithm for monotropic programming in the course of the development. Concentrating on the linear programming case, we give a proof that, under a simple condition on the algorithm parameters, the method converges at a globally linear rate. Finally, we give some preliminary computational results.

[1]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[2]  D. Klingman,et al.  NETGEN - A Program for Generating Large Scale (Un) Capacitated Assignment, Transportation, and Minim , 1974 .

[3]  R. Glowinski,et al.  Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéaires , 1975 .

[4]  Dimitri P. Bertsekas,et al.  Necessary and sufficient conditions for a penalty method to be exact , 1975, Math. Program..

[5]  R. Rockafellar Monotone Operators and the Proximal Point Algorithm , 1976 .

[6]  B. Mercier,et al.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .

[7]  R. Tyrrell Rockafellar,et al.  Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..

[8]  P. Lions,et al.  Splitting Algorithms for the Sum of Two Nonlinear Operators , 1979 .

[9]  R. Glowinski,et al.  Numerical Analysis of Variational Inequalities , 1981 .

[10]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[11]  M. Fortin,et al.  Augmented Lagrangian methods : applications to the numerical solution of boundary-value problems , 1983 .

[12]  M. Fortin,et al.  On decomposition - coordination methods using an augmented Lagrangian , 1983 .

[13]  D. Gabay Applications of the method of multipliers to variational inequalities , 1983 .

[14]  F. Luque Asymptotic convergence analysis of the proximal point algorithm , 1984 .

[15]  B. S. Razumikhin Decomposition Methods for Linear Programming Problems , 1984 .

[16]  A. Barrett Network Flows and Monotropic Optimization. , 1984 .

[17]  Jonathan E. Spingarn,et al.  Applications of the method of partial inverses to convex programming: Decomposition , 1985, Math. Program..

[18]  J. Spingarn A primal-dual projection method for solving systems of linear inequalities , 1985 .

[19]  D. Bertsekas A distributed asynchronous relaxation algorithm for the assignment problem , 1985, 1985 24th IEEE Conference on Decision and Control.

[20]  Michael H. Schneider Network flows and monotropic optimization, by R. T. Rockafellar, John Wiley & Sons, New York, 616 pp. Price $44.95 , 1986, Networks.

[21]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[22]  Paul Tseng,et al.  Relaxation Methods for Linear Programs , 1987, Math. Oper. Res..

[23]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[24]  D. Bertsekas,et al.  Relaxation methods for network flow problems with convex arc costs , 1987 .

[25]  J. Spingarn A projection method for least-squares solutions to overdetermined systems of linear inequalities , 1987 .

[26]  O. Mangasarian,et al.  Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems , 1987 .

[27]  Dimitri P. Bertsekas,et al.  ASYNCHRONOUS RELAXATION METHODS FOR CONVEX NETWORK FLOW PROBLEMS , 1987 .

[28]  R. Glowinski,et al.  Augmented Lagrangian Methods for the Solution of Variational Problems. , 1987 .

[29]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[30]  Jonathan Eckstein,et al.  The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm , 1988 .

[31]  C. Michelot,et al.  About the finite convergence of the proximal point algorithm , 1988 .

[32]  O. Mangasarian,et al.  Serial and Parallel Solution of Large Scale Linear Programs by Augmented Lagrangian Successive Overrelaxation , 1988 .

[33]  Stavros A. Zenios,et al.  Nonlinear network optimization on a massively parallel connection machine , 1988 .

[34]  Dimitri P. Bertsekas,et al.  Dual coordinate step methods for linear network flow problems , 1988, Math. Program..

[35]  Jonathan Eckstein Splitting methods for monotone operators with applications to parallel optimization , 1989 .

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

[37]  Dimitri P. Bertsekas,et al.  On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..