Abstract:
We propose a distributed algorithm for strictly convex quadratic programming (QP) problems with a generic coupling topology. The coupling constraints are dualized via Lag...Show MoreMetadata
Abstract:
We propose a distributed algorithm for strictly convex quadratic programming (QP) problems with a generic coupling topology. The coupling constraints are dualized via Lagrangian relaxation. This allows for a distributed evaluation of the non-smooth dual function and its derivatives. We propose to use both the gradient and the curvature information within a non-smooth variant of Newton's method to find the optimal dual variables. Our novel approach is designed such that the large Newton system never needs to be formed. Instead, we employ an iterative method to solve the Newton system in a distributed manner. The effectiveness of the method is demonstrated on an academic optimal control problem. A comparison with state-of-the-art first order dual methods is given.
Published in: 52nd IEEE Conference on Decision and Control
Date of Conference: 10-13 December 2013
Date Added to IEEE Xplore: 10 March 2014
ISBN Information:
Print ISSN: 0191-2216