CSpace
MULTI-AGENT SOLVER FOR NON-NEGATIVE MATRIX FACTORIZATION BASED ON OPTIMIZATION
Tu, Zhipeng1; Li, Weijian2
2021
发表期刊KYBERNETIKA
ISSN0023-5954
卷号57期号:1页码:60-77
摘要This paper investigates a distributed solver for non-negative matrix factorization (NMF) over a multi-agent network. After reformulating the problem into the standard distributed optimization form, we design our distributed algorithm (DisNMF) based on the primal-dual method and in the form of multiplicative update rule. With the help of auxiliary functions, we provide monotonic convergence analysis. Furthermore, we show by computational complexity analysis and numerical examples that our distributed NMF algorithm performs well in comparison with the centralized NMF algorithm.
关键词distributed optimization non-negative matrix factorization multiplicative update rules multi-agent network
DOI10.14736/kyb-2021-1-0060
收录类别SCI
语种英语
资助项目NSFC[61733018] ; National Key Research and Development Program[2016YFB0901900]
WOS研究方向Computer Science
WOS类目Computer Science, Cybernetics
WOS记录号WOS:000626598800005
出版者KYBERNETIKA
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/58270
专题中国科学院数学与系统科学研究院
通讯作者Tu, Zhipeng
作者单位1.Univ Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Syst & Control, Beijing 100190, Peoples R China
2.Univ Sci & Technol China, Dept Automat, Hefei 230027, Peoples R China
推荐引用方式
GB/T 7714
Tu, Zhipeng,Li, Weijian. MULTI-AGENT SOLVER FOR NON-NEGATIVE MATRIX FACTORIZATION BASED ON OPTIMIZATION[J]. KYBERNETIKA,2021,57(1):60-77.
APA Tu, Zhipeng,&Li, Weijian.(2021).MULTI-AGENT SOLVER FOR NON-NEGATIVE MATRIX FACTORIZATION BASED ON OPTIMIZATION.KYBERNETIKA,57(1),60-77.
MLA Tu, Zhipeng,et al."MULTI-AGENT SOLVER FOR NON-NEGATIVE MATRIX FACTORIZATION BASED ON OPTIMIZATION".KYBERNETIKA 57.1(2021):60-77.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Tu, Zhipeng]的文章
[Li, Weijian]的文章
百度学术
百度学术中相似的文章
[Tu, Zhipeng]的文章
[Li, Weijian]的文章
必应学术
必应学术中相似的文章
[Tu, Zhipeng]的文章
[Li, Weijian]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。