A Fast Distributed Asynchronous Newton-Based Optimization Algorithm

Fatemeh Mansoori*, Ermin Wei

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

One of the most important problems in the field of distributed optimization is the problem of minimizing a sum of local convex objective functions over a networked system. Most of the existing work in this area focuses on developing distributed algorithms in a synchronous setting under the presence of a central clock, where the agents need to wait for the slowest one to finish the update, before proceeding to the next iterate. Asynchronous distributed algorithms remove the need for a central coordinator, reduce the synchronization wait, and allow some agents to compute faster and execute more iterations. In the asynchronous setting, the only known algorithms for solving this problem could achieve an either linear or sublinear rate of convergence. In this paper, we build upon the existing literature to develop and analyze an asynchronous Newton-based method to solve a penalized version of the problem. We show that this algorithm guarantees almost sure convergence with a global linear and local quadratic rate in expectation. Numerical studies confirm the superior performance of our algorithm against other asynchronous methods.

Original languageEnglish (US)
Article number8789473
Pages (from-to)2769-2784
Number of pages16
JournalIEEE Transactions on Automatic Control
Volume65
Issue number7
DOIs
StatePublished - Jul 2020

Keywords

  • Agents and autonomous systems
  • asynchronous algorithms
  • network analysis and control
  • optimization algorithms

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A Fast Distributed Asynchronous Newton-Based Optimization Algorithm'. Together they form a unique fingerprint.

Cite this