A Primal-Dual Newton Method for Distributed Quadratic Programming
Paper in proceeding, 2015

This paper considers the problem of solving Quadratic Programs (QP) arising in the context of distributed optimization and optimal control. A dual decomposition approach is used, where the problem is decomposed and solved in parallel, while the coupling constraints are enforced via manipulating the dual variables. In this paper, the local problems are solved using a primal-dual interior point method and the dual variables are updated using a Newton iteration, providing a fast convergence rate. Linear predictors for the local primaldual variables and the dual variables are introduced to help the convergence of the algorithm. We observe a fast and consistent practical convergence for the proposed algorithm.

Optimization algorithms

Distributed control

Computational methods


Emil Klintberg

Chalmers, Signals and Systems, Systems and control, Automatic Control

Sébastien Gros

Chalmers, Signals and Systems, Systems and control, Automatic Control

Proceedings of the 53rd IEEE Annual Conference on Decision and Control, CDC 2014, Los Angeles, United States, 15-17 December 2014

0743-1546 (ISSN)

978-1-4673-6088-3 (ISBN)

Subject Categories

Computational Mathematics



More information

Latest update