Accelerated Dual Descent for Network Optimization
arXiv:1104.1157
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.
Full version of a paper of the same name to appear in the proceedings of American Control Conference, 2011. (8 pages, 4 figures)
Cited by in corpus (7)
- Distributed Optimization With Local Domains: Applications in MPC and Network Flows
- A Polyhedral Approximation Framework for Convex and Robust Distributed Optimization
- Accelerated Backpressure Algorithm
- Communication-Efficient Algorithms For Distributed Optimization
- Distributed SDDM Solvers: Theory & Applications
- Newton-Raphson Consensus for Distributed Convex Optimization
- A Distributed Line Search for Network Optimization