{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T00:50:45Z","timestamp":1768783845075,"version":"3.49.0"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T00:00:00Z","timestamp":1681257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T00:00:00Z","timestamp":1681257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971466"],"award-info":[{"award-number":["11971466"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991020"],"award-info":[{"award-number":["11991020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12125108"],"award-info":[{"award-number":["12125108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991021"],"award-info":[{"award-number":["11991021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12288201"],"award-info":[{"award-number":["12288201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research Program of Frontier Sciences, Chinese Academy of Sciences","award":["ZDBS-LY-7022"],"award-info":[{"award-number":["ZDBS-LY-7022"]}]},{"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"}]},{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["2020YFA0711904"],"award-info":[{"award-number":["2020YFA0711904"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10589-023-00481-4","type":"journal-article","created":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T11:02:52Z","timestamp":1681297372000},"page":"1033-1072","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A communication-efficient and privacy-aware distributed algorithm for sparse PCA"],"prefix":"10.1007","volume":"85","author":[{"given":"Lei","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5705-0805","authenticated-orcid":false,"given":"Xin","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,12]]},"reference":[{"issue":"12","key":"481_CR1","doi-asserted-by":"publisher","first-page":"1625","DOI":"10.1109\/TMI.2007.898808","volume":"26","author":"K Sjostrand","year":"2007","unstructured":"Sjostrand, K., Rostrup, E., Ryberg, C., Larsen, R., Studholme, C., Baezner, H., Ferro, J., Fazekas, F., Pantoni, L., Inzitari, D., et al.: Sparse decomposition and modeling of anatomical shape variation. IEEE Trans. Med. Imaging 26(12), 1625\u20131635 (2007). https:\/\/doi.org\/10.1109\/TMI.2007.898808","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"30","key":"481_CR2","doi-asserted-by":"publisher","first-page":"12253","DOI":"10.1073\/pnas.1304376110","volume":"110","author":"G Chen","year":"2013","unstructured":"Chen, G., Sullivan, P.F., Kosorok, M.R.: Biclustering with heterogeneous variance. Proc. Natl. Acad. Sci. 110(30), 12253\u201312258 (2013). https:\/\/doi.org\/10.1073\/pnas.1304376110","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"486","key":"481_CR3","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1198\/jasa.2009.0121","volume":"104","author":"IM Johnstone","year":"2009","unstructured":"Johnstone, I.M., Lu, A.Y.: On consistency and sparsity for principal components analysis in high dimensions. J. Am. Stat. Assoc. 104(486), 682\u2013693 (2009)","journal-title":"J. Am. Stat. Assoc."},{"issue":"8","key":"481_CR4","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1109\/JPROC.2018.2846588","volume":"106","author":"H Zou","year":"2018","unstructured":"Zou, H., Xue, L.: A selective overview of sparse principal component analysis. Proc. IEEE 106(8), 1311\u20131320 (2018). https:\/\/doi.org\/10.1109\/JPROC.2018.2846588","journal-title":"Proc. IEEE"},{"issue":"3","key":"481_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.xinn.2021.100141","volume":"2","author":"T Wu","year":"2021","unstructured":"Wu, T., Hu, E., Xu, S., Chen, M., Guo, P., Dai, Z., Feng, T., Zhou, L., Tang, W., Zhan, L., et al.: ClusterProfiler 4.0: A universal enrichment tool for interpreting omics data. The Innovation 2(3), 100141 (2021). https:\/\/doi.org\/10.1016\/j.xinn.2021.100141","journal-title":"The Innovation"},{"issue":"17","key":"481_CR6","doi-asserted-by":"publisher","first-page":"6344","DOI":"10.1073\/pnas.0712026105","volume":"105","author":"K Gravuer","year":"2008","unstructured":"Gravuer, K., Sullivan, J.J., Williams, P.A., Duncan, R.P.: Strong human association with plant invasion success for Trifolium introductions to New Zealand. Proc. Natl. Acad. Sci. 105(17), 6344\u20136349 (2008). https:\/\/doi.org\/10.1073\/pnas.0712026105","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"7586","key":"481_CR7","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1038\/nature16468","volume":"529","author":"T Baden","year":"2016","unstructured":"Baden, T., Berens, P., Franke, K., Ros\u00f3n, M.R., Bethge, M., Euler, T.: The functional diversity of retinal ganglion cells in the mouse. Nature 529(7586), 345\u2013350 (2016). https:\/\/doi.org\/10.1038\/nature16468","journal-title":"Nature"},{"issue":"1","key":"481_CR8","doi-asserted-by":"publisher","first-page":"305","DOI":"10.3929\/ethz-a-000092403","volume":"8","author":"E Stiefel","year":"1935","unstructured":"Stiefel, E.: Richtungsfelder und fernparallelismus in n-dimensionalen mannigfaltigkeiten. Commentarii Mathematici Helvetici 8(1), 305\u2013353 (1935). https:\/\/doi.org\/10.3929\/ethz-a-000092403","journal-title":"Commentarii Mathematici Helvetici"},{"issue":"3","key":"481_CR9","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"IT Jolliffe","year":"2003","unstructured":"Jolliffe, I.T., Trendafilov, N.T., Uddin, M.: A modified principal component technique based on the LASSO. J. Comput. Graph. Stat. 12(3), 531\u2013547 (2003). https:\/\/doi.org\/10.1198\/1061860032148","journal-title":"J. Comput. Graph. Stat."},{"key":"481_CR10","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ipl.2017.05.008","volume":"126","author":"M Magdon-Ismail","year":"2017","unstructured":"Magdon-Ismail, M.: NP-hardness and inapproximability of sparse PCA. Inf. Process. Lett. 126, 35\u201338 (2017). https:\/\/doi.org\/10.1016\/j.ipl.2017.05.008","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"481_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Graph. Stat. 15(2), 265\u2013286 (2006). https:\/\/doi.org\/10.1198\/106186006X113430","journal-title":"J. Comput. Graph. Stat."},{"issue":"42","key":"481_CR12","first-page":"1269","volume":"9","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A., Bach, F., El Ghaoui, L.: Optimal solutions for sparse principal component analysis. J. Mach. Learn. Res. 9(42), 1269\u20131294 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"481_CR13","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/050645506","volume":"49","author":"A d\u2019Aspremont","year":"2007","unstructured":"d\u2019Aspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007). https:\/\/doi.org\/10.1137\/050645506","journal-title":"SIAM Rev."},{"issue":"6","key":"481_CR14","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1016\/j.jmva.2007.06.007","volume":"99","author":"H Shen","year":"2008","unstructured":"Shen, H., Huang, J.Z.: Sparse principal component analysis via regularized low rank matrix approximation. J. Multivar. Anal. 99(6), 1015\u20131034 (2008). https:\/\/doi.org\/10.1016\/j.jmva.2007.06.007","journal-title":"J. Multivar. Anal."},{"issue":"3","key":"481_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1093\/biostatistics\/kxp008","volume":"10","author":"DM Witten","year":"2009","unstructured":"Witten, D.M., Tibshirani, R., Hastie, T.: A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics 10(3), 515\u2013534 (2009). https:\/\/doi.org\/10.1093\/biostatistics\/kxp008","journal-title":"Biostatistics"},{"key":"481_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/C2009-0-18471-4","volume-title":"An Introduction to Parallel Programming","author":"PS Pacheco","year":"2011","unstructured":"Pacheco, P.S.: An Introduction to Parallel Programming. Elsevier, USA (2011). https:\/\/doi.org\/10.1016\/C2009-0-18471-4"},{"key":"481_CR17","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., Arcas, B.A.y.: Communication-efficient learning of deep networks from decentralized data. In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, vol. 54, pp. 1273\u20131282 (2017). PMLR. https:\/\/proceedings.mlr.press\/v54\/mcmahan17a.html"},{"issue":"7","key":"481_CR18","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. Cybernetics 48(7), 2154\u20132165 (2017). https:\/\/doi.org\/10.1109\/TCYB.2017.2728644","journal-title":"IEEE Trans. Cybernetics"},{"issue":"3","key":"481_CR19","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":"3","key":"481_CR20","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/78.984753","volume":"50","author":"JH Manton","year":"2002","unstructured":"Manton, J.H.: Optimization algorithms exploiting unitary constraints. IEEE Trans. Signal Process. 50(3), 635\u2013650 (2002). https:\/\/doi.org\/10.1109\/78.984753","journal-title":"IEEE Trans. Signal Process."},{"key":"481_CR21","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.neucom.2004.11.035","volume":"67","author":"Y Nishimori","year":"2005","unstructured":"Nishimori, Y., Akaho, S.: Learning algorithms utilizing quasi-geodesic flows on the Stiefel manifold. Neurocomputing 67, 106\u2013135 (2005). https:\/\/doi.org\/10.1016\/j.neucom.2004.11.035","journal-title":"Neurocomputing"},{"issue":"3","key":"481_CR22","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1109\/tsp.2007.908999","volume":"56","author":"TE Abrudan","year":"2008","unstructured":"Abrudan, T.E., Eriksson, J., Koivunen, V.: Steepest descent algorithms for optimization under unitary matrix constraint. IEEE Trans. Signal Process. 56(3), 1134\u20131147 (2008). https:\/\/doi.org\/10.1109\/tsp.2007.908999","journal-title":"IEEE Trans. Signal Process."},{"key":"481_CR23","doi-asserted-by":"publisher","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008). https:\/\/doi.org\/10.1515\/9781400830244","DOI":"10.1515\/9781400830244"},{"issue":"2","key":"481_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303\u2013353 (1998). https:\/\/doi.org\/10.1137\/S0895479895290954","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"481_CR25","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10589-015-9801-1","volume":"64","author":"H Sato","year":"2016","unstructured":"Sato, H.: A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions. Comput. Optim. Appl. 64(1), 101\u2013118 (2016). https:\/\/doi.org\/10.1007\/s10589-015-9801-1","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"481_CR26","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10589-016-9883-4","volume":"67","author":"X Zhu","year":"2017","unstructured":"Zhu, X.: A Riemannian conjugate gradient method for optimization on the Stiefel manifold. Comput. Optim. Appl. 67(1), 73\u2013110 (2017). https:\/\/doi.org\/10.1007\/s10589-016-9883-4","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"481_CR27","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Math. Program. 142(1\u20132), 397\u2013434 (2013). https:\/\/doi.org\/10.1007\/s10107-012-0584-1","journal-title":"Math. Program."},{"issue":"2","key":"481_CR28","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10107-014-0816-7","volume":"153","author":"B Jiang","year":"2015","unstructured":"Jiang, B., Dai, Y.-H.: A framework of constraint preserving update schemes for optimization on Stiefel manifold. Math. Program. 153(2), 535\u2013575 (2015). https:\/\/doi.org\/10.1007\/s10107-014-0816-7","journal-title":"Math. Program."},{"issue":"3","key":"481_CR29","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1137\/17M1142478","volume":"39","author":"J Hu","year":"2018","unstructured":"Hu, J., Milzarek, A., Wen, Z., Yuan, Y.: Adaptive quadratically regularized Newton method for Riemannian optimization. SIAM J. Matrix Anal. Appl. 39(3), 1181\u20131207 (2018). https:\/\/doi.org\/10.1137\/17M1142478","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"481_CR30","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1137\/18M121112X","volume":"41","author":"J Hu","year":"2019","unstructured":"Hu, J., Jiang, B., Lin, L., Wen, Z., Yuan, Y.-X.: Structured quasi-Newton methods for optimization with orthogonality constraints. SIAM J. Sci. Comput. 41(4), 2239\u20132269 (2019). https:\/\/doi.org\/10.1137\/18M121112X","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"481_CR31","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"P-A Absil","year":"2006","unstructured":"Absil, P.-A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7(3), 303\u2013330 (2006). https:\/\/doi.org\/10.1007\/s10208-005-0179-9","journal-title":"Found. Comput. Math."},{"issue":"1","key":"481_CR32","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."},{"issue":"3","key":"481_CR33","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. Mathemat. 2(3), 508\u2013531 (2021). https:\/\/doi.org\/10.4208\/csiam-am.SO-2020-0008","journal-title":"CSIAM Trans. Appl. Mathemat."},{"issue":"3","key":"481_CR34","doi-asserted-by":"publisher","first-page":"1949","DOI":"10.1137\/18m1221679","volume":"41","author":"B Gao","year":"2019","unstructured":"Gao, B., Liu, X., Yuan, Y.-X.: Parallelizable algorithms for optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 41(3), 1949\u20131983 (2019). https:\/\/doi.org\/10.1137\/18m1221679","journal-title":"SIAM J. Sci. Comput."},{"key":"481_CR35","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2020.1852236","author":"N Xiao","year":"2020","unstructured":"Xiao, N., Liu, X., Yuan, Y.-X.: A class of smooth exact penalty function methods for optimization problems with orthogonality constraints. Optimiz. Methods Software (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1852236","journal-title":"Optimiz. Methods Software"},{"issue":"1","key":"481_CR36","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1022675100677","volume":"97","author":"O Ferreira","year":"1998","unstructured":"Ferreira, O., Oliveira, P.: Subgradient algorithm on Riemannian manifolds. J. Optim. Theory Appl. 97(1), 93\u2013104 (1998). https:\/\/doi.org\/10.1023\/A:1022675100677","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"481_CR37","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1080\/02331934.2018.1542532","volume":"68","author":"OP Ferreira","year":"2019","unstructured":"Ferreira, O.P., Louzeiro, M.S., Prudente, L.F.: Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature. Optimization 68(4), 713\u2013729 (2019). https:\/\/doi.org\/10.1080\/02331934.2018.1542532","journal-title":"Optimization"},{"issue":"1","key":"481_CR38","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1137\/15M101988X","volume":"38","author":"M Bac\u00e1k","year":"2016","unstructured":"Bac\u00e1k, M., Bergmann, R., Steidl, G., Weinmann, A.: A second order nonsmooth variational model for restoring manifold-valued images. SIAM J. Sci. Comput. 38(1), 567\u2013597 (2016). https:\/\/doi.org\/10.1137\/15M101988X","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"481_CR39","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1093\/imanum\/drv043","volume":"36","author":"P Grohs","year":"2016","unstructured":"Grohs, P., Hosseini, S.: Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds. IMA J. Numer. Anal. 36(3), 1167\u20131192 (2016). https:\/\/doi.org\/10.1093\/imanum\/drv043","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"481_CR40","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1137\/16M1069298","volume":"27","author":"S Hosseini","year":"2017","unstructured":"Hosseini, S., Uschmajew, A.: A Riemannian gradient sampling algorithm for non smooth optimization on manifolds. SIAM J. Optim. 27(1), 173\u2013189 (2017). https:\/\/doi.org\/10.1137\/16M1069298","journal-title":"SIAM J. Optim."},{"issue":"1","key":"481_CR41","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/18M122457X","volume":"30","author":"S Chen","year":"2020","unstructured":"Chen, S., Ma, S., Man-Cho So, A., Zhang, T.: Proximal gradient method for non smooth optimization over the Stiefel manifold. SIAM J. Optim. 30(1), 210\u2013239 (2020). https:\/\/doi.org\/10.1137\/18M122457X","journal-title":"SIAM J. Optim."},{"key":"481_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01632-3","author":"W Huang","year":"2021","unstructured":"Huang, W., Wei, K.: Riemannian proximal gradient methods. Mathemat. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-021-01632-3","journal-title":"Program."},{"issue":"1","key":"481_CR43","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s10915-017-0624-3","volume":"76","author":"X Xiao","year":"2018","unstructured":"Xiao, X., Li, Y., Wen, Z., Zhang, L.: A regularized semi-smooth Newton method with projection steps for composite convex programs. J. Sci. Comput. 76(1), 364\u2013389 (2018)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"481_CR44","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10915-013-9740-x","volume":"58","author":"R Lai","year":"2014","unstructured":"Lai, R., Osher, S.: A splitting method for orthogonality constrained problems. J. Sci. Comput. 58(2), 431\u2013449 (2014). https:\/\/doi.org\/10.1007\/s10915-013-9740-x","journal-title":"J. Sci. Comput."},{"key":"481_CR45","doi-asserted-by":"crossref","unstructured":"Kovnatsky, A., Glashoff, K., Bronstein, M.M.: MADMM: A generic algorithm for non-smooth optimization on manifolds. In: European conference on computer vision, pp. 680\u2013696 (2016). Springer","DOI":"10.1007\/978-3-319-46454-1_41"},{"issue":"4","key":"481_CR46","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1137\/140988875","volume":"38","author":"W Chen","year":"2016","unstructured":"Chen, W., Ji, H., You, Y.: An augmented lagrangian method for $$\\ell _{1}$$-regularized optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 38(4), 570\u2013592 (2016). https:\/\/doi.org\/10.1137\/140988875","journal-title":"SIAM J. Sci. Comput."},{"key":"481_CR47","doi-asserted-by":"publisher","unstructured":"Hajinezhad, D., Hong, M.: Nonconvex alternating direction method of multipliers for distributed sparse principal component analysis. In: 2015 IEEE global conference on signal and information processing, pp. 255\u2013259 (2015). https:\/\/doi.org\/10.1109\/GlobalSIP.2015.7418196","DOI":"10.1109\/GlobalSIP.2015.7418196"},{"key":"481_CR48","unstructured":"Wang, L., Liu, X., Zhang, Y.: A distributed and secure algorithm for computing dominant SVD based on projection splitting. arXiv:2012.03461 (2020)"},{"key":"481_CR49","unstructured":"Gemp, I., McWilliams, B., Vernade, C., Graepel, T.: Eigengame: PCA as a nash equilibrium. arXiv:2010.00554 (2020)"},{"key":"481_CR50","doi-asserted-by":"crossref","unstructured":"Gang, A., Bajwa, W.U.: A linearly convergent algorithm for distributed principal component analysis. arXiv:2101.01300 (2021)","DOI":"10.1016\/j.sigpro.2021.108408"},{"key":"481_CR51","doi-asserted-by":"crossref","unstructured":"Gang, A., Bajwa, W.U.: FAST-PCA: A fast and exact algorithm for distributed principal component analysis. arXiv:2108.12373 (2021)","DOI":"10.1109\/TSP.2022.3229635"},{"key":"481_CR52","unstructured":"Andrade, F.L., Figueiredo, M.A., Xavier, J.: Distributed Picard iteration: application to distributed EM and distributed PCA. arXiv:2106.10665 (2021)"},{"issue":"238","key":"481_CR53","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."},{"key":"481_CR54","unstructured":"Chen, S., Garcia, A., Hong, M., Shahrampour, S.: Decentralized Riemannian gradient descent on the Stiefel manifold. In: proceedings of the 38th international conference on machine learning, VOL. 139, PP. 1594\u20131605 (2021). https:\/\/proceedings.mlr.press\/v139\/chen21g.html"},{"key":"481_CR55","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."},{"key":"481_CR56","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, ASIA (1990)"},{"issue":"2","key":"481_CR57","first-page":"415","volume":"10","author":"WH Yang","year":"2014","unstructured":"Yang, W.H., Zhang, L.-H., Song, R.: Optimality conditions for the nonlinear programming problems on Riemannian manifolds. Pacific J. Optim. 10(2), 415\u2013434 (2014)","journal-title":"Pacific J. Optim."},{"key":"481_CR58","unstructured":"Arrow, K.J., Azawa, H., Hurwicz, L., Uzawa, H.: Studies in Linear and Non-linear Programming vol. 2. Stanford University Press, (1958)"},{"issue":"4","key":"481_CR59","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1137\/140963467","volume":"7","author":"B He","year":"2014","unstructured":"He, B., You, Y., Yuan, X.: On the convergence of primal-dual hybrid gradient algorithm. SIAM J. Imag. Sci. 7(4), 2526\u20132537 (2014). https:\/\/doi.org\/10.1137\/140963467","journal-title":"SIAM J. Imag. Sci."},{"key":"481_CR60","unstructured":"Xiao, N., Liu, X., Yuan, Y.-x.: A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold. arXiv:2103.03514 (2021)"},{"issue":"3","key":"481_CR61","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":"2","key":"481_CR62","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s10957-017-1093-4","volume":"173","author":"GC Bento","year":"2017","unstructured":"Bento, G.C., Ferreira, O.P., Melo, J.G.: Iteration-complexity of gradient, sub gradient and proximal point methods on Riemannian manifolds. J. Optim. Theory Appl. 173(2), 548\u2013562 (2017). https:\/\/doi.org\/10.1007\/s10957-017-1093-4","journal-title":"J. Optim. Theory Appl."},{"key":"481_CR63","unstructured":"Jiang, B., Ma, S., So, A.M.-C., Zhang, S.: Vector transport-free SVRG with general retraction for Riemannian optimization: complexity analysis and practical implementation. arXiv:1705.09059 (2017)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00481-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00481-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00481-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:55:25Z","timestamp":1688489725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00481-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,12]]},"references-count":63,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["481"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00481-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,12]]},"assertion":[{"value":"20 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}