Distributed Newton Methods for Strictly Convex Consensus Optimization Problems in Multi-Agent Networks
Various distributed optimization methods have been developed for consensus optimization problems in multi-agent networks. Most of these methods only use gradient or subgradient information of the objective functions, which suffer from slow convergence rate. Recently, a distributed Newton method whos...
Main Authors: | Dong Wang, Hualing Ren, Fubo Shao |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-08-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/9/8/163 |
Similar Items
-
Consensus Distributionally Robust Optimization With Phi-Divergence
by: Shunichi Ohmori
Published: (2021-01-01) -
Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method
by: Dianhao Zheng, et al.
Published: (2020-01-01) -
On Consensus-Optimality Trade-offs in Collaborative Deep Learning
by: Zhanhong Jiang, et al.
Published: (2021-09-01) -
Distributed Consensus of Nonlinear Multi-Agent Systems on State-Controlled Switching Topologies
by: Kairui Chen, et al.
Published: (2016-01-01) -
An asynchronous distributed optimization method for energy saving of parallel-connected pumps in HVAC systems
by: Xuetao Wang, et al.
Published: (2020-12-01)