{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:13:49Z","timestamp":1784873629453,"version":"3.55.0"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T00:00:00Z","timestamp":1589328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T00:00:00Z","timestamp":1589328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-1719558"],"award-info":[{"award-number":["DMS-1719558"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["IIS-1523815"],"award-info":[{"award-number":["IIS-1523815"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000270","name":"Natural Environment Research Council","doi-asserted-by":"publisher","award":["NE\/L012146\/1"],"award-info":[{"award-number":["NE\/L012146\/1"]}],"id":[{"id":"10.13039\/501100000270","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10107-020-01505-1","type":"journal-article","created":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T11:09:27Z","timestamp":1589368167000},"page":"85-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Adaptive regularization with cubics on manifolds"],"prefix":"10.1007","volume":"188","author":[{"given":"Naman","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1322-958X","authenticated-orcid":false,"given":"Nicolas","family":"Boumal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brian","family":"Bullins","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Coralia","family":"Cartis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,5,13]]},"reference":[{"issue":"1","key":"1505_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/100802529","volume":"22","author":"P-A Absil","year":"2012","unstructured":"Absil, P.-A., Malick, J.: Projection-like retractions on matrix manifolds. SIAM J. Optim. 22(1), 135\u2013158 (2012). https:\/\/doi.org\/10.1137\/100802529","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1505_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). https:\/\/doi.org\/10.1007\/s10208-005-0179-9","journal-title":"Found. Comput. Math."},{"key":"1505_CR3","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 (2008). ISBN: 978-0-691-13298-3"},{"issue":"3","key":"1505_CR4","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1093\/imanum\/22.3.359","volume":"22","author":"R Adler","year":"2002","unstructured":"Adler, R., Dedieu, J., Margulies, J., Martens, M., Shub, M.: Newton\u2019s method on Riemannian manifolds and a geometric model for the human spine. IMA J. Numer. Anal. 22(3), 359\u2013390 (2002). https:\/\/doi.org\/10.1093\/imanum\/22.3.359","journal-title":"IMA J. Numer. Anal."},{"key":"1505_CR5","doi-asserted-by":"crossref","unstructured":"Agarwal, N., Allen-Zhu, Z., Bullins, B., Hazan, E., Ma, T.: Finding approximate local minima faster than gradient descent. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1195\u20131199. ACM (2017)","DOI":"10.1145\/3055399.3055464"},{"issue":"2","key":"1505_CR6","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s10957-017-1093-4","volume":"173","author":"G Bento","year":"2017","unstructured":"Bento, G., Ferreira, O., Melo, J.: Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds. J. Optim. Theory Appl. 173(2), 548\u2013562 (2017). https:\/\/doi.org\/10.1007\/s10957-017-1093-4","journal-title":"J. Optim. Theory Appl."},{"key":"1505_CR7","volume-title":"Topological Spaces: Including a Treatment of Multi-valued Functions, Vector Spaces, and Convexity","author":"C Berg\u00e9","year":"1963","unstructured":"Berg\u00e9, C.: Topological Spaces: Including a Treatment of Multi-valued Functions, Vector Spaces, and Convexity. Oliver and Boyd Ltd., Edinburgh (1963)"},{"key":"1505_CR8","volume-title":"Positive Definite Matrices","author":"R Bhatia","year":"2007","unstructured":"Bhatia, R.: Positive Definite Matrices. Princeton University Press, Princeton (2007)"},{"issue":"1","key":"1505_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"E Birgin","year":"2017","unstructured":"Birgin, E., Gardenghi, J., Mart\u00ednez, J., Santos, S., Toint, P.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163(1), 359\u2013368 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1065-8","journal-title":"Math. Program."},{"key":"1505_CR10","volume-title":"Geometry of Manifolds","author":"R Bishop","year":"1964","unstructured":"Bishop, R., Crittenden, R.: Geometry of Manifolds, vol. 15. Academic Press, Cambridge (1964)"},{"issue":"9","key":"1505_CR11","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1109\/TAC.2013.2254619","journal-title":"IEEE Trans. Autom. Control"},{"key":"1505_CR12","unstructured":"Boumal, N.: An introduction to optimization on smooth manifolds (in preparation) (2020)"},{"key":"1505_CR13","unstructured":"Boumal, N., Absil, P.-A.: RTRMC: a Riemannian trust-region method for low-rank matrix completion. In: Shawe-Taylor, J., Zemel, R., Bartlett, P., Pereira, F., Weinberger, K. (eds.) Advances in Neural Information Processing Systems 24 (NIPS), pp. 406\u2013414 (2011)"},{"key":"1505_CR14","doi-asserted-by":"publisher","unstructured":"Boumal, N., Singer, A., Absil, P.-A.: Robust estimation of rotations from relative measurements by maximum likelihood. In: IEEE 52nd Annual Conference on Decision and Control (CDC), pp. 1156\u20131161 (2013). https:\/\/doi.org\/10.1109\/CDC.2013.6760038","DOI":"10.1109\/CDC.2013.6760038"},{"key":"1505_CR15","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, 1455\u20131459 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"1505_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drx080","author":"N Boumal","year":"2018","unstructured":"Boumal, N., Absil, P.-A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. (2018). https:\/\/doi.org\/10.1093\/imanum\/drx080","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"1505_CR17","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1002\/cpa.21830","volume":"73","author":"N Boumal","year":"2019","unstructured":"Boumal, N., Voroninski, V., Bandeira, A.: Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs. Commun. Pure Appl. Math. 73(3), 581\u2013608 (2019). https:\/\/doi.org\/10.1002\/cpa.21830","journal-title":"Commun. Pure Appl. Math."},{"issue":"3","key":"1505_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2005","unstructured":"Burer, S., Monteiro, R.: Local minima and convergence in low-rank semidefinite programming. Math. Program. 103(3), 427\u2013444 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"1505_CR19","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1137\/17M1113898","volume":"29","author":"Y Carmon","year":"2019","unstructured":"Carmon, Y., Duchi, J.: Gradient descent finds the cubic-regularized nonconvex Newton step. SIAM J. Optim. 29(3), 2146\u20132178 (2019). https:\/\/doi.org\/10.1137\/17M1113898","journal-title":"SIAM J. Optim."},{"key":"1505_CR20","first-page":"10728","volume-title":"Advances in Neural Information Processing Systems","author":"Y Carmon","year":"2018","unstructured":"Carmon, Y., Duchi, J.C.: Analysis of Krylov subspace solutions of regularized nonconvex quadratic problems. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 31, pp. 10728\u201310738. Curran Associates Inc., New York (2018)"},{"key":"1505_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01406-y","author":"Y Carmon","year":"2019","unstructured":"Carmon, Y., Duchi, J., Hinder, O., Sidford, A.L.: Lower bounds for finding stationary points I. Math. Program. (2019). https:\/\/doi.org\/10.1007\/s10107-019-01406-y","journal-title":"Math. Program."},{"key":"1505_CR22","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N., Toint, P.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative evaluation complexity. Math. Program. 130, 295\u2013319 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0337-y","journal-title":"Math. Program."},{"issue":"2","key":"1505_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N., Toint, P.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127(2), 245\u2013295 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0286-5","journal-title":"Math. Program."},{"issue":"1","key":"1505_CR24","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jco.2011.06.001","volume":"28","author":"C Cartis","year":"2012","unstructured":"Cartis, C., Gould, N., Toint, P.: Complexity bounds for second-order optimality in unconstrained optimization. J. Complex. 28(1), 93\u2013108 (2012). https:\/\/doi.org\/10.1016\/j.jco.2011.06.001","journal-title":"J. Complex."},{"key":"1505_CR25","unstructured":"Cartis, C., Gould, N., Toint, P.: Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. arXiv preprint arXiv:1708.04044 (2017)"},{"key":"1505_CR26","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N., Toint, P.L.: Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization. In: Proceedings of the ICM (ICM 2018), pp. 3711\u20133750 (2019)","DOI":"10.1142\/9789813272880_0198"},{"key":"1505_CR27","first-page":"5985","volume-title":"Advances in Neural Information Processing Systems","author":"C Criscitiello","year":"2019","unstructured":"Criscitiello, C., Boumal, N.: Efficiently escaping saddle points on manifolds. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9 Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32, pp. 5985\u20135995. Curran Associates Inc, New York (2019)"},{"key":"1505_CR28","unstructured":"do Carmo, M.: Riemannian geometry. Mathematics: Theory & Applications. Birkh\u00e4user Boston Inc., Boston (1992). ISBN: 0-8176-3490-8 (Translated from the second Portuguese edition by Francis Flaherty)"},{"issue":"2","key":"1505_CR29","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1080\/10556788.2017.1322080","volume":"33","author":"J-P Dussault","year":"2018","unstructured":"Dussault, J.-P.: ARCq: a new adaptive regularization by cubics. Optim. Methods Softw. 33(2), 322\u2013335 (2018). https:\/\/doi.org\/10.1080\/10556788.2017.1322080","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1505_CR30","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T., Smith, S.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303\u2013353 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"1505_CR31","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1006\/jcom.2001.0582","volume":"18","author":"O Ferreira","year":"2002","unstructured":"Ferreira, O., Svaiter, B.: Kantorovich\u2019s theorem on Newton\u2019s method in Riemannian manifolds. J. Complex. 18(1), 304\u2013329 (2002). https:\/\/doi.org\/10.1006\/jcom.2001.0582","journal-title":"J. Complex."},{"issue":"2","key":"1505_CR32","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF00934767","volume":"37","author":"D Gabay","year":"1982","unstructured":"Gabay, D.: Minimizing a differentiable function over a differential manifold. J. Optim. Theory Appl. 37(2), 177\u2013219 (1982)","journal-title":"J. Optim. Theory Appl."},{"key":"1505_CR33","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2019.1670177","author":"N Gould","year":"2019","unstructured":"Gould, N., Simoncini, V.: Error estimates for iterative algorithms for minimizing regularized quadratic subproblems. Optim. Methods Softw. (2019). https:\/\/doi.org\/10.1080\/10556788.2019.1670177","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1505_CR34","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"N Gould","year":"1999","unstructured":"Gould, N., Lucidi, S., Roma, M., Toint, P.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2), 504\u2013525 (1999). https:\/\/doi.org\/10.1137\/S1052623497322735","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1505_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-011-9446-7","volume":"53","author":"NIM Gould","year":"2012","unstructured":"Gould, N.I.M., Porcelli, M., Toint, P.L.: Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. 53(1), 1\u201322 (2012). https:\/\/doi.org\/10.1007\/s10589-011-9446-7","journal-title":"Comput. Optim. Appl."},{"key":"1505_CR36","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms. Technical Report Technical report NA\/12, Department of Applied Mathematics and Theoretical Physics, University of Cambridge (1981)"},{"issue":"1","key":"1505_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/cpa.21727","volume":"71","author":"P Hand","year":"2018","unstructured":"Hand, P., Lee, C., Voroninski, V.: ShapeFit: exact location recovery from corrupted pairwise directions. Commun. Pure Appl. Math. 71(1), 3\u201350 (2018)","journal-title":"Commun. Pure Appl. Math."},{"issue":"3","key":"1505_CR38","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1137\/17M1142478","volume":"39","author":"J Hu","year":"2018","unstructured":"Hu, J., Milzarek, A., Wen, Z., Yuan, Y.: Adaptive quadratically regularized Newton method for Riemannian optimization. SIAM J. Matrix Anal. Appl. 39(3), 1181\u20131207 (2018). https:\/\/doi.org\/10.1137\/17M1142478","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1505_CR39","unstructured":"Jin, C., Netrapalli, P., Ge, R., Kakade, S., Jordan, M.: Stochastic gradient descent escapes saddle points efficiently. arXiv:1902.04811 (2019)"},{"issue":"5","key":"1505_CR40","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1137\/080731359","volume":"20","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Bach, F., Absil, P.-A., Sepulchre, R.: Low-rank optimization on the cone of positive semidefinite matrices. SIAM J. Optim. 20(5), 2327\u20132351 (2010). https:\/\/doi.org\/10.1137\/080731359","journal-title":"SIAM J. Optim."},{"key":"1505_CR41","unstructured":"Kohler, J., Lucchi, A.: Sub-sampled cubic regularization for non-convex optimization. In: Proceedings of the 34th International Conference on Machine Learning, ICML\u201917, vol. 70, pp. 1895\u20131904. JMLR.org (2017)"},{"key":"1505_CR42","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91755-9","volume-title":"Introduction to Riemannian Manifolds","author":"J Lee","year":"2018","unstructured":"Lee, J.: Introduction to Riemannian Manifolds. Graduate Texts in Mathematics, vol. 176, 2nd edn. Springer, Berlin (2018). https:\/\/doi.org\/10.1007\/978-3-319-91755-9","edition":"2"},{"issue":"11","key":"1505_CR43","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1287\/mnsc.18.11.620","volume":"18","author":"D Luenberger","year":"1972","unstructured":"Luenberger, D.: The gradient projection method along geodesics. Manag. Sci. 18(11), 620\u2013631 (1972)","journal-title":"Manag. Sci."},{"key":"1505_CR44","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-31272-2-17","volume-title":"Symmetric Positive-Definite Matrices: From Geometry to Applications and Visualization","author":"M Moakher","year":"2006","unstructured":"Moakher, M., Batchelor, P.: Symmetric Positive-Definite Matrices: From Geometry to Applications and Visualization, pp. 285\u2013298. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/3-540-31272-2-17"},{"issue":"1","key":"1505_CR45","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"1505_CR46","volume-title":"Semi-Riemannian Geometry: With Applications to Relativity","author":"B O\u2019Neill","year":"1983","unstructured":"O\u2019Neill, B.: Semi-Riemannian Geometry: With Applications to Relativity, vol. 103. Academic Press, Cambridge (1983)"},{"key":"1505_CR47","unstructured":"Qi, C.: Numerical optimization methods on Riemannian manifolds. PhD thesis, Department of Mathematics, Florida State University, Tallahassee. https:\/\/diginole.lib.fsu.edu\/islandora\/object\/fsu:180485\/datastream\/PDF\/view (2011)"},{"issue":"2","key":"1505_CR48","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":"1505_CR49","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/120872887","volume":"23","author":"H Sato","year":"2013","unstructured":"Sato, H., Iwai, T.: A Riemannian optimization approach to the matrix singular value decomposition. SIAM J. Optim. 23(1), 188\u2013212 (2013). https:\/\/doi.org\/10.1137\/120872887","journal-title":"SIAM J. Optim."},{"key":"1505_CR50","first-page":"69","volume-title":"Proceedings of VII ELAM","author":"M Shub","year":"1986","unstructured":"Shub, M.: Some remarks on dynamical systems and numerical analysis. In: Lara-Carrero, L., Lewowicz, J. (eds.) Proceedings of VII ELAM, pp. 69\u201392. Equinoccio, Universidad Sim\u00f3n Bol\u00edvar, Caracas (1986)"},{"issue":"3","key":"1505_CR51","first-page":"113","volume":"3","author":"S Smith","year":"1994","unstructured":"Smith, S.: Optimization techniques on Riemannian manifolds. Fields Inst. Commun. 3(3), 113\u2013135 (1994)","journal-title":"Fields Inst. Commun."},{"key":"1505_CR52","first-page":"7276","volume-title":"Advances in Neural Information Processing Systems","author":"Y Sun","year":"2019","unstructured":"Sun, Y., Flammarion, N., Fazel, M.: Escaping from saddle points on Riemannian manifolds. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9 Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32, pp. 7276\u20137286. Curran Associates Inc., New York (2019)"},{"key":"1505_CR53","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical Linear Algebra","author":"L Trefethen","year":"1997","unstructured":"Trefethen, L., Bau, D.: Numerical Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia (1997). ISBN: 978-0898713619"},{"key":"1505_CR54","unstructured":"Tripuraneni, N., Flammarion, N., Bach, F., Jordan, M.: Averaging stochastic gradient descent on Riemannian manifolds. In: Conference on Learning Theory, pp. 650\u2013687 (2018)"},{"key":"1505_CR55","first-page":"2899","volume-title":"Advances in Neural Information Processing Systems","author":"N Tripuraneni","year":"2018","unstructured":"Tripuraneni, N., Stern, M., Jin, C., Regier, J., Jordan, M.: Stochastic cubic regularization for fast nonconvex optimization. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 31, pp. 2899\u20132908. Curran Associates Inc., New York (2018)"},{"key":"1505_CR56","unstructured":"Waldmann, S.: Geometric wave equations. arXiv preprint arXiv:1208.4706 (2012)"},{"key":"1505_CR57","unstructured":"Wang, Z., Zhou, Y., Liang, Y., Lan, G.: Stochastic variance-reduced cubic regularization for nonconvex optimization. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 2731\u20132740 (2019)"},{"issue":"2","key":"1505_CR58","first-page":"415","volume":"10","author":"W Yang","year":"2014","unstructured":"Yang, W., Zhang, L.-H., Song, R.: Optimality conditions for the nonlinear programming problems on Riemannian manifolds. Pac. J. Optim. 10(2), 415\u2013434 (2014)","journal-title":"Pac. J. Optim."},{"key":"1505_CR59","unstructured":"Zhang, H., Sra, S.: First-order methods for geodesically convex optimization. In: Conference on Learning Theory, pp. 1617\u20131638 (2016)"},{"key":"1505_CR60","first-page":"4592","volume-title":"Advances in Neural Information Processing Systems","author":"H Zhang","year":"2016","unstructured":"Zhang, H., Reddi, S., Sra, S.: Riemannian SVRG: fast stochastic optimization on Riemannian manifolds. In: Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 29, pp. 4592\u20134600. Curran Associates Inc., New York (2016)"},{"key":"1505_CR61","unstructured":"Zhang, J., Zhang, S.: A cubic regularized Newton\u2019s method over Riemannian manifolds. arXiv preprint arXiv:1805.05565 (2018)"},{"key":"1505_CR62","unstructured":"Zhang, J., Xiao, L., Zhang, S.: Adaptive stochastic variance reduction for subsampled Newton method with cubic regularization. arXiv preprint arXiv:1811.11637 (2018)"},{"key":"1505_CR63","unstructured":"Zhou, D., Xu, P., Gu, Q.: Stochastic variance-reduced cubic regularized Newton methods. In: Dy, J., Krause, A., (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 5990\u20135999, Stockholmsmassan, Stockholm Sweden. PMLR. http:\/\/proceedings.mlr.press\/v80\/zhou18d.html (2018)"},{"key":"1505_CR64","unstructured":"Zhu, B.: Algorithms for optimization on manifolds using adaptive cubic regularization. Bachelor\u2019s thesis, Mathematics Department, Princeton University (2019)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01505-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01505-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01505-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T15:58:08Z","timestamp":1624377488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01505-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,13]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["1505"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01505-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,13]]},"assertion":[{"value":"28 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}