{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T15:32:39Z","timestamp":1767108759523,"version":"3.41.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T00:00:00Z","timestamp":1747094400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T00:00:00Z","timestamp":1747094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12401419"],"award-info":[{"award-number":["12401419"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10915-025-02913-1","type":"journal-article","created":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T20:26:36Z","timestamp":1747167996000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Inexact Riemannian Gradient Descent Method for Nonconvex Optimization with Strong Convergence"],"prefix":"10.1007","volume":"103","author":[{"given":"Juan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4609-747X","authenticated-orcid":false,"given":"Kangkang","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongxia","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,13]]},"reference":[{"key":"2913_CR1","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, NJ (2008)"},{"issue":"3","key":"2913_CR2","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1137\/12086282X","volume":"51","author":"B Afsari","year":"2013","unstructured":"Afsari, B., Tron, R., Vidal, R.: On the convergence of gradient descent for finding the Riemannian center of mass. SIAM J. Control Optim. 51(3), 2230\u20132260 (2013)","journal-title":"SIAM J. Control Optim."},{"key":"2913_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116, 5\u201316 (2009)","journal-title":"Math. Program."},{"key":"2913_CR4","unstructured":"Bento, G., Neto, J., Oliveira, P.: Convergence of inexact descent methods for nonconvex optimization on Riemannian manifolds. arXiv preprint arXiv:1103.4828 (2011)"},{"issue":"2","key":"2913_CR5","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10208-021-09513-z","volume":"22","author":"AS Berahas","year":"2022","unstructured":"Berahas, A.S., Cao, L., Choromanski, K., Scheinberg, K.: A theoretical and empirical comparison of gradient approximations in derivative-free optimization. Found. Comput. Math. 22(2), 507\u2013560 (2022)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"2913_CR6","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1057\/palgrave.jors.2600425","volume":"48","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P.: Nonlinear programming. J. Op. Res. Soc. 48(3), 334\u2013334 (1997)","journal-title":"J. Op. Res. Soc."},{"issue":"1","key":"2913_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"2913_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2019","unstructured":"Boumal, N., Absil, P.A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. 39(1), 1\u201333 (2019)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"2913_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/0728014","volume":"28","author":"RG Carter","year":"1991","unstructured":"Carter, R.G.: On the global convergence of trust region algorithms using inexact gradient information. SIAM J. Numer. Anal. 28(1), 251\u2013265 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"2913_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169, 337\u2013375 (2018)","journal-title":"Math. Program."},{"key":"2913_CR11","unstructured":"Foret, P., Kleiner, A., Mobahi, H., Neyshabur, B.: Sharpness-aware minimization for efficiently improving generalization. arXiv preprint arXiv:2010.01412 (2020)"},{"key":"2913_CR12","unstructured":"Hosseini, S.: Convergence of nonsmooth descent methods via Kurdyka\u2013\u0141ojasiewicz inequality on riemannian manifolds. Hausdorff Center for Mathematics and Institute for Numerical Simulation, University of Bonn (2015,(INS Preprint No. 1523)) (2015)"},{"key":"2913_CR13","unstructured":"Hou, T.Y., Li, Z., Zhang, Z.: Fast global convergence for low-rank matrix recovery via Riemannian gradient descent with random initialization. arXiv preprint arXiv:2012.15467 (2020)"},{"key":"2913_CR14","unstructured":"Hu, Z., Wang, G., Wang, X., Wibisono, A., Abernethy, J.D., Tao, M.: Extragradient type methods for Riemannian variational inequality problems. In: International Conference on Artificial Intelligence and Statistics, pp. 2080\u20132088. PMLR (2024)"},{"issue":"7","key":"2913_CR15","first-page":"8466","volume":"45","author":"F Huang","year":"2023","unstructured":"Huang, F., Gao, S.: Gradient descent ascent for minimax problems on Riemannian manifolds. IEEE Trans. Pattern Anal. Mach. Intell. 45(7), 8466\u20138476 (2023)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"2913_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10107-021-01632-3","volume":"194","author":"W Huang","year":"2022","unstructured":"Huang, W., Wei, K.: Riemannian proximal gradient methods. Math. Program. 194(1), 371\u2013413 (2022)","journal-title":"Math. Program."},{"key":"2913_CR17","doi-asserted-by":"crossref","unstructured":"Khanh, P.D., Luong, H.C., Mordukhovich, B.S., Tran, D.B.: Fundamental convergence analysis of sharpness-aware minimization. arXiv preprint arXiv:2401.08060 (2024)","DOI":"10.1007\/978-3-031-73420-5_11"},{"key":"2913_CR18","doi-asserted-by":"crossref","unstructured":"Khanh, P.D., Mordukhovich, B.S., Tran, D.B.: Inexact reduced gradient methods in smooth nonconvex optimization. arXiv preprint arXiv:2204.01806 (2022)","DOI":"10.1007\/s10957-023-02319-9"},{"key":"2913_CR19","unstructured":"Khanh, P.D., Mordukhovich, B.S., Tran, D.B.: General derivative-free optimization methods under global and local lipschitz continuity of gradients. arXiv preprint arXiv:2311.16850 (2023)"},{"key":"2913_CR20","doi-asserted-by":"crossref","unstructured":"Khanh, P.D., Mordukhovich, B.S., Tran, D.B.: Inexact reduced gradient methods in nonconvex optimization. J. Opt. Theory Appl. pp. 1\u201341 (2023)","DOI":"10.1080\/10556788.2024.2322700"},{"key":"2913_CR21","doi-asserted-by":"crossref","unstructured":"Khanh, P.D., Mordukhovich, B.S., Tran, D.B.: A new inexact gradient descent method with applications to nonsmooth convex optimization. Optimization Methods and Software pp. 1\u201329 (2024)","DOI":"10.1080\/10556788.2024.2322700"},{"key":"2913_CR22","unstructured":"Krizhevsky, A., Hinton, G., et\u00a0al.: Learning multiple layers of features from tiny images (2009)"},{"issue":"11","key":"2913_CR23","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"issue":"2","key":"2913_CR24","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1287\/moor.2022.1302","volume":"48","author":"J Li","year":"2023","unstructured":"Li, J., Balasubramanian, K., Ma, S.: Stochastic zeroth-order Riemannian derivative estimation and optimization. Math. Op. Res. 48(2), 1183\u20131211 (2023)","journal-title":"Math. Op. Res."},{"issue":"2","key":"2913_CR25","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1137\/21M1468048","volume":"33","author":"X Li","year":"2023","unstructured":"Li, X., Milzarek, A., Qiu, J.: Convergence of random reshuffling under the Kurdyka-\u0141ojasiewicz inequality. SIAM J. Opt. 33(2), 1092\u20131120 (2023)","journal-title":"SIAM J. Opt."},{"key":"2913_CR26","unstructured":"Loshchilov, I., Hutter, F.: Sgdr: Stochastic gradient descent with warm restarts. arXiv preprint arXiv:1608.03983 (2016)"},{"key":"2913_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"issue":"1","key":"2913_CR28","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/18M1216250","volume":"30","author":"C Paquette","year":"2020","unstructured":"Paquette, C., Scheinberg, K.: A stochastic line search method with expected complexity analysis. SIAM J. Opt. 30(1), 349\u2013376 (2020)","journal-title":"SIAM J. Opt."},{"key":"2913_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/b97412","volume-title":"Introduction to Optimization","author":"P Pedregal","year":"2004","unstructured":"Pedregal, P.: Introduction to Optimization, vol. 46. Springer, New York (2004)"},{"issue":"1","key":"2913_CR30","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s10957-021-01874-3","volume":"190","author":"H Sakai","year":"2021","unstructured":"Sakai, H., Iiduka, H.: Sufficient descent Riemannian conjugate gradient methods. J. Opt. Theory Appl. 190(1), 130\u2013150 (2021)","journal-title":"J. Opt. Theory Appl."},{"key":"2913_CR31","unstructured":"Smith, S.T.: Optimization techniques on Riemannian manifolds. arXiv preprint arXiv:1407.5965 (2014)"},{"issue":"2","key":"2913_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 Remannian optimization. SIAM J. Opt. 23(2), 1214\u20131236 (2013)","journal-title":"SIAM J. Opt."},{"issue":"3","key":"2913_CR33","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1137\/15M1050525","volume":"37","author":"K Wei","year":"2016","unstructured":"Wei, K., Cai, J.F., Chan, T.F., Leung, S.: Guarantees of Riemannian optimization for low rank matrix recovery. SIAM J. Matrix Anal. Appl. 37(3), 1198\u20131222 (2016)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"2913_CR34","unstructured":"Yun, J., Yang, E.: Riemannian sam: Sharpness-aware minimization on Riemannian manifolds. Adv. Neural Inf. Process. Syst. 36 (2024)"},{"issue":"4","key":"2913_CR35","doi-asserted-by":"publisher","first-page":"2885","DOI":"10.1137\/22M1505475","volume":"33","author":"P Zhang","year":"2023","unstructured":"Zhang, P., Zhang, J., Sra, S.: Sion\u2019s minimax theorem in geodesic metric spaces and a riemannian extragradient algorithm. SIAM J. Opt. 33(4), 2885\u20132908 (2023)","journal-title":"SIAM J. Opt."},{"key":"2913_CR36","unstructured":"Zhou, P., Yuan, X.T., Feng, J.: Faster first-order methods for stochastic non-convex optimization on Riemannian manifolds. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 138\u2013147. PMLR (2019)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02913-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02913-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02913-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T13:20:13Z","timestamp":1748006413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02913-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,13]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2913"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02913-1","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,5,13]]},"assertion":[{"value":"17 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2025","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 they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"96"}}