{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:15:29Z","timestamp":1767183329402,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T00:00:00Z","timestamp":1700524800000},"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 Foundations of China","doi-asserted-by":"crossref","award":["11771159"],"award-info":[{"award-number":["11771159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003453","name":"Guangdong Provincial Natural Science Foundation","doi-asserted-by":"crossref","award":["2022A1515011123"],"award-info":[{"award-number":["2022A1515011123"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11075-023-01701-y","type":"journal-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:01:52Z","timestamp":1700568112000},"page":"223-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Riemannian optimization methods for the truncated Takagi factorization"],"prefix":"10.1007","volume":"97","author":[{"given":"Ling Chang","family":"Kong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao Shan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"1701_CR1","volume-title":"Matrix Analysis","author":"RA Horn","year":"1990","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge, UK (1990)"},{"key":"1701_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0377-0427(88)90386-X","volume":"21","author":"A Bunse-Gerstner","year":"1988","unstructured":"Bunse-Gerstner, A., Gragg, W.B.: Singular value decompositions of complex symmetric matrices. J. Comput. Appl. Math. 21, 41\u201354 (1988)","journal-title":"J. Comput. Appl. Math."},{"key":"1701_CR3","volume-title":"Univalent functions","author":"C Pommerenke","year":"1975","unstructured":"Pommerenke, C.: Univalent functions. Vandenhoeck & Ruprecht, G\u00f6ttingen (1975)"},{"key":"1701_CR4","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/0021-9045(81)90102-7","volume":"31","author":"L Trefethen","year":"1981","unstructured":"Trefethen, L.: Near circularity of the error curve in complex Chebyshev approximation. J. Approx. Theory 31, 344\u2013367 (1981)","journal-title":"J. Approx. Theory"},{"key":"1701_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0165-1684(94)90029-9","volume":"36","author":"P Comon","year":"1994","unstructured":"Comon, P.: Independent component analysis, a new concept? Signal Process. 36, 287\u2013314 (1994)","journal-title":"Signal Process."},{"key":"1701_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.pnmrs.2003.08.001","volume":"43","author":"AD Bain","year":"2003","unstructured":"Bain, A.D.: Chemical exchange in NMR. Prog. Nucl. Magn. Reson. Spectrosc. 43, 63\u2013103 (2003)","journal-title":"Prog. Nucl. Magn. Reson. Spectrosc."},{"key":"1701_CR7","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1137\/050624558","volume":"30","author":"W Xu","year":"2008","unstructured":"Xu, W., Qiao, S.: A divide-and-conquer method for the Takagi factorization. SIAM J. Matrix Anal. Appl. 30, 142\u2013153 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1701_CR8","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, 188\u2013212 (2013)","journal-title":"SIAM J. Optim."},{"key":"1701_CR9","doi-asserted-by":"crossref","unstructured":"Stao, H., Iwai, T.: A complex singular value decomposition algorithm based on the Riemannian Newton method. In: 52nd IEEE Conference on Decision and Control. 2972\u20132978 (2013)","DOI":"10.1109\/CDC.2013.6760335"},{"key":"1701_CR10","doi-asserted-by":"crossref","unstructured":"Sato H.: Riemannian conjugate gradient method for complex singular value decomposition problem, In: 53rd IEEE Conference on Decision and Control. 5849\u20135854 (2014)","DOI":"10.1109\/CDC.2014.7040305"},{"key":"1701_CR11","unstructured":"Bendokat, T., Zimmermann, R.: The real symplectic Stiefel and Grassmann manifolds: metrices, geodesics and applications. arXiv preprint arXiv:\u00a02018.12447 (2021)"},{"key":"1701_CR12","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1137\/20M1348522","volume":"31","author":"B Gao","year":"2021","unstructured":"Gao, B., Son, N.T., Absil, P.-A., Stykel, T.: Riemannian optimization on the Symplectic Stiefel manifold. SIAM J. Optim. 31, 1546\u20131575 (2021)","journal-title":"SIAM J. Optim."},{"key":"1701_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0024-3795(86)90265-X","volume":"83","author":"A Bunse-Gerstner","year":"1986","unstructured":"Bunse-Gerstner, A.: Matrix factorizations for symplectic QR-like methods. Linear Algebra Appl. 83, 49\u201377 (1986)","journal-title":"Linear Algebra Appl."},{"key":"1701_CR14","doi-asserted-by":"crossref","unstructured":"Absil, P., Mahony, R., Sepulchre, R.: Optimization algorithms on matrix manifolds, Princeton University Press (2008)","DOI":"10.1515\/9781400830244"},{"key":"1701_CR15","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"1701_CR16","first-page":"139","volume":"15","author":"Y Dai","year":"2002","unstructured":"Dai, Y.: A nonmonotone conjugate gradient algorithm for unconstrained optimization. J. Syst. Sci. Complex. 15, 139\u2013145 (2002)","journal-title":"J. Syst. Sci. Complex."},{"key":"1701_CR17","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, 73\u2013110 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"1701_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-019-01102-1","volume":"82","author":"J Li","year":"2020","unstructured":"Li, J., Li, W., Vong, S., Luo, Q., Xiao, M.: A Riemannian optimization approach for solving the generalized eigenvalue problem for nonsquare matrix pencils. J. Sci. Comput. 82, 1\u201343 (2020)","journal-title":"J. Sci. Comput."},{"key":"1701_CR19","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. Optim. 64, 1011\u20131013 (2015)","journal-title":"Optim."},{"key":"1701_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in matrix analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Topics in matrix analysis. Cambridge University Press, Cambridge, MA (1991)"},{"key":"1701_CR21","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, 397\u2013434 (2013)","journal-title":"Math. Program."},{"key":"1701_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1022202125077","volume":"32","author":"A Suliman","year":"2003","unstructured":"Suliman, A.: Hybrid methods for approximating Hankel matrix. Numer. Algor. 32, 57\u201366 (2003)","journal-title":"Numer. Algor."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01701-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-023-01701-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-023-01701-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:23:19Z","timestamp":1722936199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-023-01701-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,21]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["1701"],"URL":"https:\/\/doi.org\/10.1007\/s11075-023-01701-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2023,11,21]]},"assertion":[{"value":"17 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 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":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}