{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:15Z","timestamp":1740123555262,"version":"3.37.3"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"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":["11671205","11901294"],"award-info":[{"award-number":["11671205","11901294"]}],"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":[[2023,9]]},"DOI":"10.1007\/s10915-023-02288-1","type":"journal-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T11:02:51Z","timestamp":1689764571000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adaptive Trust-Region Method on Riemannian Manifold"],"prefix":"10.1007","volume":"96","author":[{"given":"Shimin","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Tao","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yuanguo","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,19]]},"reference":[{"key":"2288_CR1","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":"2","key":"2288_CR2","first-page":"1214","volume":"23","author":"B Vandereycken","year":"2012","unstructured":"Vandereycken, B.: Low-rank matrix completion by Riemannian optimization-extended version. Mathematics 23(2), 1214\u20131236 (2012)","journal-title":"Mathematics"},{"issue":"1","key":"2288_CR3","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1109\/TIT.2017.2745623","volume":"64","author":"T Bendory","year":"2018","unstructured":"Bendory, T., Eldar, Y.C., Boumal, N.: Non-convex phase retrieval from STFT measurements. IEEE Trans. Inf. Theory 64(1), 467\u2013484 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2288_CR4","doi-asserted-by":"crossref","unstructured":"Sun, J., Qu, Q., Wright, J.: A geometric analysis of phase retrieval. Found. Comput. Math., pp. 1131\u20131198 (2018)","DOI":"10.1007\/s10208-017-9365-9"},{"issue":"2","key":"2288_CR5","first-page":"128","volume":"79","author":"JF Cai","year":"2019","unstructured":"Cai, J.F., Liu, H., Wang, Y.: Fast rank-one alternating minimization algorithm for phase retrieval. J. Sci. Comput. 79(2), 128\u2013147 (2019)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"2288_CR6","doi-asserted-by":"crossref","first-page":"2355","DOI":"10.1137\/16M105808X","volume":"26","author":"N Boumal","year":"2016","unstructured":"Boumal, N.: Nonconvex phase synchronization. SIAM J. Optim. 26(4), 2355\u20132377 (2016)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2288_CR7","doi-asserted-by":"crossref","first-page":"2426","DOI":"10.1137\/16M110109X","volume":"27","author":"HK Liu","year":"2017","unstructured":"Liu, H.K., Yue, M.C., Man-Cho So, A.: On the estimation performance and convergence rate of the generalized power method for phase synchronization. SIAM J. Optim. 27(4), 2426\u20132446 (2017)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2288_CR8","doi-asserted-by":"crossref","first-page":"2757","DOI":"10.1137\/17M1151390","volume":"11","author":"W Huang","year":"2017","unstructured":"Huang, W., Hand, P.: Blind deconvolution by a steepest descent algorithm on a Quotient Manifold. SIAM J. Imag. Sci. 11(4), 2757\u20132785 (2017)","journal-title":"SIAM J. Imag. Sci."},{"issue":"12","key":"2288_CR9","doi-asserted-by":"crossref","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."},{"issue":"2","key":"2288_CR10","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1109\/TIT.2016.2632162","volume":"63","author":"J Sun","year":"2017","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete dictionary recovery over the sphere I: overview and the geometric picture. IEEE Trans. Inf. Theory 63(2), 853\u2013884 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2288_CR11","doi-asserted-by":"crossref","first-page":"224","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, p. 224. Princeton University Press, Princeton (2008)"},{"issue":"2","key":"2288_CR12","doi-asserted-by":"crossref","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."},{"issue":"1","key":"2288_CR13","doi-asserted-by":"crossref","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":"4","key":"2288_CR14","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1080\/02331934.2013.836650","volume":"64","author":"H Sato","year":"2013","unstructured":"Sato, H., Iwai, T.: A new globally convergent Riemannian conjugate gradient method. Optimization 64(4), 1011\u20131031 (2013)","journal-title":"Optimization"},{"key":"2288_CR15","unstructured":"Huang, W.: Optimization algorithms on Riemannian manifolds with applications. Dissertations and Theses-Gradworks (2013)"},{"issue":"1","key":"2288_CR16","doi-asserted-by":"crossref","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":"3","key":"2288_CR17","doi-asserted-by":"crossref","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":"2288_CR18","doi-asserted-by":"crossref","unstructured":"Qi, C.H., Gallivan, K.A., Absil, P.A.: Riemannian BFGS algorithm with applications. In: Recent Advances in Optimization and Its Applications in Engineering, pp. 183\u2013192 (2010)","DOI":"10.1007\/978-3-642-12598-0_16"},{"issue":"3","key":"2288_CR19","doi-asserted-by":"crossref","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(3), 303\u2013330 (2007)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"2288_CR20","doi-asserted-by":"crossref","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."},{"key":"2288_CR21","unstructured":"Wang, B.K., Ma, S.Q., Xue, L.Z.: Riemannian stochastic proximal gradient methods for nonsmooth optimization over the stiefel manifold (2022) arXiv:2005.01209"},{"issue":"9","key":"2288_CR22","doi-asserted-by":"crossref","first-page":"2217","DOI":"10.1109\/TAC.2013.2254619","volume":"58","author":"S Bonnabel","year":"2013","unstructured":"Bonnabel, S.: Stochastic gradient descent on Riemannian manifolds. IEEE Trans. Autom. Control 58(9), 2217\u20132229 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2288_CR23","unstructured":"Tripuraneni, N., Flammarion, N., Bach, F., Jordan, M.I.: Averaging stochastic gradient descent on Riemannian manifolds. In: Conference On Learning Theory, pp. 650\u2013687 (2018)"},{"key":"2288_CR24","unstructured":"Zhang, H., Reddi, S.J., Sra, S.: Riemannian SVRG: fast stochastic optimization on Riemannian manifolds. In: Advances in Neural Information Processing Systems, 29 (2016)"},{"issue":"1","key":"2288_CR25","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/18M122457X","volume":"30","author":"SX Chen","year":"2020","unstructured":"Chen, S.X., Ma, S.Q., So, 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":"3","key":"2288_CR26","doi-asserted-by":"crossref","first-page":"1949","DOI":"10.1137\/18M1221679","volume":"41","author":"B Gao","year":"2018","unstructured":"Gao, B., Liu, X., Yuan, Y.X.: Parallelizable algorithms for optimization problems with orthogonality constraints. SIAM J. Sci. Comput. 41(3), 1949\u20131983 (2018)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"2288_CR27","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10444-015-9426-z","volume":"42","author":"P Grohs","year":"2016","unstructured":"Grohs, P., Hosseini, S.: $$\\varepsilon $$-subgradient algorithms for locally lipschitz functions on Riemannian manifolds. Adv. Comput. Math. 42(2), 333\u2013360 (2016)","journal-title":"Adv. Comput. Math."},{"issue":"2","key":"2288_CR28","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10915-013-9740-x","volume":"58","author":"R Lai","year":"2014","unstructured":"Lai, R., Osher, S.: A splitting method for orthogonality constrained problems. J. Sci. Comput. 58(2), 431\u2013449 (2014)","journal-title":"J. Sci. Comput."},{"issue":"3","key":"2288_CR29","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1137\/17M1142478","volume":"39","author":"J Hu","year":"2017","unstructured":"Hu, J., Milzarek, A., Wen, Z.W., Yuan, Y.X.: Adaptive regularized newton method for Riemannian optimization. SIAM J. Matrix Anal. Appl. 39(3), 1181\u20131207 (2017)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2288_CR30","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0252-9602(18)30762-8","volume":"38","author":"S Zhou","year":"2018","unstructured":"Zhou, S., Lin, Y.G., Cui, Z.R.: A new adaptive trust region algorithm for optimization problems. Acta Math. Sci. 38(2), 479\u2013496 (2018)","journal-title":"Acta Math. Sci."},{"key":"2288_CR31","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1360\/02ys9067","volume":"5","author":"XS Zhang","year":"2002","unstructured":"Zhang, X.S., Zhang, J.L., Liao, L.Z.: An adaptive trust region method and its convergence. Sci. China Ser. 5, 620\u2013631 (2002)","journal-title":"Sci. China Ser."},{"issue":"4","key":"2288_CR32","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s40305-016-0149-8","volume":"5","author":"M Kimiaei","year":"2017","unstructured":"Kimiaei, M., Ghaderi, S.: A new restarting adaptive trust-region method for unconstrained optimization. J. Oper. Res. Soc. China 5(4), 487\u2013507 (2017)","journal-title":"J. Oper. Res. Soc. China"},{"key":"2288_CR33","unstructured":"Zhou, S., Yuan, G.L.: An effective adaptive trust region algorithm for nonsmooth minimization. Comput. Optim. Appl., pp. 1573\u20132894 (2018)"},{"issue":"1\u20132","key":"2288_CR34","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s12190-009-0339-1","volume":"35","author":"ZY Sang","year":"2011","unstructured":"Sang, Z.Y., Sun, Q.Y.: A new non-monotone self-adaptive trust region method for unconstrained optimization. J. Appl. Math. Comput. 35(1\u20132), 53\u201362 (2011)","journal-title":"J. Appl. Math. Comput."},{"issue":"1","key":"2288_CR35","first-page":"489","volume":"163","author":"JH Fu","year":"2005","unstructured":"Fu, J.H., Sun, W.Y.: Nonmonotone adaptive trust-region method for unconstrained optimization problems. Appl. Math. Comput. 163(1), 489\u2013504 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"2288_CR36","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s10589-012-9460-4","volume":"53","author":"Z Cui","year":"2012","unstructured":"Cui, Z., Wu, B.: A new modified nonmonotone adaptive trust region method for unconstrained optimization. Comput. Optim. Appl. 53(3), 795\u2013806 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"2288_CR37","doi-asserted-by":"crossref","unstructured":"Liu, J.J., Xu, X.M., Cui, X.C.: An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization. Comput. Optim. Appl. (2018)","DOI":"10.1007\/s10589-017-9941-6"},{"key":"2288_CR38","first-page":"1","volume":"1","author":"XY Wang","year":"2020","unstructured":"Wang, X.Y., Ding, X.F., Qu, Q.: A new nonmonotone adaptive trust region line search method for unconstrained optimization. J. Math. Ind. 1, 1\u201312 (2020)","journal-title":"J. Math. Ind."},{"key":"2288_CR39","unstructured":"Fan, J.Y., Yuan, Y.X.: A new trust region algorithm with trust region radius converging to zero. In: the 5th International Conference on Optimization: Techniques and Applications (2001)"},{"issue":"1","key":"2288_CR40","doi-asserted-by":"crossref","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(1), 249\u2013281 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"2288_CR41","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1137\/060673424","volume":"20","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Global convergence of general derivative-free trust-region algorithms to first-and second-order critical points. SIAM J. Optim. 20(1), 387\u2013415 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2288_CR42","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10589-005-3078-8","volume":"34","author":"JY Fan","year":"2006","unstructured":"Fan, J.Y.: Convergence rate of the trust region method for nonlinear equations under local error bound condition. Comput. Optim. Appl. 34(2), 215\u2013227 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2288_CR43","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"MJ Powell","year":"1977","unstructured":"Powell, M.J.: Restart procedures for the conjugate gradient method. Math. Program. 12(1), 241\u2013254 (1977)","journal-title":"Math. Program."},{"issue":"1","key":"2288_CR44","first-page":"433","volume":"150","author":"JK Liu","year":"2020","unstructured":"Liu, J.K., Zhao, Y.X., Wu, X.L.: Some three-term conjugate gradient methods with the new direction structure. Appl. Numer. Math. 150(1), 433\u2013443 (2020)","journal-title":"Appl. Numer. Math."},{"issue":"4","key":"2288_CR45","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1093\/imanum\/drl016","volume":"26","author":"L Zhang","year":"2006","unstructured":"Zhang, L., Zhou, W.J., Li, D.H.: A descent modified Polak\u2013Ribi\u00e8re\u2013Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26(4), 629\u2013640 (2006)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"2288_CR46","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1186\/s13660-017-1373-4","volume":"2017","author":"YL Wu","year":"2017","unstructured":"Wu, Y.L.: A modified three-term PRP conjugate gradient algorithm for optimization models. J. Inequalities Appl. 2017(1), 97\u201398 (2017)","journal-title":"J. Inequalities Appl."},{"issue":"11","key":"2288_CR47","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1007\/BF02871976","volume":"41","author":"YH Dai","year":"1998","unstructured":"Dai, Y.H., Yuan, Y.X.: Convergence properties of Beale-Powell restart algorithm. Sci. China Ser. 41(11), 1142\u20131150 (1998)","journal-title":"Sci. China Ser."},{"issue":"3","key":"2288_CR48","first-page":"355","volume":"21","author":"YH Dai","year":"1999","unstructured":"Dai, Y.H., Yuan, Y.X.: Convergence of three-term conjugate gradient methods. J. Comput. Math. 21(3), 355\u2013362 (1999)","journal-title":"J. Comput. Math."},{"key":"2288_CR49","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1017\/CBO9780511616822","volume-title":"Riemannian Geometry","author":"I Chavel","year":"2006","unstructured":"Chavel, I.: Riemannian Geometry, p. 314. Cambridge University Press, Woodbine (2006)"},{"key":"2288_CR50","doi-asserted-by":"crossref","unstructured":"Grapiglia, G.N., Yuan, J.Y., Yuan, Y.X.: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152(1\u20132) (2015)","DOI":"10.1007\/s10107-014-0794-9"},{"key":"2288_CR51","first-page":"697","volume-title":"Optimization Theory and Methods","author":"WY Sun","year":"2006","unstructured":"Sun, W.Y., Yuan, Y.X.: Optimization Theory and Methods, p. 697. Springer, USA (2006)"},{"issue":"006","key":"2288_CR52","first-page":"865","volume":"022","author":"JY Fan","year":"2004","unstructured":"Fan, J.Y., Ai, W.B., Zhang, Q.Y.: A line search and trust region algorithm with trust region radius converging to zero. J. Comput. Math. 022(006), 865\u2013872 (2004)","journal-title":"J. Comput. Math."},{"key":"2288_CR53","doi-asserted-by":"crossref","unstructured":"Hu, J., Liu, X., Wen, Z.W., Yuan, Y.X.: A brief introduction to manifold optimization. J. Oper. Res. Soc. China, pp. 199\u2013248 (2020)","DOI":"10.1007\/s40305-020-00295-9"},{"key":"2288_CR54","doi-asserted-by":"crossref","unstructured":"Zhu, X.J., Sato, H.: Riemannian conjugate gradient methods with inverse retraction. Comput. Optim. Appl., pp. 779\u2013810 (2020)","DOI":"10.1007\/s10589-020-00219-6"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02288-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02288-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02288-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T09:14:21Z","timestamp":1702804461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02288-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,19]]},"references-count":54,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["2288"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02288-1","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2023,7,19]]},"assertion":[{"value":"16 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no potential conflicts of interest in this study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"67"}}