Numerical Structure of the Hessian of the Lagrange Dual Function for a Class of Convex Problems

This paper considers a structured separable convex optimization problem, motivated by the deployment of model predictive control on multiagent systems that are interacting via nondelayed couplings. We show that the dual decomposition of this problem yields a numerical structure in the Hessian of the dual function. This numerical structure allows for deploying a quasi Newton method in the dual space. For large problems, this approach yields a large reduction of the computational complexity of solving the problem, and for geographically distributed problems a reduction in the communication burden.

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

[2]  Sebastien Gros,et al.  An inexact interior point method for optimization of differential algebraic systems , 2016, Comput. Chem. Eng..

[3]  Michele Benzi,et al.  Decay Properties of Spectral Projectors with Applications to Electronic Structure , 2012, SIAM Rev..

[4]  Anders Rantzer,et al.  Distributed Model Predictive Control with suboptimality and stability guarantees , 2010, 49th IEEE Conference on Decision and Control (CDC).

[5]  Sebastien Gros,et al.  A primal-dual Newton method for distributed Quadratic Programming , 2014, 53rd IEEE Conference on Decision and Control.

[6]  Dinh Quoc Tran,et al.  An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization , 2011, SIAM J. Optim..

[7]  P. Tseng.  Dual ascent methods for problems with strictly convex costs and linear constraints: a unified approach , 1990 .

[8]  Manfred Morari,et al.  Towards computational complexity certification for constrained MPC based on Lagrange Relaxation and the fast gradient method , 2011, IEEE Conference on Decision and Control and European Control Conference.

[9]  Ion Necoara,et al.  Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition , 2014, IEEE Transactions on Automatic Control.

[10]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

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

[12]  Pontus Giselsson,et al.  Improved Dual Decomposition for Distributed Model Predictive Control , 2014 .

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

[14]  Moritz Diehl,et al.  A distributed method for convex quadratic programming problems arising in optimal control of distributed systems , 2013, 52nd IEEE Conference on Decision and Control.

[15]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[16]  Sebastien Gros.  A Newton algorithm for distributed Semi-Definite Programs using the primal-dual interior-point method , 2014, 53rd IEEE Conference on Decision and Control.

[17]  Timothy A. Davis,et al.  Direct methods for sparse linear systems , 2006, Fundamentals of algorithms.

[18]  G. Golub,et al.  Bounds for the Entries of Matrix Functions with Applications to Preconditioning , 1999 .

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

[20]  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).

[21]  Moritz Diehl,et al.  An improved Distributed Dual Newton-CG method for convex quadratic programming problems , 2014, 2014 American Control Conference.

[22]  R. Cottle,et al.  A Lagrangean relaxation algorithm for the constrained matrix problem , 1986 .

[23]  Fernando G. S. L. Brandão,et al.  An area law for entanglement from exponential decay of correlations , 2013, Nature Physics.

[24]  William F. Moss,et al.  Decay rates for inverses of band matrices , 1984 .

[25]  Stephen J. Wright,et al.  Distributed MPC Strategies With Application to Power System Automatic Generation Control , 2008, IEEE Transactions on Control Systems Technology.

[26]  Moritz Diehl,et al.  A parallel quadratic programming method for dynamic optimization problems , 2015, Math. Program. Comput..

[27]  J. Suykens,et al.  Interior-Point Lagrangian Decomposition Method for Separable Convex Optimization , 2009, 1302.3136.