Accelerated Dual Descent for Network Optimization
Name
Ozdaglar_Accelerated dual.pdf
Size
312.8 KB
Format
Adobe PDF
Checksum (MD5)
e6803c56e0a026728bb81d814c21e6ca
Author(s)
Zargham, Michael
Ribeiro, Alejandro
Ozdaglar, Asuman E.
Jadbabaie, Ali
Date Issued
June 2011
Journal
Proceedings of American Control Conference (ACC 2011)
Publisher
IEEE Control Systems Society
Citation
Zargham, Michael et al."Accelerated Dual Descent for Network Optimization." Papers of the 2011 American Control Conference, June 29-July 01, 2011, San Francisco, CA, USA.
Version
Author's final manuscript
Abstract
Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rates are typically very slow. This paper introduces a family of dual descent algorithms that use approximate Newton directions to accelerate the convergence rate of conventional dual descent. These approximate directions can be computed using local information exchanges thereby retaining the benefits of distributed implementations. The approximate Newton directions are obtained through matrix splitting techniques and sparse Taylor approximations of the inverse Hessian.We show that, similarly to conventional Newton methods, the proposed algorithm exhibits superlinear convergence within a neighborhood of the optimal value. Numerical analysis corroborates that convergence times are between one to two orders of magnitude faster than existing distributed optimization methods. A connection with recent developments that use consensus iterations to compute approximate Newton directions is also presented.
Description
URL to paper listed on conference site
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://css.paperplaza.net/conferences/conferences/2011ACC/program/2011ACC_ContentListWeb_2.html#thb10_05
