An augmented Lagrangian coordination-decomposition algorithm for solving distributed non-convex programs

A novel augmented Lagrangian method for solving non-convex programs with nonlinear cost and constraint couplings in a distributed framework is presented. The proposed decomposition algorithm is made of two layers: The outer level is a standard multiplier method with penalty on the nonlinear equality constraints, while the inner level consists of a block-coordinate descent (BCD) scheme. Based on standard results on multiplier methods and recent results on proximal regularised BCD techniques, it is proven that the method converges to a KKT point of the non-convex nonlinear program under a semi-algebraicity assumption. Efficacy of the algorithm is demonstrated on a numerical example.

[1]  Bastian Goldlücke,et al.  Variational Analysis , 2014, Computer Vision, A Reference Guide.

[2]  Benar Fux Svaiter,et al.  Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods , 2013, Math. Program..

[3]  Johan A. K. Suykens,et al.  Distributed nonlinear optimal control using sequential convex programming and smoothing techniques , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[4]  Abdelouahed Hamdi,et al.  Decomposition Methods Based on Augmented Lagrangians: A Survey , 2011 .

[5]  R. Rockafellar.  Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming , 1974 .

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

[7]  P. Toint,et al.  A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds , 1991 .

[8]  H. Mukai,et al.  A New Technique for Nonconvex Primal-Dual Decomposition of a Large-Scale Separable Optimization Problem , 1983, 1983 American Control Conference.

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

[10]  Adrian S. Lewis,et al.  The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems , 2006, SIAM J. Optim..

[11]  D. Bertsekas.  Convexification procedures and decomposition methods for nonconvex optimization problems , 1979 .

[12]  H. Mukai,et al.  A New Technique for Nonconvex Primal-Dual Decomposition of a Large-Scale Separable Optimization Prob , 1985 .

[13]  Ion Necoara,et al.  Parallel and distributed optimization methods for estimation and control in networks , 2011, 1302.3103.