{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T16:18:00Z","timestamp":1769012280507,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T00:00:00Z","timestamp":1610064000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10957-020-01796-6","type":"journal-article","created":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T06:04:25Z","timestamp":1610085865000},"page":"547-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Nonmonotone Trust Region Method for Unconstrained Optimization Problems on Riemannian Manifolds"],"prefix":"10.1007","volume":"188","author":[{"given":"Xiaobo","family":"Li","sequence":"first","affiliation":[]},{"given":"Xianfu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Manish","family":"Krishan\u00a0Lal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,8]]},"reference":[{"key":"1796_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1090\/qam\/10666","volume":"2","author":"K Levenberg","year":"1994","unstructured":"Levenberg, K.: A method for the solution of certain non-linear problems in least squares. Quart. Appl. Math. 2, 164\u2013168 (1994)","journal-title":"Quart. Appl. Math."},{"key":"1796_CR2","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.camwa.2010.04.034","volume":"60","author":"M Ahookhosh","year":"2010","unstructured":"Ahookhosh, M., Amini, K.: A nonmonotone trust region method with adaptive radius for unconstrained optimization problems. Comput. Math. Appl. 60, 411\u2013422 (2010)","journal-title":"Comput. Math. Appl."},{"key":"1796_CR3","doi-asserted-by":"publisher","first-page":"2601","DOI":"10.1016\/j.apm.2013.10.062","volume":"38","author":"K Amini","year":"2014","unstructured":"Amini, K., Ahookhosh, M.: A hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimization. Appl. Math. Model. 38, 2601\u20132612 (2014)","journal-title":"Appl. Math. Model."},{"key":"1796_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.cam.2007.01.027","volume":"213","author":"ZJ Shi","year":"2008","unstructured":"Shi, Z.J., Guo, J.H.: A new trust region methods for unconstrained optimization. Comput. Math. Appl. 213, 509\u2013520 (2008)","journal-title":"Comput. Math. Appl."},{"key":"1796_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0719026","volume":"19","author":"DC Sorensen","year":"1982","unstructured":"Sorensen, D.C.: Newton\u2019s method with a model trust region modification. SIAM J. Numer. Anal. 19, 409\u2013426 (1982)","journal-title":"SIAM J. Numer. Anal."},{"key":"1796_CR6","unstructured":"Sorensen, D.C.: Trust region methods for unconstrained minimization. CONF-8107106-2. Argonne National Lab., IL (USA) (1981)"},{"key":"1796_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-015-0893-2","volume":"151","author":"YX Yuan","year":"2015","unstructured":"Yuan, Y.X.: Recent advances in trust region algorithms. Math. Program. 151, 249\u2013281 (2015)","journal-title":"Math. Program."},{"key":"1796_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF02591998","volume":"29","author":"MJD Powell","year":"1984","unstructured":"Powell, M.J.D.: On the global convergence of trust region algorithms for unconstrained minimization. Math. Program. 29, 297\u2013303 (1984)","journal-title":"Math. Program."},{"key":"1796_CR9","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1016\/S0898-1221(03)00130-5","volume":"45","author":"XS Zhang","year":"2003","unstructured":"Zhang, X.S., Zhang, J.L., Liao, L.Z.: An nonmonotone adaptive trust region method and its convergence. Int. Comput. Math. Appl. 45, 1469\u20131477 (2003)","journal-title":"Int. Comput. Math. Appl."},{"issue":"4","key":"1796_CR10","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"HC Zhang","year":"2004","unstructured":"Zhang, H.C., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"1796_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cam.2006.10.070","volume":"209","author":"J Mo","year":"2007","unstructured":"Mo, J., Liu, C., Yan, S.: A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function value. J. Comput. Appl. Math. 209, 97\u2013108 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"1796_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"key":"1796_CR13","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."},{"issue":"3","key":"1796_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60(3), 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"1796_CR15","doi-asserted-by":"publisher","DOI":"10.1515\/9781400830244","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2008","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)"},{"key":"1796_CR16","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, 1660\u20131685 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1796_CR17","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)","journal-title":"SIAM J. Optim."},{"key":"1796_CR18","unstructured":"Huang, W.: Optimization Algorithms on Riemannian Manifolds with Applications. Ph.D. Thesis, Department of Mathematics, Florida State University, Tallahassee, FL (2013)"},{"key":"1796_CR19","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/s10957-018-1390-6","volume":"180","author":"XB Li","year":"2019","unstructured":"Li, X.B., Huang, N.J., Ansari, Q.H., Yao, J.C.: Convergence rate of descent method with new inexact line-search on Riemannian manifolds. J. Optim. Theory Appl. 180, 830\u2013854 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"1796_CR20","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, 1167\u20131192 (2016)","journal-title":"IMA J. Numer. Anal."},{"key":"1796_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"PA Absil","year":"2007","unstructured":"Absil, P.A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7, 303\u2013330 (2007)","journal-title":"Found. Comput. Math."},{"key":"1796_CR22","doi-asserted-by":"crossref","unstructured":"Burago, D., Burago, Y., Ivanov, S.: A Course in Metric Geometry. Graduate Studies in Math., vol. 33, Am. Math. Soc., Providence, RI (2001)","DOI":"10.1090\/gsm\/033"},{"key":"1796_CR23","volume-title":"Riemannian Geometry: A Modern Introduction","author":"I Chavel","year":"1993","unstructured":"Chavel, I.: Riemannian Geometry: A Modern Introduction. Cambridge University Press, London (1993)"},{"key":"1796_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9923-3","volume-title":"A Course in Differential Geometry","author":"W Klingernerg","year":"1978","unstructured":"Klingernerg, W.: A Course in Differential Geometry. Springer, Berlin (1978)"},{"key":"1796_CR25","unstructured":"Boumal, N.: An Introduction to Optimization on Smooth Manifolds (2020)"},{"key":"1796_CR26","doi-asserted-by":"crossref","unstructured":"Sakai, T.: Riemannian Geometry, Translations of Mathematical Monograph. Amer. Math. Soc., Providence, RI (1996)","DOI":"10.1090\/mmono\/149"},{"key":"1796_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8390-9","volume-title":"Convex Functions and Optimization Methods on Riemannian Manifolds","author":"C Udri\u015fte","year":"1994","unstructured":"Udri\u015fte, C.: Convex Functions and Optimization Methods on Riemannian Manifolds. Kluwer Academic Publishers, Dordrecht (1994)"},{"key":"1796_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-00599-2_45","volume-title":"International Conference on Independent Component Analysis and Signal Separation","author":"FJ Theis","year":"2009","unstructured":"Theis, F.J., Cason, T.P., Absil, P.A.: Soft dimension reduction for ICA by joint diagonalization on the Stiefel manifold. In: Adali, T., Jutten, C., Romano, J.M.T., Barros, A.K. (eds.) International Conference on Independent Component Analysis and Signal Separation. Lecture Notes in Computer Science, vol. 5441, pp. 354\u2013361. Springer, Berlin (2009)"},{"key":"1796_CR29","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 Ser. A. 150, 179\u2013216 (2015)","journal-title":"Math. Program Ser. A."},{"issue":"12","key":"1796_CR30","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1080\/02331934.2017.1359592","volume":"66","author":"H Sato","year":"2017","unstructured":"Sato, H.: Riemannian Newton-type method for joint diagonalization on the Stiefel manifold with application to independent component analysis. Optimization 66(12), 2211\u20132231 (2017)","journal-title":"Optimization"},{"key":"1796_CR31","unstructured":"Boumal, N., Absil, P.A.: RTRMC: a Riemannian trust-region method for low-rank matrix completion. In: Annual Conference on Neural Information Processing Systems 2011: Advances in Neural Information Processing Systems 24, pp. 406\u2013414 (2011)"},{"key":"1796_CR32","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, 1214\u20131236 (2013)","journal-title":"SIAM J. Optim."},{"key":"1796_CR33","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: STOC \u201913: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing 45, pp. 665-674 (2013)","DOI":"10.1145\/2488608.2488693"},{"key":"1796_CR34","unstructured":"Kasai, H., Mishra, B.: Inexact trust-region algorithms on Riemannian manifolds. In: Annual Conference on Neural Information Processing Systems 2018: Advances in Neural Information Processing Systems 31, pp. 4249\u20134260 (2018)"},{"issue":"1","key":"1796_CR35","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."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01796-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-020-01796-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01796-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T18:19:33Z","timestamp":1613240373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-020-01796-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,8]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["1796"],"URL":"https:\/\/doi.org\/10.1007\/s10957-020-01796-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,8]]},"assertion":[{"value":"25 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}