Convergence properties of normalized random incremental gradient algorithms for least-squares source localization

Michael Rabbat, Angelia Nedic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of localizing a single source using received signal strength measurements gathered at a number of sensors. We assume that the measurements follow the standard path loss model and are corrupted by additive white Gaussian noise. Under this model, the maximum likelihood solution to the source localization problem involves solving a non-linear least squares optimization problem. We study the convergence property of a normalized incremental gradient method for solving this problem. Remarkably, despite the fact that the problem is non-convex, the normalized incremental gradient method generates a sequence of iterates which are attracted to the global optimum under some mild conditions.

Original languageEnglish (US)
Title of host publicationConference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Pages1417-1421
Number of pages5
DOIs
StatePublished - 2012
Event46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012 - Pacific Grove, CA, United States
Duration: Nov 4 2012Nov 7 2012

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Other

Other46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Country/TerritoryUnited States
CityPacific Grove, CA
Period11/4/1211/7/12

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Convergence properties of normalized random incremental gradient algorithms for least-squares source localization'. Together they form a unique fingerprint.

Cite this