{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T18:11:47Z","timestamp":1776449507376,"version":"3.51.2"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:00:00Z","timestamp":1726012800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T00:00:00Z","timestamp":1726012800000},"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":["12261026"],"award-info":[{"award-number":["12261026"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s11075-024-01921-w","type":"journal-article","created":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T06:06:21Z","timestamp":1726034781000},"page":"1463-1501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A trust-region framework for iteration solution of the direct INDSCAL problem in metric multidimensional scaling"],"prefix":"10.1007","volume":"99","author":[{"given":"Xue-lin","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao-qian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,11]]},"reference":[{"key":"1921_CR1","unstructured":"Absil, P.-A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Riemannian manifolds with applications in numerical linear algebra. In: Proceedings of the 16th International Symposium on Mathematical Theory of Networks and Systems (MTNS2004), Leuven, Belgium, pp. 5\u20139 (2004)"},{"issue":"3","key":"1921_CR2","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":"1921_CR3","doi-asserted-by":"crossref","unstructured":"Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press (2009)","DOI":"10.1515\/9781400830244"},{"key":"1921_CR4","doi-asserted-by":"crossref","unstructured":"Absil, P.-A., Mahony, R., Trumpf, J.: An extrinsic look at the Riemannian hessian. In: International Conference on Geometric Science of Information, pp. 361\u2013368. Springer (2013)","DOI":"10.1007\/978-3-642-40020-9_39"},{"issue":"4","key":"1921_CR5","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1093\/imanum\/drn029","volume":"28","author":"CG Baker","year":"2008","unstructured":"Baker, C.G., Absil, P.-A., Gallivan, K.A.: An implicit trust-region method on Riemannian manifolds. IMA J. Numer. Anal. 28(4), 665\u2013689 (2008)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"1921_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF02294465","volume":"56","author":"JMFT Berge","year":"1991","unstructured":"Berge, J.M.F.T., Kiers, H.A.L.: Some clarifications of the CANDECOMP algorithm applied to INDSCAL. Psychometrika 56(2), 317\u2013326 (1991)","journal-title":"Psychometrika"},{"issue":"4","key":"1921_CR7","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF02294409","volume":"53","author":"JMFT Berge","year":"1988","unstructured":"Berge, J.M.F.T., Kiers, H.A.L., De Leeuw, J.: Explicit CANDECOMP\/PARAFAC solutions for a contrived 2$$\\times $$ 2$$\\times $$ 2 array of rank three. Psychometrika 53(4), 579\u2013583 (1988)","journal-title":"Psychometrika"},{"issue":"1","key":"1921_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF02638456","volume":"10","author":"JMFT Berge","year":"1993","unstructured":"Berge, J.M.F.T., Kiers, H.A.L., Krijnen, W.P.: Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL. J. Classif. 10(1), 115\u2013124 (1993)","journal-title":"J. Classif."},{"key":"1921_CR9","doi-asserted-by":"crossref","unstructured":"Borg, I., Groenen, P.J., Mair, P.: Applied Multidimensional Scaling. Springer Science & Business Media (2012)","DOI":"10.1007\/978-3-642-31848-1"},{"issue":"1","key":"1921_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/18M1232838","volume":"41","author":"F Bouchard","year":"2020","unstructured":"Bouchard, F., Afsari, B., Malick, J., Congedo, M.: Approximate joint diagonalization with Riemannian optimization on the general linear group. SIAM J. Matrix Anal. Appl. 41(1), 152\u2013170 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1921_CR11","unstructured":"Boumal, N., Absil, P.-a.: RTRMC: A Riemannian trust-region method for low-rank matrix completion. In: Advances in Neural Information Processing Systems, pp. 406\u2013414 (2011)"},{"issue":"1","key":"1921_CR12","first-page":"1455","volume":"15","author":"N Boumal","year":"2014","unstructured":"Boumal, N., Mishra, B., Absil, P.-A., Sepulchre, R.: Manopt, a Matlab toolbox for optimization on manifolds. J. Mach. Learn. Res. 15(1), 1455\u20131459 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1921_CR13","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF01896985","volume":"4","author":"MW Browne","year":"1987","unstructured":"Browne, M.W.: The Young-Householder algorithm and the least squares multidimensional scaling of squared distances. J. Classif. 4, 175\u2013190 (1987)","journal-title":"J. Classif."},{"issue":"3","key":"1921_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"JD Carroll","year":"1970","unstructured":"Carroll, J.D., Chang, J.-J.: Analysis of individual differences in multidimensional scaling via an N-way generalization of \u201cEckart-Young\u2019\u2019 decomposition. Psychometrika 35(3), 283\u2013319 (1970)","journal-title":"Psychometrika"},{"key":"1921_CR15","doi-asserted-by":"crossref","unstructured":"Chatfield, C.: Introduction to Multivariate Analysis. Routledge (2018)","DOI":"10.1201\/9780203749999"},{"issue":"2","key":"1921_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0169-7439(02)00013-8","volume":"62","author":"P Courcoux","year":"2002","unstructured":"Courcoux, P., Devaux, M.-F., Bouchet, B.: Simultaneous decomposition of multivariate images using three-way data analysis: Application to the comparison of cereal grains by confocal laser scanning microscopy. Chemom. Intell. Lab. Syst. 62(2), 103\u2013113 (2002)","journal-title":"Chemom. Intell. Lab. Syst."},{"key":"1921_CR17","doi-asserted-by":"crossref","unstructured":"Cox, T.F., Cox, M.A.: Multidimensional Scaling. CRC press (2000)","DOI":"10.1201\/9780367801700"},{"key":"1921_CR18","unstructured":"De\u00a0Lathauwer, L.: Signal Processing based on Multilinear Algebra. Katholieke Universiteit Leuven Leuven (1997)"},{"issue":"4","key":"1921_CR19","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1109\/TSP.2013.2295553","volume":"62","author":"X Dong","year":"2013","unstructured":"Dong, X., Frossard, P., Vandergheynst, P., Nefedov, N.: Clustering on multi-layer graphs via subspace analysis on Grassmann manifolds. IEEE Trans. Signal Process. 62(4), 905\u2013918 (2013)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"1921_CR20","doi-asserted-by":"publisher","first-page":"e2175","DOI":"10.1002\/nla.2175","volume":"25","author":"G Heidel","year":"2018","unstructured":"Heidel, G., Schulz, V.: A Riemannian trust-region method for low-rank tensor completion. Numer. Linear Algebra Appl. 25(6), e2175 (2018)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"1","key":"1921_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1137\/090764827","volume":"32","author":"M Ishteva","year":"2011","unstructured":"Ishteva, M., Absil, P.-A., Van Huffel, S., De Lathauwer, L.: Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme. SIAM J. Matrix Anal. Appl. 32(1), 115\u2013135 (2011)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"3","key":"1921_CR22","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"3","key":"1921_CR23","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s11336-008-9056-1","volume":"73","author":"WP Krijnen","year":"2008","unstructured":"Krijnen, W.P., Dijkstra, T.K., Stegeman, A.: On the non-existence of optimal solutions and the occurrence of \u201cdegeneracy\u2019\u2019 in the CANDECOMP\/PARAFAC model. Psychometrika 73(3), 431\u2013439 (2008)","journal-title":"Psychometrika"},{"key":"1921_CR24","unstructured":"Lebanon, G.: Riemannian Geometry and Statistical Machine Learning. Carnegie Mellon University (2005)"},{"key":"1921_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10915-019-01102-1","volume":"82","author":"J-F Li","year":"2020","unstructured":"Li, J.-F., Li, W., Vong, S.-W., Luo, Q.-L., 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":"1921_CR26","doi-asserted-by":"crossref","unstructured":"Li, J.-f., Wang, K., Liu, Y.-y., Duan, X.-F., Zhou, X.-l.: A trust-region method for the parameterized generalized eigenvalue problem with nonsquare matrix pencils. Numer. Linear Algebra Appl. 28(4), e2363 (2021)","DOI":"10.1002\/nla.2363"},{"issue":"3","key":"1921_CR27","first-page":"1882","volume":"69","author":"MM Mohades","year":"2021","unstructured":"Mohades, M.M., Kahaei, M.H.: An efficient Riemannian gradient based algorithm for max-cut problems. IEEE Trans. Circuits Syst. II Express Briefs 69(3), 1882\u20131886 (2021)","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"1921_CR28","doi-asserted-by":"publisher","first-page":"13","DOI":"10.14495\/jsiaml.7.13","volume":"7","author":"H Sato","year":"2015","unstructured":"Sato, H.: Joint singular value decomposition algorithm based on the Riemannian trust-region method. JSIAM Letters 7, 13\u201316 (2015)","journal-title":"JSIAM Letters"},{"issue":"2","key":"1921_CR29","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TAC.2017.2723259","volume":"63","author":"K Sato","year":"2018","unstructured":"Sato, K., Sato, H.: Structure-preserving $$H^2$$ optimal model reduction based on the Riemannian trust-region method. IEEE Trans. Autom. Control 63(2), 505\u2013512 (2018)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"1921_CR30","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00180-010-0184-6","volume":"25","author":"Y Takane","year":"2010","unstructured":"Takane, Y., Jung, K., Hwang, H.: An acceleration method for Ten Berge et al.\u2019s algorithm for orthogonal INDSCAL. Comput. Stat. 25(3), 409\u2013428 (2010)","journal-title":"Comput. Stat."},{"key":"1921_CR31","doi-asserted-by":"crossref","unstructured":"Trendafilov, N., Gallo, M.: Multivariate Data Analysis on Matrix Manifolds (with Manopt). Springer (2021)","DOI":"10.1007\/978-3-030-76974-1"},{"issue":"2","key":"1921_CR32","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1014882518644","volume":"12","author":"NT Trendafilov","year":"2002","unstructured":"Trendafilov, N.T.: GIPSCAL revisited. A projected gradient approach. Stat. Comput. 12(2), 135\u2013145 (2002)","journal-title":"Stat. Comput."},{"issue":"3","key":"1921_CR33","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1198\/106186006X130828","volume":"15","author":"NT Trendafilov","year":"2006","unstructured":"Trendafilov, N.T.: The dynamical system approach to multivariate data analysis. J. Comput. Graph. Stat. 15(3), 628\u2013650 (2006)","journal-title":"J. Comput. Graph. Stat."},{"issue":"2","key":"1921_CR34","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s11222-011-9235-2","volume":"22","author":"NT Trendafilov","year":"2012","unstructured":"Trendafilov, N.T.: DINDSCAL: direct INDSCAL. Stat. Comput. 22(2), 445\u2013454 (2012)","journal-title":"Stat. Comput."},{"issue":"2","key":"1921_CR35","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. SIAM J. Optim. 23(2), 1214\u20131236 (2013)","journal-title":"SIAM J. Optim."},{"key":"1921_CR36","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."},{"issue":"4","key":"1921_CR37","doi-asserted-by":"publisher","first-page":"2258","DOI":"10.1016\/j.jfranklin.2019.01.024","volume":"356","author":"P Yang","year":"2019","unstructured":"Yang, P., Jiang, Y.-L., Xu, K.-L.: A trust-region method for $$H_2$$ model reduction of bilinear systems on the Stiefel manifold. J. Franklin Inst. 356(4), 2258\u20132273 (2019)","journal-title":"J. Franklin Inst."},{"issue":"3","key":"1921_CR38","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1080\/01630563.2011.618961","volume":"33","author":"L-H Zhang","year":"2012","unstructured":"Zhang, L.-H.: Riemannian trust-region method for the maximal correlation problem. Numer. Funct. Anal. Optim. 33(3), 338\u2013362 (2012)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"3","key":"1921_CR39","doi-asserted-by":"publisher","first-page":"C265","DOI":"10.1137\/130932934","volume":"36","author":"X Zhang","year":"2014","unstructured":"Zhang, X., Zhu, J., Wen, Z., Zhou, A.: Gradient type optimization methods for electronic structure calculations. SIAM J. Sci. Comput. 36(3), C265\u2013C289 (2014)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01921-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-024-01921-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-024-01921-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T04:43:21Z","timestamp":1750135401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-024-01921-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,11]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["1921"],"URL":"https:\/\/doi.org\/10.1007\/s11075-024-01921-w","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-4150356\/v1","asserted-by":"object"}]},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,11]]},"assertion":[{"value":"22 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2024","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":"Ethics approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}