Libros importados con hasta 50% OFF + Envío Gratis a todo USA  Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Convergence Rate of Distributed Averaging Dynamics and Optimization in Networks (in English)
Type
Physical Book
Publisher
Language
Inglés
Pages
116
Format
Paperback
Dimensions
23.4 x 15.6 x 0.6 cm
Weight
0.17 kg.
ISBN13
9781680830408

Convergence Rate of Distributed Averaging Dynamics and Optimization in Networks (in English)

Angelia Nedic (Author) · Now Publishers · Paperback

Convergence Rate of Distributed Averaging Dynamics and Optimization in Networks (in English) - Nedic, Angelia

Physical Book

$ 67.37

$ 80.00

You save: $ 12.63

16% discount
  • Condition: New
It will be shipped from our warehouse between Tuesday, June 25 and Wednesday, June 26.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "Convergence Rate of Distributed Averaging Dynamics and Optimization in Networks (in English)"

Recent years have seen the advent of new large cyber-physical systems such as sensor and social networks. These network systems are typically spatially distributed over a large area and may consists of hundreds of agents in smart-sensor networks to millions of agents in social networks. As such, they do not possess a central coordinator or a central point for access to the complete system information. This lack of central entity makes the traditional (centralized) optimization and control techniques inapplicable, thus necessitating the development of new distributed computational models and algorithms to support efficient operations over such networks. This tutorial provides an overview of the convergence rate of distributed algorithms for coordination and its relevance to optimization in a system of autonomous agents embedded in a communication network, where each agent is aware of (and can communicate with) its local neighbors only. The focus is on distributed averaging dynamics for consensus problems and its role in consensus-based gradient methods for convex optimization problems, where the network objective function is separable across the constituent agents. The tutorial will be of interest to researchers and engineers working on a wide-variety of operations research, networking and optimization problems.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews