{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T18:11:40Z","timestamp":1785607900854,"version":"3.56.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T00:00:00Z","timestamp":1660694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T00:00:00Z","timestamp":1660694400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["NO. 20720190060"],"award-info":[{"award-number":["NO. 20720190060"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 12001455"],"award-info":[{"award-number":["No. 12001455"]}],"id":[{"id":"10.13039\/501100001809","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":[[2022,10]]},"DOI":"10.1007\/s10915-022-01962-0","type":"journal-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T06:02:41Z","timestamp":1660716161000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["A Limited-Memory Riemannian Symmetric Rank-One Trust-Region Method with a Restart Strategy"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8324-2416","authenticated-orcid":false,"given":"Wen","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kyle A.","family":"Gallivan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,17]]},"reference":[{"issue":"3","key":"1962_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":"1962_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, NJ (2008)"},{"key":"1962_CR3","unstructured":"Boothby, W.\u00a0M.: An introduction to differentiable manifolds and Riemannian geometry. Academic Press, second edition (1986)"},{"key":"1962_CR4","doi-asserted-by":"crossref","unstructured":"Brust, J, Burdakov, O, Erway, J.B., Marcia, R.F., Yuan, Y.-X.: ALGORITHM XXX: SC-SR1: MATLAB software for solving shape-changing L-SR1 trust-region subproblems. arXiv:1607.03533v2 (2018)","DOI":"10.1145\/3550269"},{"issue":"2","key":"1962_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10589-016-9868-3","volume":"66","author":"J Brust","year":"2017","unstructured":"Brust, J., Erway, J.B., Marcia, R.F.: On solving L-SR1 trust-region subproblems. Comput. Optim. Appl. 66(2), 245\u2013266 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1962_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s12532-016-0109-7","volume":"9","author":"O Burdakov","year":"2017","unstructured":"Burdakov, O., Gong, L., Zikrin, S., Yuan, Y.X.: On efficiently combining limited-memory and trust-region techniques. Math. Program. Comput. 9(1), 101\u2013134 (2017)","journal-title":"Math. Program. Comput."},{"issue":"1\u20133","key":"1962_CR7","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63(1\u20133), 129\u2013156 (1994)","journal-title":"Math. Program."},{"issue":"4","key":"1962_CR8","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1109\/TIT.2015.2399924","volume":"64","author":"EJ Cand\u00e9s","year":"2016","unstructured":"Cand\u00e9s, E.J., Li, X., Soltanolkotabi, M.: Phase retrieval via Wirtinger flow: theory and algorithms. IEEE Trans. Inf. Theory 64(4), 1985\u20132007 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1962_CR9","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. Learning Syst. 28(12), 2859\u20132871 (2017)","journal-title":"IEEE Trans. Neural Netw. Learning Syst."},{"issue":"1\u20133","key":"1962_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01594934","volume":"50","author":"AR Conn","year":"1991","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Convergence of quasi-Newton matrices generated by the symmetric rank one update. Math. Program. 50(1\u20133), 177\u2013195 (1991). https:\/\/doi.org\/10.1007\/BF01594934","journal-title":"Math. Program."},{"issue":"89","key":"1962_CR11","first-page":"2859","volume":"16","author":"JP Cunningham","year":"2015","unstructured":"Cunningham, J.P., Ghahramani, Z.: Linear dimensionality reduction: Survey, insights, and generalizations. J. Mach. Learn. Res. 16(89), 2859\u20132900 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"1962_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2001","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2001)","journal-title":"Math. Program."},{"issue":"2","key":"1962_CR13","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","key":"1962_CR14","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1137\/08072440X","volume":"20","author":"JB Erway","year":"2010","unstructured":"Erway, J.B., Gill, P.E.: A subspace minimization method for the trust-region step. SIAM J. Optim. 20(3), 1439\u20131461 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1962_CR15","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1137\/070708494","volume":"20","author":"JB Erway","year":"2009","unstructured":"Erway, J.B., Gill, P.E., Griffin, J.D.: Iterative methods for finding a trust-region step. SIAM J. Optim. 20(2), 1110\u20131131 (2009)","journal-title":"SIAM J. Optim."},{"key":"1962_CR16","unstructured":"Golub, G.\u00a0H., Van Loan, C.\u00a0F.: Matrix computations. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press, third edition (1996)"},{"key":"1962_CR17","unstructured":"Huang, W.: Optimization algorithms on Riemannian manifolds with applications. PhD thesis, Florida State University, Department of Mathematics (2013)"},{"issue":"2","key":"1962_CR18","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":"1962_CR19","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":"44","key":"1962_CR20","first-page":"43:1","volume":"4","author":"W Huang","year":"2018","unstructured":"Huang, W., Absil, P.-A., Gallivan, K.A., Hand, P.: ROPTLIB: an object-oriented C++ library for optimization on Riemannian manifolds. ACM Transactions on Mathematical Software 4(44), 43:1-43:21 (2018)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"1962_CR21","unstructured":"Huang, W., Gallivan, K.\u00a0A.: A limited-memory Riemannian symmetric rank-one trust-region method with an efficient algorithm for its subproblem. In Proceedings of the 24th Internaltional Symposium on Mathematical Theory of Networks and Systems https:\/\/www.math.fsu.edu\/~whuang2\/papers\/ALMRTRSR1.htm, accepted (2021)"},{"issue":"3","key":"1962_CR22","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."},{"issue":"3","key":"1962_CR23","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/s10851-015-0606-8","volume":"54","author":"W Huang","year":"2015","unstructured":"Huang, W., Gallivan, K.A., Srivastava, A., Absil, P.-A.: Riemannian optimization for registration of curves in elastic shape analysis. J. Mathe. Imaging Vision 54(3), 320\u2013343 (2015). https:\/\/doi.org\/10.1007\/s10851-015-0606-8","journal-title":"J. Mathe. Imaging Vision"},{"issue":"1","key":"1962_CR24","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":"5","key":"1962_CR25","doi-asserted-by":"publisher","first-page":"B840","DOI":"10.1137\/16M1072838","volume":"39","author":"W Huang","year":"2017","unstructured":"Huang, W., Gallivan, K.A., Zhang, X.: Solving PhaseLift by low rank Riemannian optimization methods for complex semidefinite constraints. SIAM J. Sci. Comput. 39(5), B840\u2013B859 (2017)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1962_CR26","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. Imag. Sci. 11(4), 2757\u20132785 (2018)","journal-title":"SIAM J. Imag. Sci."},{"issue":"1","key":"1962_CR27","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1093\/imanum\/drx015","volume":"38","author":"B Iannazzo","year":"2018","unstructured":"Iannazzo, B., Porcelli, M.: The riemannian barzilai-borwein method with nonmonotone line search and the matrix geometric mean computation. IMA J. Numer. Anal. 38(1), 495\u2013517 (2018)","journal-title":"IMA J. Numer. Anal."},{"key":"1962_CR28","first-page":"379","volume":"39","author":"B Jeuris","year":"2012","unstructured":"Jeuris, B., Vandebril, R., Vandereycken, B.: A survey and comparison of contemporary algorithms for computing the matrix geometric mean. Electron. Trans. Numer. Anal. 39, 379\u2013402 (2012)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"1962_CR29","unstructured":"Kasai, H., Mishra, B.: Low-rank tensor completion: a riemannian manifold preconditioning approach. volume\u00a048 of Proceedings of Machine Learning Research, pages 1012\u20131021, New York, New York, USA, 20\u201322 Jun 2016. PMLR"},{"issue":"1","key":"1962_CR30","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(1), 503\u2013528 (1989)","journal-title":"Math. Program."},{"key":"1962_CR31","unstructured":"Nocedal, J., Wright, S.\u00a0J.: Numerical Optimization. Springer, second edition, (2006)"},{"issue":"151","key":"1962_CR32","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35(151), 773\u2013773 (1980)","journal-title":"Math. Comput."},{"key":"1962_CR33","doi-asserted-by":"crossref","unstructured":"Omar, D.G., Erway, J.B., Marcia, R.F.: Compact representation of the full broyden class of quasi-newton updates. Numerical Linear Algebra with Applications, 25, e2186 (2017)","DOI":"10.1002\/nla.2186"},{"issue":"4","key":"1962_CR34","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1080\/00207160701656749","volume":"86","author":"Mb Reed","year":"2009","unstructured":"Reed, Mb.: L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family. Int. J. Comput. Math. 86(4), 606\u2013615 (2009)","journal-title":"Int. J. Comput. Math."},{"issue":"2","key":"1962_CR35","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":"1","key":"1962_CR36","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)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1962_CR37","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"},{"issue":"1","key":"1962_CR38","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/140978168","volume":"25","author":"S Sra","year":"2015","unstructured":"Sra, S., Hosseini, R.: Conic geometric optimization on the manifold of positive definite matrices. SIAM J. Optim. 25(1), 713\u2013739 (2015)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1962_CR39","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s10208-017-9365-9","volume":"18","author":"J Sun","year":"2018","unstructured":"Sun, J., Qing, Q., Wright, J.: A Geometric Analysis of Phase Retrieval. Found. Comput. Math. 18(5), 1131\u20131198 (2018)","journal-title":"Found. Comput. Math."},{"key":"1962_CR40","doi-asserted-by":"crossref","unstructured":"Theis, F.\u00a0J., Cason, T.\u00a0P., Absil, P.-A.: Soft dimension reduction for ICA by joint diagonalization on the Stiefel manifold. Proceedings of the 8th International Conference on Independent Component Analysis and Signal Separation, 5441, 354\u2013361 (2009)","DOI":"10.1007\/978-3-642-00599-2_45"},{"issue":"2","key":"1962_CR41","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."},{"issue":"4","key":"1962_CR42","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4(4), 333\u2013361 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0044-1","journal-title":"Math. Program. Comput."},{"key":"1962_CR43","doi-asserted-by":"crossref","unstructured":"Yuan, X., Huang, W., Absil, P.-A., Gallivan, K.\u00a0A.: Computing the matrix geometric mean: Riemannian vs Euclidean conditioning, implementation techniques, and a Riemannian BFGS method. Technical Report UCL-INMA-2019.05, U.C.Louvain (2019)","DOI":"10.1002\/nla.2321"},{"issue":"2","key":"1962_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2674559","volume":"47","author":"X Zhou","year":"2014","unstructured":"Zhou, X., Yang, C., Zhao, H., Weichuan, Y.: Low-rank modeling and its applications in image analysis. ACM Computing Surveys (CSUR) 47(2), 1\u201333 (2014)","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"1","key":"1962_CR45","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-022-01962-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-01962-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01962-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T01:18:22Z","timestamp":1676423902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-01962-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,17]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1962"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-01962-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,17]]},"assertion":[{"value":"11 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2022","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":"1"}}