ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Distributed Stochastic Constrained Composite Optimization Over Time-Varying Network With a Class of Communication Noise

Yu, Zhan*; Ho, Daniel W. C.; Yuan, Deming; Liu, Jie南京理工大学; 香港城市大学
IEEE Transactions on Cybernetics2023-6DOI: 10.1109/TCYB.2021.3127278
8被引6阅读
引用收藏
分享

摘要

This article is concerned with the distributed stochastic multiagent-constrained optimization problem over a time-varying network with a class of communication noise. This article considers the problem in composite optimization setting, which is more general in the literature of noisy network optimization. It is noteworthy that the mainstream existing methods for noisy network optimization are Euclidean projection based. Based on the Bregman projection-based mirror descent scheme, we present a non-Euclidean method and investigate their convergence behavior. This method is the distributed stochastic composite mirror descent type method (DSCMD-N), which provides a more general algorithm framework. Some new error bounds for DSCMD-N are obtained. To the best of our knowledge, this is the first work to analyze and derive convergence rates of optimization algorithm in noisy network optimization. We also show that an optimal rate of O(1/root T) in nonsmooth convex optimization can be obtained for the proposed method under appropriate communication noise condition. Moveover, novel convergence results are comprehensively derived in expectation convergence, high probability convergence, and almost surely sense.

学科与关键词

关键词
OptimizationConvergenceNoise measurementMirrorsStochastic processesOptimization methodsLinear programmingCommunication noisecomposite optimizationdistributed optimizationmirror descentmultiagent network
相关
加载中…
  • Distributed Constrained Optimization With Delayed Subgradient Information Over Time-Varying Network Under Adaptive Quantization
    Liu, Jie*; Yu, Zhan; Ho, Daniel W. C.IEEE Transactions on Neural Networks and Learning Systems, 2024, 35(1): 143-156.被引 3
  • Event-Triggered Distributed Stochastic Mirror Descent for Convex Optimization
    Xiong, Menghui; Zhang, Baoyong*; Ho, Daniel W. C.; Yuan, Deming; Xu, ShengyuanIEEE Transactions on Neural Networks and Learning Systems, 2023, 34(9): 6480-6491.被引 7
  • Distributed Randomized Gradient-Free Mirror Descent Algorithm for Constrained Optimization
    Yu, Zhan*; Ho, Daniel W. C.; Yuan, DemingIEEE Transactions on Automatic Control, 2022, 67(2): 957-964.被引 14
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Cybernetics
发表日期
2023-06
卷期
第 53 卷, 第 6 期
页码
3561-3573
DOI
10.1109/TCYB.2021.3127278
语言
ENGLISH
成果收录
SCIE
资助标注
Research Grants Council of the Hong Kong Special Administrative Region, China [CityU 11202819, CityU 11200717]; National Natural Science Foundation of China [62022042]

作者

  • Y

    Yu, Zhan (通讯) (第一作者)

    city univ hong kong

  • H

    Ho, Daniel W. C.

    city univ hong kong

查看全部 4 位作者收起作者
  • Y

    Yuan, Deming

    nanjing univ sci & technol

  • L

    Liu, Jie

    city univ hong kong

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417