Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition

We propose and analyze two dual methods based on inexact gradient information and averaging that generate approximate primal solutions for smooth convex problems. The complicating constraints are moved into the cost using the Lagrange multipliers. The dual problem is solved by inexact first-order methods based on approximate gradients for which we prove sublinear rate of convergence. In particular, we provide a complete rate analysis and estimates on the primal feasibility violation and primal and dual suboptimality of the generated approximate primal and dual solutions. Moreover, we solve approximately the inner problems with a linearly convergent parallel coordinate descent algorithm. Our analysis relies on the Lipschitz property of the dual function and inexact dual gradients. Further, we combine these methods with dual decomposition and constraint tightening and apply this framework to linear model predictive control obtaining a suboptimal and feasible control scheme.

[1]  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.

[2]  M. Patriksson,et al.  Ergodic convergence in subgradient optimization , 1998 .

[3]  Stephen J. Wright,et al.  Cooperative distributed model predictive control , 2010, Syst. Control. Lett..

[4]  Rolf Findeisen,et al.  Fast predictive control of linear systems combining Nesterov's gradient method and the method of multipliers , 2011, IEEE Conference on Decision and Control and European Control Conference.

[5]  Hanif D. Sherali,et al.  A class of convergent primal-dual subgradient algorithms for decomposable convex programs , 1986, Math. Program..

[6]  Yurii Nesterov,et al.  Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

[7]  Eduardo Camponogara,et al.  Distributed model predictive control , 2002 .

[8]  Lucas Barcelos de Oliveira,et al.  Distributed Optimization for Model Predictive Control of Linear-Dynamic Networks , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[9]  Jairo Espinosa,et al.  A comparative analysis of distributed MPC techniques applied to the HD-MPC four-tank benchmark , 2011 .

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

[11]  Alberto Bemporad,et al.  An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control , 2014, IEEE Transactions on Automatic Control.

[12]  Bart De Schutter,et al.  A distributed optimization-based approach for hierarchical model predictive control of large-scale systems with coupled dynamics and constraints , 2011, ArXiv.

[13]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

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

[15]  Jong-Shi Pang,et al.  A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem , 1987, Math. Oper. Res..

[16]  D. Q. Mayne,et al.  Suboptimal model predictive control (feasibility implies stability) , 1999, IEEE Trans. Autom. Control..

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

[18]  Ion Necoara,et al.  An adaptive constraint tightening approach to linear MPC based on approximation algorithms for optimization , 2014 .

[19]  Torbjörn Larsson,et al.  Lagrangian Relaxation via Ballstep Subgradient Methods , 2007, Math. Oper. Res..

[20]  Marcello Farina,et al.  Distributed predictive control: A non-cooperative algorithm with neighbor-to-neighbor communication for linear systems , 2012, Autom..

[21]  Asuman E. Ozdaglar,et al.  Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods , 2008, SIAM J. Optim..

[22]  Yurii Nesterov,et al.  First-order methods of smooth convex optimization with inexact oracle , 2013, Mathematical Programming.

[23]  Panagiotis D. Christofides,et al.  Distributed model predictive control: A tutorial review and future research directions , 2013, Comput. Chem. Eng..

[24]  Ion Necoara,et al.  Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: Application to distributed MPC , 2013, 1302.3092.