{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T04:48:42Z","timestamp":1746679722498,"version":"3.40.3"},"reference-count":82,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:00:00Z","timestamp":1739318400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T00:00:00Z","timestamp":1739318400000},"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":["12001455","12371311"],"award-info":[{"award-number":["12001455","12371311"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2023J06004"],"award-info":[{"award-number":["2023J06004"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CIBR1934157"],"award-info":[{"award-number":["CIBR1934157"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10915-025-02806-3","type":"journal-article","created":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:55:54Z","timestamp":1739343354000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Riemannian Optimization Approach to Clustering Problems"],"prefix":"10.1007","volume":"103","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8324-2416","authenticated-orcid":false,"given":"Wen","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyle A.","family":"Gallivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Van Dooren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"issue":"3","key":"2806_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"P-A Absil","year":"2007","unstructured":"Absil, P.-A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7(3), 303\u2013330 (2007)","journal-title":"Found. Comput. Math."},{"key":"2806_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)"},{"issue":"1","key":"2806_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/100802529","volume":"22","author":"P-A Absil","year":"2012","unstructured":"Absil, P.-A., Malick, J.: Projection-like retractions on matrix manifolds. SIAM J. Optim. 22(1), 135\u2013158 (2012)","journal-title":"SIAM J. Optim."},{"key":"2806_CR4","unstructured":"Bach, F.R., Jordan M.I. Learning spectral clustering. In: Proceedings of the 16th International Conference on Neural Information Processing Systems, NIPS\u201903, pp. 305\u2013312, Cambridge, MA, US. MIT Press (2003)"},{"key":"2806_CR5","unstructured":"Baker, C.G.: Riemannian manifold trust-region methods with applications to eigenproblems. PhD thesis, Florida State University, School of Computational Science (2008)"},{"issue":"1","key":"2806_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"key":"2806_CR7","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA (2017)","DOI":"10.1137\/1.9781611974997"},{"issue":"2","key":"2806_CR8","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, subgradient and proximal point methods on Riemannian manifolds. J. Optim. Theory Appl. 173(2), 548\u2013562 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"10","key":"2806_CR9","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"2806_CR10","volume-title":"An Introduction to Differentiable Manifolds and Riemannian Geometry","author":"WM Boothby","year":"1986","unstructured":"Boothby, W.M.: An Introduction to Differentiable Manifolds and Riemannian Geometry, 2nd edn. Academic Press, Cambridge (1986)","edition":"2"},{"key":"2806_CR11","doi-asserted-by":"crossref","unstructured":"Boumal, N.: An introduction to optimization on smooth manifolds (2022)","DOI":"10.1017\/9781009166164"},{"issue":"1","key":"2806_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2018","unstructured":"Boumal, N., Absil, P.A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. 39(1), 1\u201333 (2018)","journal-title":"IMA J. Numer. Anal."},{"key":"2806_CR13","unstructured":"Bounova, G.: Matlab Tools for Network Analysis (2009). http:\/\/strategic.mit.edu\/downloads.php?page=matlab_networks"},{"key":"2806_CR14","unstructured":"Boutsidis, C., Drineas, P., Mahoney, M.W.: Unsupervised feature selection for the $$ k $$-means clustering problem. In: Advances in Neural Information Processing Systems, pp. 153\u2013161 (2009)"},{"key":"2806_CR15","doi-asserted-by":"crossref","unstructured":"Carson, T., Mixon, D.G., Villar, S.: Manifold optimization for k-means clustering. In: 2017 International Conference on Sampling Theory and Applications (SampTA), pp. 73\u201377. IEEE (2017)","DOI":"10.1109\/SAMPTA.2017.8024388"},{"issue":"9","key":"2806_CR16","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1109\/43.310898","volume":"13","author":"PK Chan","year":"1994","unstructured":"Chan, P.K., Schlag, F.: Spectral k-way ratio-cut partitioning and clustering. IEEE Trans. Comput. Aided Design Integr. Circuits Syst. 13(9), 1088\u20131096 (1994)","journal-title":"IEEE Trans. Comput. Aided Design Integr. Circuits Syst."},{"key":"2806_CR17","unstructured":"Chen, M.: Pattern recognition and machine learning toolbox (2021)"},{"issue":"1","key":"2806_CR18","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/18M122457X","volume":"30","author":"S Chen","year":"2020","unstructured":"Chen, S., Ma, S., So, A.M.-C., Zhang, T.: Proximal gradient method for nonsmooth optimization over the Stiefel manifold. SIAM J. Optim. 30(1), 210\u2013239 (2020)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"2806_CR19","doi-asserted-by":"publisher","first-page":"2859","DOI":"10.1109\/TNNLS.2016.2601307","volume":"28","author":"A Cherian","year":"2017","unstructured":"Cherian, A., Sra, S.: Riemannian dictionary learning and sparse coding for positive definite matrices. IEEE Trans. Neural Netw. Learn. Syst. 28(12), 2859\u20132871 (2017)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"2806_CR20","doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and nonsmooth analysis. Classics in Applied Mathematics of SIAM (1990)","DOI":"10.1137\/1.9781611971309"},{"issue":"11","key":"2806_CR21","doi-asserted-by":"publisher","first-page":"P11010","DOI":"10.1088\/1742-5468\/2006\/11\/P11010","volume":"2006","author":"L Danon","year":"2006","unstructured":"Danon, L., Diaz-Guilera, A., Arenas, A.: The effect of size heterogeneity on community identification in complex networks. J. Stat. Mech. Theory Exp. 2006(11), P11010 (2006)","journal-title":"J. Stat. Mech. Theory Exp."},{"issue":"09","key":"2806_CR22","doi-asserted-by":"publisher","first-page":"P09008","DOI":"10.1088\/1742-5468\/2005\/09\/P09008","volume":"2005","author":"L Danon","year":"2005","unstructured":"Danon, L., Diaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech. Theory Exp. 2005(09), P09008 (2005)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"2806_CR23","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S., Guan, Y., Kulis, B.: Kernel k-means, spectral clustering and normalized cuts. In: Proceedings of the 10th Association for Computing Machinery(ACM) Special Interest Group on Knowledge Discovery and Data Mining (SIGKDD) International Conference on Knowledge Discovery and Data Mining (2004)","DOI":"10.1145\/1014052.1014118"},{"key":"2806_CR24","doi-asserted-by":"crossref","unstructured":"Dhillon, I., Guan, Y., Kulis, B.: A unified view of kernel k-means. spectral clustering and graph cuts. Technical report, Department of Computer Sciences, University of Texas at Austin (2005)","DOI":"10.1145\/1014052.1014118"},{"key":"2806_CR25","doi-asserted-by":"crossref","unstructured":"do\u00a0Carmo, M.P.: Riemannian Geometry. Mathematics: Theory & Applications (1992)","DOI":"10.1007\/978-1-4757-2201-7"},{"issue":"2","key":"2806_CR26","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":"3\u20135","key":"2806_CR27","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"2806_CR28","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix computations, 3rd edn. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press (1996)"},{"key":"2806_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-015-9426-z","author":"P Grohs","year":"2015","unstructured":"Grohs, P., Hosseini, S.: $$\\epsilon $$-subgradient algorithms for locally lipschitz functions on Riemannian manifolds. Adv. Comput. Math. (2015). https:\/\/doi.org\/10.1007\/s10444-015-9426-z","journal-title":"Adv. Comput. Math."},{"key":"2806_CR30","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drv043","author":"P Grohs","year":"2015","unstructured":"Grohs, P., Hosseini, S.: Nonsmooth trust region algorithms for locally Lipschitz functions on Riemannian manifolds. IMA J. Numer. Anal. (2015). https:\/\/doi.org\/10.1093\/imanum\/drv043","journal-title":"IMA J. Numer. Anal."},{"key":"2806_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2189-8","volume-title":"Algebraic Geometry: A First Course","author":"J Harris","year":"1992","unstructured":"Harris, J.: Algebraic Geometry: A First Course, vol. 133. Springer Science & Business Media, Berlin (1992)"},{"issue":"1","key":"2806_CR32","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: A K-means clustering algorithm. Appl. Stat. 28(1), 100\u2013108 (1979)","journal-title":"Appl. Stat."},{"issue":"1","key":"2806_CR33","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/16M1108145","volume":"28","author":"S Hosseini","year":"2018","unstructured":"Hosseini, S., Huang, W., Yousefpour, R.: Line search algorithms for locally Lipschitz functions on Riemannian manifolds. SIAM J. Optim. 28(1), 596\u2013619 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2806_CR34","doi-asserted-by":"publisher","first-page":"A2239","DOI":"10.1137\/18M121112X","volume":"41","author":"H Jiang","year":"2019","unstructured":"Jiang, H., Jiang, B., Lin, L., Wen, Z., Yuan, Y.: Structured quasi-newton methods for optimization with orthogonality constraints. SIAM J. Sci. Comput. 41(4), A2239\u2013A2269 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"2806_CR35","unstructured":"Huang, W.: Optimization algorithms on Riemannian manifolds with applications. PhD thesis, Florida State University, Department of Mathematics (2013)"},{"issue":"2","key":"2806_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-014-0765-1","volume":"150","author":"W Huang","year":"2015","unstructured":"Huang, W., Absil, P.-A., Gallivan, K.A.: A Riemannian symmetric rank-one trust-region method. Math. Program. 150(2), 179\u2013216 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"2806_CR37","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00211-016-0848-4","volume":"136","author":"W Huang","year":"2017","unstructured":"Huang, W., Absil, P.-A., Gallivan, K.A.: Intrinsic representation of tangent vectors and vector transport on matrix manifolds. Numer. Math. 136(2), 523\u2013543 (2017)","journal-title":"Numer. Math."},{"issue":"1","key":"2806_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-022-01962-0","volume":"93","author":"W Huang","year":"2022","unstructured":"Huang, W., Gallivan, K.A.: A limited-memory Riemannian symmetric rank-one trust-region method with a restart strategy. J. Sci. Comput. 93(1), 1 (2022)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2806_CR39","doi-asserted-by":"publisher","first-page":"1660","DOI":"10.1137\/140955483","volume":"25","author":"W Huang","year":"2015","unstructured":"Huang, W., Gallivan, K.A., Absil, P.-A.: A Broyden class of quasi-Newton methods for Riemannian optimization. SIAM J. Optim. 25(3), 1660\u20131685 (2015)","journal-title":"SIAM J. Optim."},{"key":"2806_CR40","unstructured":"Huang, W., Gallivan, K.A., Srivastava, A., Absil, P.-A.: Riemannian optimization for elastic shape analysis. In: Proceedings of the 21st Internaltional Symposium on Mathematical Theory of Networks and Systems (MTNS 2014) (2014)"},{"key":"2806_CR41","doi-asserted-by":"publisher","unstructured":"Huang, W., Wei, K.: Riemannian proximal gradient methods. Mathematical Programming (2021). https:\/\/doi.org\/10.1007\/s10107-021-01632-3","DOI":"10.1007\/s10107-021-01632-3"},{"issue":"1","key":"2806_CR42","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/17M1127582","volume":"28","author":"W Huang","year":"2018","unstructured":"Huang, W., Absil, P.A., Gallivan, K.A.: A Riemannian BFGS method without differentiated retraction for nonconvex optimization problems. SIAM J. Optim. 28(1), 470\u2013495 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2806_CR43","doi-asserted-by":"publisher","first-page":"2757","DOI":"10.1137\/17M1151390","volume":"11","author":"W Huang","year":"2018","unstructured":"Huang, W., Hand, P.: Blind deconvolution by a steepest descent algorithm on a quotient manifold. SIAM J. Imaging Sci. 11(4), 2757\u20132785 (2018)","journal-title":"SIAM J. Imaging Sci."},{"key":"2806_CR44","unstructured":"Huang, W., Wei, K.: An Inexact Riemannian Proximal Gradient Method (2021)"},{"key":"2806_CR45","doi-asserted-by":"publisher","first-page":"e2409","DOI":"10.1002\/nla.2409","volume":"29","author":"W Huang","year":"2021","unstructured":"Huang, W., Wei, K.: An extension of fast iterative shrinkage-thresholding algorithm to Riemannian optimization for sparse principal component analysis. Numer. Linear Algebra Appl. 29, e2409 (2021)","journal-title":"Numer. Linear Algebra Appl."},{"key":"2806_CR46","unstructured":"Jiang, B., Meng, X., Wen, Z., Chen, X.: An exact penalty approach for optimization with nonnegative orthogonality constraints (2019). CoRR, ArXiv:1907.12424"},{"issue":"3","key":"2806_CR47","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)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1","key":"2806_CR48","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"2806_CR49","unstructured":"Kehagias, A.: Community Detection Toolbox (2021). https:\/\/www.mathworks.com\/matlabcentral\/fileexchange\/45867-community-detection-toolbox"},{"issue":"4","key":"2806_CR50","doi-asserted-by":"publisher","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","volume":"78","author":"A Lancichinetti","year":"2008","unstructured":"Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"2806_CR51","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., Toh, K.-C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 28(1), 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"key":"2806_CR52","unstructured":"Macqueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley Symposium on Mathematical Statistics and Probability (1967)"},{"key":"2806_CR53","doi-asserted-by":"crossref","unstructured":"Manning, C.D.: Prabhakar Raghavan. utze, introduction to information retrieval (2008)","DOI":"10.1017\/CBO9780511809071"},{"issue":"6","key":"2806_CR54","doi-asserted-by":"publisher","first-page":"066133","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"2806_CR55","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)","journal-title":"Phys. Rev. E"},{"issue":"23","key":"2806_CR56","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"2806_CR57","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)","journal-title":"Phys. Rev. E"},{"issue":"23","key":"2806_CR58","doi-asserted-by":"publisher","first-page":"9564","DOI":"10.1073\/pnas.0610537104","volume":"104","author":"MEJ Newman","year":"2007","unstructured":"Newman, M.E.J., Leicht, E.A.: Mixture models and exploratory analysis in networks. Proc. Natl. Acad. Sci. 104(23), 9564\u20139569 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2806_CR59","unstructured":"Qian, Y., Pan, S., Xiao, L.: Exact penalty methods for minimizing a smooth function over the nonnegative orthogonal set (2021)"},{"issue":"2","key":"2806_CR60","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/11082885X","volume":"22","author":"W Ring","year":"2012","unstructured":"Ring, W., Wirth, B.: Optimization methods on Riemannian manifolds and their application to shape space. SIAM J. Optim. 22(2), 596\u2013627 (2012). https:\/\/doi.org\/10.1137\/11082885X","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2806_CR61","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105(4), 1118\u20131123 (2008)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2806_CR62","first-page":"125539","volume":"388","author":"C Samir","year":"2021","unstructured":"Samir, C., Huang, W.: Coordinate descent optimization for one-to-one correspondence and supervised classification of 3D shapes. Appl. Math. Comput. 388, 125539 (2021)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"2806_CR63","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\u2013Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions. Comput. Optim. Appl. 64(1), 101\u2013118 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2806_CR64","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/120872887","volume":"23","author":"H Sato","year":"2013","unstructured":"Sato, H., Iwai, T.: A Riemannian optimization approach to the matrix singular value decomposition. SIAM J. Optim. 23(1), 188\u2013212 (2013)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2806_CR65","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1080\/02331934.2013.836650","volume":"64","author":"H Sato","year":"2015","unstructured":"Sato, H., Iwai, T.: A new, globally convergent Riemannian conjugate gradient method. Optimization 64(4), 1011\u20131031 (2015)","journal-title":"Optimization"},{"key":"2806_CR66","unstructured":"Scherrer, A.: Matlab Version for Louvain\u2019s Algorithm (2008). https:\/\/perso.uclouvain.be\/vincent.blondel\/research\/louvain.html"},{"issue":"8","key":"2806_CR67","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2806_CR68","unstructured":"Shi, J., Cour, T., Yu, S.: Normalized Cut Segmentation Code (2004)"},{"issue":"11","key":"2806_CR69","doi-asserted-by":"publisher","first-page":"2273","DOI":"10.1109\/TPAMI.2011.52","volume":"33","author":"P Turaga","year":"2011","unstructured":"Turaga, P., Veeraraghavan, A., Srivastava, A., Chellappa, R.: Statistical computations on Grassmann and Stiefel manifolds for image and video-based recognition. IEEE Trans. Pattern Anal. Mach. Intell. 33(11), 2273\u201386 (2011). https:\/\/doi.org\/10.1109\/TPAMI.2011.52","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"2806_CR70","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1137\/110845768","volume":"23","author":"B Vandereycken","year":"2013","unstructured":"Vandereycken, B.: Low-rank matrix completion by Riemannian optimization\u2013extended version. SIAM J. Optim. 23(2), 1214\u20131236 (2013)","journal-title":"SIAM J. Optim."},{"key":"2806_CR71","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11, 2837\u20132854 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"2806_CR72","doi-asserted-by":"crossref","unstructured":"Wei, K., Cai, J.-F., Chan, T.F., Leung, S.: Guarantees of Riemannian Optimization for Low Rank Matrix Completion (1) (2016)","DOI":"10.1137\/15M1050525"},{"key":"2806_CR73","doi-asserted-by":"crossref","unstructured":"Wei, M., Huang, W., Gallivan, K.A., Van\u00a0Dooren, P.: community detection by a Riemannian projected proximal gradient method. In: Proceedings of the 24th Internaltional Symposium on Mathematical Theory of Networks and Systems (2021)","DOI":"10.1016\/j.ifacol.2021.06.115"},{"key":"2806_CR74","doi-asserted-by":"publisher","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Mathematical Programming (2012). https:\/\/doi.org\/10.1007\/s10107-012-0584-1","DOI":"10.1007\/s10107-012-0584-1"},{"issue":"4","key":"2806_CR75","doi-asserted-by":"publisher","first-page":"1712","DOI":"10.1137\/21M145313X","volume":"43","author":"G Xiao","year":"2022","unstructured":"Xiao, G., Bai, Z.-J., Ching, W.-K.: A columnwise update algorithm for sparse stochastic matrix factorization. SIAM J. Matrix Anal. Appl. 43(4), 1712\u20131735 (2022)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2806_CR76","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."},{"key":"2806_CR77","unstructured":"Yang, L., Cao, X., He, D., Wang, C., Wang, X., Zhang, W.: Modularity based community detection with deep learning. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI), vol. 16, pp. 2252\u20132258 (2016)"},{"key":"2806_CR78","volume-title":"Advances in Neural Information Processing Systems","author":"J Ye","year":"2008","unstructured":"Ye, J., Zhao, Z., Wu, M.: Discriminative k-means for clustering. In: Lyu, H., Sha, N., Qin, S., Yan, M., Xie, Y., Wang, R. (eds.) Advances in Neural Information Processing Systems, vol. 20. Curran Associates, Inc., New York (2008)"},{"issue":"3","key":"2806_CR79","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1137\/15M1054201","volume":"37","author":"K Ye","year":"2016","unstructured":"Ye, K., Lim, L.-H.: Schubert varieties and distances between subspaces of different dimensions. SIAM J. Matrix Anal. Appl. 37(3), 1176\u20131197 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2806_CR80","doi-asserted-by":"crossref","unstructured":"Yu, S.X., Shi, J.: Multiclass spectral clustering. In: Proceedings Ninth IEEE International Conference on Computer Vision, vol. 1, pp. 313\u2013319 (2003)","DOI":"10.1109\/ICCV.2003.1238361"},{"key":"2806_CR81","unstructured":"Zhang, H., Sra, S.: First-order methods for geodesically convex optimization. In: Conference on Learning Theory (2016)"},{"issue":"1","key":"2806_CR82","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)","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02806-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02806-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02806-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T02:34:02Z","timestamp":1743474842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02806-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,12]]},"references-count":82,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2806"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02806-3","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,2,12]]},"assertion":[{"value":"28 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"8"}}