Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms. Revision,

Abstract

This document presents a model for asynchronous distributed computation and then proceed to analyze the convergence of natural asynchronous distributed versions of a large class of deterministic and stochastic gradient-like algorithms. It is shown that such algorithms retain the desirable convergence properties of their centralized counterparts, provided that the time between consecutive communications between processors and communication delays are not too large. Additional keywords: Message processing, Mathematical models, Coefficients. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1984
Accession Number
ADA149997

Entities

People

  • D. P. Bertsekas
  • J. N. Tsitsiklis
  • M. Athans

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computations
  • Convergence
  • Heuristic Methods
  • Mathematical Analysis
  • Mathematical Models
  • Mathematics
  • Message Processing
  • Models

Fields of Study

  • Engineering

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Applied Combinatorial Optimization and Logic Circuit Design.