Quantized Communication-Based Distributed Optimization over Time-Varying Directed Networks
Huaqing Li (),
Qingguo Lü,
Zheng Wang,
Xiaofeng Liao and
Tingwen Huang
Additional contact information
Huaqing Li: Southwest University, College of Electronic and Information Engineering
Qingguo Lü: Southwest University, College of Electronic and Information Engineering
Zheng Wang: Southwest University, College of Electronic and Information Engineering
Xiaofeng Liao: Chongqing University, College of Computer Science
Tingwen Huang: Texas A&M University at Qatar, Science Program
Chapter Chapter 5 in Distributed Optimization: Advances in Theories, Methods, and Applications, 2020, pp 85-113 from Springer
Abstract:
Abstract Recent advances in networked control and distributed systems require the development of scalable algorithms that consider the decentralized characteristic of the problem and communication restrictions. The interest in solving distributed consensus optimization problems of multi-agent systems has been growing. Distributed consensus optimization problems are modeled as minimizing a global objective function by multiple agents over a network. The formulation of distributed consensus optimization has been paid extensive attention due to its widespread applications, e.g., large-scale machine learning [1, 2], model predictive control [3], cognitive networks [4, 5], source localization [6, 7], resource allocation or scheduling [8], message routing [9], distributed spectrum sensing [5], statistical inference and learning [6, 10–12]. In these applications, without need of putting all the parameters together which define the optimization problem, decentralized nodes that only have a local subcollection of such parameters, collaboratively achieve the minimizer of the global objective function. In light of commonly used distributed optimization algorithms, by introducing a large number of nodes with a certain ability of calculation and communication, a complex global optimization problem is spit and distributed to those nodes. Through locally calculating and communicating with neighboring nodes, global optimal solutions can be obtained.
Date: 2020
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-981-15-6109-2_5
Ordering information: This item can be ordered from
http://www.springer.com/9789811561092
DOI: 10.1007/978-981-15-6109-2_5
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().