{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T09:20:10Z","timestamp":1773307210426,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T00:00:00Z","timestamp":1726272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T00:00:00Z","timestamp":1726272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100014219","name":"National Science Fund for Distinguished Young Scholars","doi-asserted-by":"publisher","award":["12125108, 12226008, 12288201, 12021001, 11991021"],"award-info":[{"award-number":["12125108, 12226008, 12288201, 12021001, 11991021"]}],"id":[{"id":"10.13039\/501100014219","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["GXWD20201231105722002-20200901175001001"],"award-info":[{"award-number":["GXWD20201231105722002-20200901175001001"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10957-024-02523-1","type":"journal-article","created":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T13:01:51Z","timestamp":1726318911000},"page":"529-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Seeking Consensus on Subspaces in Federated Principal Component Analysis"],"prefix":"10.1007","volume":"203","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0651-6262","authenticated-orcid":false,"given":"Lei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5705-0805","authenticated-orcid":false,"given":"Xin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,14]]},"reference":[{"issue":"4","key":"2523_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3214303","volume":"51","author":"A Acar","year":"2018","unstructured":"Acar, A., Aksu, H., Uluagac, A.S., Conti, M.: A survey on homomorphic encryption schemes: theory and implementation. ACM Comput. Surv. 51(4), 1\u201335 (2018). https:\/\/doi.org\/10.1145\/3214303","journal-title":"ACM Comput. Surv."},{"issue":"11","key":"2523_CR2","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311\u20134322 (2006). https:\/\/doi.org\/10.1109\/TSP.2006.881199","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"2523_CR3","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TCOM.1976.1093309","volume":"24","author":"HC Andrews","year":"1976","unstructured":"Andrews, H.C., Patterson, C.L.: Singular value decomposition (SVD) image coding. IEEE Trans. Commun. 24(4), 425\u2013432 (1976). https:\/\/doi.org\/10.1109\/TCOM.1976.1093309","journal-title":"IEEE Trans. Commun."},{"issue":"6","key":"2523_CR4","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717 (2009). https:\/\/doi.org\/10.1007\/s10208-009-9045-5","journal-title":"Found. Comput. Math."},{"key":"2523_CR5","doi-asserted-by":"crossref","unstructured":"Chai, D., Wang, L., Zhang, J., Yang, L., Cai, S., Chen, K., Yang, Q.: Practical lossless federated singular vector decomposition over billion-scale data. In: Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining, pp 46\u201355 (2022). 10.1145\/3534678.3539402","DOI":"10.1145\/3534678.3539402"},{"issue":"6","key":"2523_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S Deerwester","year":"1990","unstructured":"Deerwester, S., Dumais, S.T., Furnas, G.W., Landauer, T.K., Harshman, R.: Indexing by latent semantic analysis. J. Am. Soc. Inf. Sci. 41(6), 391\u2013407 (1990)","journal-title":"J. Am. Soc. Inf. Sci."},{"issue":"3\u20134","key":"2523_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A., et al.: The algorithmic foundations of differential privacy. Found. Trends\u00ae Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014). https:\/\/doi.org\/10.1561\/0400000042","journal-title":"Found. Trends\u00ae Theor. Comput. Sci."},{"issue":"1\u20132","key":"2523_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-012-0528-9","volume":"141","author":"J Eckstein","year":"2013","unstructured":"Eckstein, J., Silva, P.J.S.: A practical relative error criterion for augmented Lagrangians. Math. Program. 141(1\u20132), 319\u2013348 (2013). https:\/\/doi.org\/10.1007\/s10107-012-0528-9","journal-title":"Math. Program."},{"key":"2523_CR9","doi-asserted-by":"publisher","first-page":"6080","DOI":"10.1109\/TSP.2022.3229635","volume":"70","author":"A Gang","year":"2022","unstructured":"Gang, A., Bajwa, W.U.: FAST-PCA: a fast and exact algorithm for distributed principal component analysis. IEEE Trans. Signal Process. 70, 6080\u20136095 (2022). https:\/\/doi.org\/10.1109\/TSP.2022.3229635","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"2523_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/16M1098759","volume":"28","author":"B Gao","year":"2018","unstructured":"Gao, B., Liu, X., Chen, X., Yuan, Y.X.: A new first-order algorithmic framework for optimization problems with orthogonality constraints. SIAM J. Optim. 28(1), 302\u2013332 (2018). https:\/\/doi.org\/10.1137\/16M1098759","journal-title":"SIAM J. Optim."},{"key":"2523_CR11","first-page":"6453","volume":"33","author":"A Grammenos","year":"2020","unstructured":"Grammenos, A., Mendoza Smith, R., Crowcroft, J., Mascolo, C.: Federated principal component analysis. Adv. Neural Inf. Process. Syst. 33, 6453\u20136464 (2020)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2523_CR12","unstructured":"Li, X., Wang, S., Chen, K., Zhang, Z.: Communication-efficient distributed SVD via local power iterations. In: International conference on machine learning (ICML), pp 6504\u20136514. PMLR (2021). https:\/\/proceedings.mlr.press\/v139\/li21u.html"},{"key":"2523_CR13","doi-asserted-by":"crossref","unstructured":"Liu, B., Tang, Q.: Privacy-preserving decentralised singular value decomposition. In: International conference on information and communications security (ICICS), pp 703\u2013721. Springer (2019). 10.1007\/978-3-030-41579-2_41","DOI":"10.1007\/978-3-030-41579-2_41"},{"issue":"3","key":"2523_CR14","doi-asserted-by":"publisher","first-page":"A1641","DOI":"10.1137\/120871328","volume":"35","author":"X Liu","year":"2013","unstructured":"Liu, X., Wen, Z., Zhang, Y.: Limited memory block Krylov subspace optimization for computing dominant singular value decompositions. SIAM J. Sci. Comput. 35(3), A1641\u2013A1668 (2013). https:\/\/doi.org\/10.1137\/120871328","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2523_CR15","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1137\/140971464","volume":"25","author":"X Liu","year":"2015","unstructured":"Liu, X., Wen, Z., Zhang, Y.: An efficient Gauss-Newton algorithm for symmetric low-rank product matrix approximations. SIAM J. Optim. 25(3), 1571\u20131608 (2015). https:\/\/doi.org\/10.1137\/140971464","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2523_CR16","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1287\/moor.2018.0939","volume":"44","author":"YF Liu","year":"2019","unstructured":"Liu, Y.F., Liu, X., Ma, S.: On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming. Math. Oper. Res. 44(2), 632\u2013650 (2019). https:\/\/doi.org\/10.1287\/moor.2018.0939","journal-title":"Math. Oper. Res."},{"issue":"7","key":"2523_CR17","doi-asserted-by":"publisher","first-page":"2154","DOI":"10.1109\/TCYB.2017.2728644","volume":"48","author":"Y Lou","year":"2017","unstructured":"Lou, Y., Yu, L., Wang, S., Yi, P.: Privacy preservation in distributed subgradient optimization algorithms. IEEE Trans. Cybern. 48(7), 2154\u20132165 (2017). https:\/\/doi.org\/10.1109\/TCYB.2017.2728644","journal-title":"IEEE Trans. Cybern."},{"key":"2523_CR18","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., Arcas, B.A.Y.: Communication-efficient learning of deep networks from decentralized data. In: International conference on artificial intelligence and statistics (AISTATS), vol.\u00a054, pp 1273\u20131282. PMLR (2017). https:\/\/proceedings.mlr.press\/v54\/mcmahan17a.html"},{"issue":"1","key":"2523_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TAC.1981.1102568","volume":"26","author":"B Moore","year":"1981","unstructured":"Moore, B.: Principal component analysis in linear systems: controllability, observability, and model reduction. IEEE Trans. Autom. Control 26(1), 17\u201332 (1981). https:\/\/doi.org\/10.1109\/TAC.1981.1102568","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"2523_CR20","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF02219773","volume":"16","author":"H Rutishauser","year":"1970","unstructured":"Rutishauser, H.: Simultaneous iteration method for symmetric matrices. Numer. Math. 16(3), 205\u2013223 (1970). https:\/\/doi.org\/10.1007\/BF02219773","journal-title":"Numer. Math."},{"issue":"23","key":"2523_CR21","doi-asserted-by":"publisher","first-page":"6379","DOI":"10.1109\/TSP.2015.2465300","volume":"63","author":"ID Schizas","year":"2015","unstructured":"Schizas, I.D., Aduroja, A.: A distributed framework for dimensionality reduction and denoising. IEEE Trans. Signal Process. 63(23), 6379\u20136394 (2015). https:\/\/doi.org\/10.1109\/TSP.2015.2465300","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"2523_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF01462265","volume":"25","author":"GW Stewart","year":"1976","unstructured":"Stewart, G.W.: Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices. Numer. Math. 25(2), 123\u2013136 (1976). https:\/\/doi.org\/10.1007\/BF01462265","journal-title":"Numer. Math."},{"issue":"2","key":"2523_CR23","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/355945.355948","volume":"7","author":"WJ Stewart","year":"1981","unstructured":"Stewart, W.J., Jennings, A.: A simultaneous iteration algorithm for real matrices. ACM Trans. Math. Softw. 7(2), 184\u2013198 (1981). https:\/\/doi.org\/10.1145\/355945.355948","journal-title":"ACM Trans. Math. Softw."},{"key":"2523_CR24","unstructured":"Turk, M.A., Pentland, A.P.: Face recognition using eigenfaces. In: Computer society conference on computer vision and pattern recognition (CVPR), pp 586\u2013591. IEEE (1991). 10.1109\/CVPR.1991.139758"},{"issue":"3","key":"2523_CR25","doi-asserted-by":"publisher","first-page":"508","DOI":"10.4208\/csiam-am.SO-2020-0008","volume":"2","author":"L Wang","year":"2021","unstructured":"Wang, L., Gao, B., Liu, X.: Multipliers correction methods for optimization problems over the Stiefel manifold. CSIAM Trans. Appl. Math. 2(3), 508\u2013531 (2021). https:\/\/doi.org\/10.4208\/csiam-am.SO-2020-0008","journal-title":"CSIAM Trans. Appl. Math."},{"key":"2523_CR26","doi-asserted-by":"publisher","first-page":"3029","DOI":"10.1109\/TSP.2022.3182883","volume":"70","author":"L Wang","year":"2022","unstructured":"Wang, L., Liu, X.: Decentralized optimization over the Stiefel manifold by an approximate augmented Lagrangian function. IEEE Trans. Signal Process. 70, 3029\u20133041 (2022). https:\/\/doi.org\/10.1109\/TSP.2022.3182883","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"2523_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78(1), 29\u201363 (2019). https:\/\/doi.org\/10.1007\/s10915-018-0757-z","journal-title":"J. Sci. Comput."},{"issue":"238","key":"2523_CR28","first-page":"1","volume":"22","author":"H Ye","year":"2021","unstructured":"Ye, H., Zhang, T.: DeEPCA: decentralized exact PCA with linear convergence rate. J. Mach. Learn. Res. 22(238), 1\u201327 (2021)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"2523_CR29","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1109\/TIFS.2018.2855169","volume":"14","author":"C Zhang","year":"2018","unstructured":"Zhang, C., Ahmad, M., Wang, Y.: ADMM based privacy-preserving decentralized optimization. IEEE Trans. Inf. Forensics Secur. 14(3), 565\u2013580 (2018). https:\/\/doi.org\/10.1109\/TIFS.2018.2855169","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"1","key":"2523_CR30","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10107-019-01418-8","volume":"184","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Ma, S., Zhang, S.: Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis. Math. Program. 184(1), 445\u2013490 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01418-8","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02523-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02523-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02523-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T18:06:03Z","timestamp":1730484363000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02523-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,14]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2523"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02523-1","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,14]]},"assertion":[{"value":"8 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}