{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T05:15:36Z","timestamp":1783228536551,"version":"3.54.6"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002701","name":"Ministry of Education","doi-asserted-by":"publisher","award":["23YJA910003"],"award-info":[{"award-number":["23YJA910003"]}],"id":[{"id":"10.13039\/501100002701","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371297"],"award-info":[{"award-number":["12371297"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.neunet.2026.109319","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T23:30:51Z","timestamp":1782862251000},"page":"109319","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Decentralized ADMM for factorization-based Low-rank matrix estimation"],"prefix":"10.1016","volume":"204","author":[{"given":"Zihao","family":"Song","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weihua","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heng","family":"Lian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.neunet.2026.109319_bib0001","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","article-title":"A singular value thresholding algorithm for matrix completion","volume":"20","author":"Cai","year":"2010","journal-title":"SIAM Journal on Optimization"},{"issue":"6","key":"10.1016\/j.neunet.2026.109319_bib0002","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","article-title":"Exact matrix completion via convex optimization","volume":"9","author":"Cand\u00e8s","year":"2009","journal-title":"Foundations of Computational mathematics"},{"key":"10.1016\/j.neunet.2026.109319_bib0003","doi-asserted-by":"crossref","first-page":"373","DOI":"10.2478\/jaiscr-2024-0020","article-title":"Exponential state estimation for delayed competitive neural network via stochastic sampled-data control with markov jump parameters under actuator failure","volume":"14","author":"Cao","year":"2024","journal-title":"Journal of Artificial Intelligence and Soft Computing Research"},{"key":"10.1016\/j.neunet.2026.109319_bib0004","series-title":"31st international conference on machine learning, ICML 2014","article-title":"Coherent matrix completion","volume":"vol. 2","author":"Chen","year":"2014"},{"key":"10.1016\/j.neunet.2026.109319_bib0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.dss.2022.113748","article-title":"Combining review-based collaborative filtering and matrix factorization: A solution to rating\u2019s sparsity problem","volume":"156","author":"Duan","year":"2022","journal-title":"Decision Support Systems"},{"issue":"1","key":"10.1016\/j.neunet.2026.109319_bib0006","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1109\/TAC.2023.3275927","article-title":"A fast row-stochastic decentralized method for distributed optimization over directed graphs","volume":"69","author":"Ghaderyan","year":"2024","journal-title":"IEEE Transactions on Automatic Control"},{"key":"10.1016\/j.neunet.2026.109319_bib0007","series-title":"Proceedings of the 19th international conference on artificial intelligence and statistics, AISTATS 2016","first-page":"600","article-title":"Low-rank and sparse structure pursuit via alternating minimization","author":"Gu","year":"2016"},{"key":"10.1016\/j.neunet.2026.109319_bib0008","series-title":"International conference on learning representations","article-title":"LoRA: Low-rank adaptation of large language models","author":"Hu","year":"2022"},{"key":"10.1016\/j.neunet.2026.109319_bib0009","series-title":"Icml 2010 - proceedings, 27th international conference on machine learning","first-page":"471","article-title":"A simple algorithm for nuclear norm regularized problems","author":"Jaggi","year":"2010"},{"issue":"3-4","key":"10.1016\/j.neunet.2026.109319_bib0010","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1561\/2200000058","article-title":"Non-convex optimization for machine learning","volume":"10","author":"Jain","year":"2017","journal-title":"Foundations and Trends in Machine Learning"},{"key":"10.1016\/j.neunet.2026.109319_bib0011","series-title":"Advances in neural information processing systems","first-page":"685","article-title":"On iterative hard thresholding methods for high-dimensional M-estimation","author":"Jain","year":"2014"},{"issue":"5","key":"10.1016\/j.neunet.2026.109319_bib0012","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1214\/11-AOS894","article-title":"Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion","volume":"39","author":"Koltchinskii","year":"2011","journal-title":"The Annals of Statistics"},{"issue":"17","key":"10.1016\/j.neunet.2026.109319_bib0013","doi-asserted-by":"crossref","first-page":"4494","DOI":"10.1109\/TSP.2019.2926022","article-title":"A Decentralized proximal-gradient method with network independent step-sizes and separated convergence rates","volume":"67","author":"Li","year":"2019","journal-title":"IEEE Transactions on Signal Processing"},{"key":"10.1016\/j.neunet.2026.109319_bib0014","series-title":"Advances in neural information processing systems","first-page":"5336","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"Lian","year":"2017"},{"issue":"15","key":"10.1016\/j.neunet.2026.109319_bib0015","doi-asserted-by":"crossref","first-page":"4051","DOI":"10.1109\/TSP.2015.2436358","article-title":"DLM: Decentralized linearized alternating direction method of multipliers","volume":"63","author":"Ling","year":"2015","journal-title":"IEEE Transactions on Signal Processing"},{"key":"10.1016\/j.neunet.2026.109319_bib0016","series-title":"Ieee international conference on computer vision","first-page":"416","article-title":"A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics","volume":"vol. 2","author":"Martin","year":"2001"},{"issue":"19","key":"10.1016\/j.neunet.2026.109319_bib0017","doi-asserted-by":"crossref","first-page":"5158","DOI":"10.1109\/TSP.2016.2548989","article-title":"Dqm: Decentralized quadratically approximated alternating direction method of multipliers","volume":"64","author":"Mokhtari","year":"2016","journal-title":"IEEE Transactions on Signal Processing"},{"key":"10.1016\/j.neunet.2026.109319_bib0018","series-title":"Proceedings of the IEEE computer society conference on computer vision and pattern recognition","first-page":"2609","article-title":"Accelerated low-rank visual recovery by random projection","author":"Mu","year":"2011"},{"issue":"4","key":"10.1016\/j.neunet.2026.109319_bib0019","doi-asserted-by":"crossref","first-page":"2165","DOI":"10.1137\/17M1150189","article-title":"Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably","volume":"11","author":"Park","year":"2018","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"10.1016\/j.neunet.2026.109319_bib0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107204","article-title":"Image decomposition based matrix regression with applications to robust face recognition","volume":"102","author":"Qian","year":"2020","journal-title":"Pattern Recognition"},{"key":"10.1016\/j.neunet.2026.109319_bib0021","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1109\/TNSRE.2019.2913142","article-title":"Multiclass support matrix machines by maximizing the inter-class margin for single trial EEG classification","volume":"27","author":"Razzak","year":"2019","journal-title":"IEEE Transactions on Neural Systems and Rehabilitation Engineering"},{"issue":"3","key":"10.1016\/j.neunet.2026.109319_bib0022","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","article-title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization","volume":"52","author":"Recht","year":"2010","journal-title":"SIAM Review"},{"issue":"7","key":"10.1016\/j.neunet.2026.109319_bib0023","doi-asserted-by":"crossref","first-page":"1750","DOI":"10.1109\/TSP.2014.2304432","article-title":"On the linear convergence of the ADMM in decentralized consensus optimization","volume":"62","author":"Shi","year":"2014","journal-title":"IEEE Transactions on Signal Processing"},{"key":"10.1016\/j.neunet.2026.109319_bib0024","doi-asserted-by":"crossref","first-page":"8403","DOI":"10.1140\/epjs\/s11734-025-01653-5","article-title":"Robust dissipative sliding mode control synchronization of memristive inertial competitive neural networks with time-varying delay","volume":"234","author":"Subhashri","year":"2025","journal-title":"The European Physical Journal Special Topics"},{"key":"10.1016\/j.neunet.2026.109319_bib0025","unstructured":"Sun, Y., Maros, M., Scutari, G., & Cheng, G. (2022). High-dimensional inference over networks: Linear convergence and statistical guarantees. arXiv preprint, arXiv: 2201."},{"issue":"5","key":"10.1016\/j.neunet.2026.109319_bib0026","doi-asserted-by":"crossref","first-page":"S104","DOI":"10.1137\/120876459","article-title":"Normalized iterative hard thresholding for matrix completion","volume":"35","author":"Tanner","year":"2013","journal-title":"SIAM Journal on Scientific Computing"},{"key":"10.1016\/j.neunet.2026.109319_bib0027","series-title":"33rd international conference on machine learning, ICML 2016","first-page":"964","article-title":"Low-rank solutions of linear matrix equations via procrustes flow","author":"Tu","year":"2016"},{"issue":"1","key":"10.1016\/j.neunet.2026.109319_bib0028","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000055","article-title":"Generalized low rank models","volume":"9","author":"Udell","year":"2016","journal-title":"Foundations and Trends in Machine Learning"},{"key":"10.1016\/j.neunet.2026.109319_bib0029","doi-asserted-by":"crossref","first-page":"6255","DOI":"10.1109\/TSP.2020.3031071","article-title":"Variance-reduced decentralized stochastic optimization with accelerated convergence","volume":"68","author":"Xin","year":"2020","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"10.1016\/j.neunet.2026.109319_bib0030","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/20M1361158","article-title":"Fast decentralized nonconvex finite-sum optimization with recursive variance reduction","volume":"32","author":"Xin","year":"2022","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/j.neunet.2026.109319_bib0031","series-title":"Proceedings of the IEEE conference on decision and control","first-page":"2309","article-title":"A unified algorithmic framework for distributed composite optimization","author":"Xu","year":"2020"},{"issue":"5","key":"10.1016\/j.neunet.2026.109319_bib0032","doi-asserted-by":"crossref","first-page":"6643","DOI":"10.1109\/TNNLS.2022.3212390","article-title":"Distributed Estimation of Support Vector Machines for Matrix Data","volume":"35","author":"Xu","year":"2024","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"10.1016\/j.neunet.2026.109319_bib0033","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2017.02.020","article-title":"Weighted sparse coding regularized nonconvex matrix regression for robust face recognition","volume":"394-395","author":"Zhang","year":"2017","journal-title":"Information Sciences"},{"key":"10.1016\/j.neunet.2026.109319_bib0034","series-title":"Advances in neural information processing systems","first-page":"559","article-title":"A nonconvex optimization framework for low rank matrix estimation","author":"Zhao","year":"2015"},{"key":"10.1016\/j.neunet.2026.109319_bib0035","series-title":"Advances in neural information processing systems","first-page":"109","article-title":"A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements","author":"Zheng","year":"2015"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608026007793?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608026007793?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T04:24:15Z","timestamp":1783225455000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893608026007793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":35,"alternative-id":["S0893608026007793"],"URL":"https:\/\/doi.org\/10.1016\/j.neunet.2026.109319","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Decentralized ADMM for factorization-based Low-rank matrix estimation","name":"articletitle","label":"Article Title"},{"value":"Neural Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.neunet.2026.109319","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"109319"}}