An Approximately-Zero-Gradient-Sum Algorithm for Consensus Optimization

This paper presents a set of distributed second-order methods for addressing unconstrained, smooth convex optimization over fixed networks. The proposed second-order methods, referred to as Approximately-Zero-Gradient-Sum (AZGS) algorithms, allow each node to update by combining the Hessian inverse of its local objective and the estimates of its neighbors, so that the gradient sum of the local objectives can be sufficiently close to zero at each iteration. We show that the AZGS algorithms, with properly selected parameters, enable all the nodes to asymptotically reach a consensus that can be arbitrarily close to the optimal solution. Finally, simulation results demonstrate the effectiveness of the AZGS algorithms.

[1]  Aryan Mokhtari,et al.  Network Newton Distributed Optimization Methods , 2017, IEEE Transactions on Signal Processing.

[2]  Damiano Varagnolo,et al.  Newton-Raphson Consensus for Distributed Convex Optimization , 2015, IEEE Transactions on Automatic Control.

[3]  Aryan Mokhtari,et al.  Decentralized Quasi-Newton Methods , 2016, IEEE Transactions on Signal Processing.

[4]  Martin J. Wainwright,et al.  Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling , 2010, IEEE Transactions on Automatic Control.

[5]  Yongduan Song,et al.  Distributed multi-agent optimization subject to nonidentical constraints and communication delays , 2016, Autom..

[6]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[7]  Aryan Mokhtari,et al.  A Decentralized Second-Order Method with Exact Linear Convergence Rate for Consensus Optimization , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[8]  Wenwu Yu,et al.  An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination , 2012, IEEE Transactions on Industrial Informatics.

[9]  Mikael Johansson,et al.  A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems , 2009, SIAM J. Optim..

[10]  Choon Yik Tang,et al.  Zero-Gradient-Sum Algorithms for Distributed Convex Optimization: The Continuous-Time Case , 2011, IEEE Transactions on Automatic Control.

[11]  Qing Ling,et al.  EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization , 2014, 1404.6264.

[12]  Sonia Martínez,et al.  On Distributed Convex Optimization Under Inequality and Equality Constraints , 2010, IEEE Transactions on Automatic Control.

[13]  Robert Nowak,et al.  Distributed optimization in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[14]  Angelia Nedic,et al.  Distributed optimization over time-varying directed graphs , 2013, 52nd IEEE Conference on Decision and Control.

[15]  Marc Teboulle,et al.  An $O(1/k)$ Gradient Method for Network Resource Allocation Problems , 2014, IEEE Transactions on Control of Network Systems.

[16]  Na Li,et al.  Harnessing smoothness to accelerate distributed optimization , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[17]  Dragana Bajović,et al.  Newton-like Method with Diagonal Correction for Distributed Optimization , 2015, SIAM J. Optim..

[18]  J. Lofberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).