Back to search

University of Minnesota

Distributed optimization in an energy-constrained network.

Abstract

dc:description.abstract

We consider a distributed optimization problem whereby a network of N nodes, Sℓ, ℓ ∈ {1, . . . ,N}, wish to minimize a common strongly convex function f(x), x = [x1, . . . , xN]T , under the constraint that node Sℓ controls variable xℓ only. The nodes locally update their respective variables and periodically exchange their values over a set of pre-defined communication channels. Previous studies of this problem have focused mainly on the convergence issue and the analysis of convergence rate. In this work, we consider noisy communication channels and study the impact of communication energy on convergence. In particular, we study the minimum amount of communication energy required for nodes to obtain an ϵ-minimizer of f(x) in the mean square sense. For linear analog communication schemes, we prove that the communication energy to obtain an ϵ-minimizer of f(x) must grow at least at the rate of Ω(1/ϵ), and this bound is tight when f is convex quadratic. Furthermore, we show that the same energy requirement can be reduced to O ( log2 1/ϵ ) if suitably designed digital communication schemes are used.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Razavi Majomard, Seid Alireza

Subjects

dc:subject × 6

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Dc Identifier Citation
Razavi Majomard, Seid Alireza. (2010). Distributed optimization in an energy-constrained network.. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/59615.

Chain of custody

source
Harvested from
University of Minnesota
Base URL
conservancy.umn.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Razavi Majomard, Seid Alireza. Distributed optimization in an energy-constrained network.. 2010. http://purl.umn.edu/59615