Title
Distributed Quadratic Programming Under Asynchronous And Lossy Communications Via Newton-Raphson Consensus
Abstract
Quadratic optimization problems appear in several interesting estimation, learning and control tasks. To solve these problems in peer-to-peer networks it is necessary to design distributed optimization algorithms supporting directed, asynchronous and unreliable communication. This paper addresses this requirement by extending a promising distributed convex optimization algorithm, known as Newton-Raphson consensus, and originally designed for static and undirected communication. Specifically, we modify this algorithm so that it can cope with asynchronous, broadcast and unreliable lossy links, and prove that the optimization strategy correctly converge to the global optimum when the local cost functions are quadratic. We then support the intuition that this robustified algorithm converges to the true optimum also for general convex problems with dedicated numerical simulations.
Year
Venue
Keywords
2015
2015 EUROPEAN CONTROL CONFERENCE (ECC)
convergence,algorithm design and analysis,gold,robustness,optimization,packet loss
Field
DocType
Citations 
Asynchronous communication,Mathematical optimization,Algorithm design,Quadratically constrained quadratic program,Computer science,Quadratic equation,Robustness (computer science),Distributed algorithm,Quadratic programming,Newton's method
Conference
2
PageRank 
References 
Authors
0.37
19
4
Name
Order
Citations
PageRank
Ruggero Carli189469.17
Giuseppe Notarstefano247042.83
luca schenato3221.42
Damiano Varagnolo412115.26