对等网络中异步有损通信下的Newton-Raphson共识
Newton-Raphson Consensus under asynchronous and lossy communications for peer-to-peer networks
摘要：
在这项工作中，我们研究了无约束凸优化问题在一个完全分布式的多智能体设置，其中包括异步计算和有损通信。特别是，我们扩展了最近提出的算法命名为牛顿-拉夫森共识整合它与基于广播的平均共识算法，这是强大的数据包丢失。我们通过时间尺度分离原理证明了在温和条件下（即，代理激活的持久性和有界连续通信故障），所提出的算法被证明是局部指数稳定的最优全局解。最后，我们补充的理论分析与数值模拟是基于真实的数据集。
英文摘要：
In this work we study the problem of unconstrained convex-optimization in a fully distributed multi-agent setting which includes asynchronous computation and lossy communication. In particular, we extend a recently proposed algorithm named Newton-Raphson Consensus by integrating it with a broadcast-based average consensus algorithm which is robust to packet losses. We show via the separation of time scales principle that under mild conditions (i.e., persistency of the agents activation and bounded consecutive communication failures) the proposed algorithm is proved to be locally exponentially stable with respect to the optimal global solution. Finally, we complement the theoretical analysis with numerical simulations that are based on real datasets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
