Privacy Masking Stochastic Subgradient-Push Algorithm for Distributed Online Optimization.

IEEE Transactions on Cybernetics(2021)

引用 39|浏览89
暂无评分
摘要
This article investigates the problem of distributed online optimization for a group of units communicating on time-varying unbalanced directed networks. The main target of the set of units is to cooperatively minimize the sum of all locally known convex cost functions (global cost function) while pursuing the privacy of their local cost functions being well masked. To address such optimization pr...
更多
查看译文
关键词
Privacy,Cost function,Convex functions,Delays,Stochastic processes
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要