{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T14:39:02Z","timestamp":1768055942724,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T00:00:00Z","timestamp":1747267200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T00:00:00Z","timestamp":1747267200000},"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":["NSFC-72150001"],"award-info":[{"award-number":["NSFC-72150001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC-72225009"],"award-info":[{"award-number":["NSFC-72225009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC-11831002"],"award-info":[{"award-number":["NSFC-11831002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["23ZR1445900"],"award-info":[{"award-number":["23ZR1445900"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10107-025-02230-3","type":"journal-article","created":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T06:41:40Z","timestamp":1747291300000},"page":"575-636","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Homogeneous second-order descent framework: a fast alternative to Newton-type methods"],"prefix":"10.1007","volume":"215","author":[{"given":"Chang","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuntian","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuwen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdong","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,15]]},"reference":[{"issue":"1\u20132","key":"2230_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10107-017-1206-8","volume":"173","author":"S Adachi","year":"2019","unstructured":"Adachi, S., Nakatsukasa, Y.: Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint. Math. Program. 173(1\u20132), 79\u2013116 (2019). (Publisher: Springer)","journal-title":"Math. Program."},{"issue":"1","key":"2230_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/16M1058200","volume":"27","author":"S Adachi","year":"2017","unstructured":"Adachi, S., Iwata, S., Nakatsukasa, Y., Takeda, A.: Solving the trust-region subproblem by a generalized eigenvalue problem. SIAM J. Optim. 27(1), 269\u2013291 (2017)","journal-title":"SIAM J. Optim."},{"key":"2230_CR3","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 (2017)","DOI":"10.1145\/3055399.3055464"},{"issue":"2","key":"2230_CR4","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.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127(2), 245\u2013295 (2011)","journal-title":"Math. Program."},{"issue":"2","key":"2230_CR5","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.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. 130(2), 295\u2013319 (2011)","journal-title":"Math. Program."},{"key":"2230_CR6","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation And Perspectives, Philadelphia, PA (2022)","DOI":"10.1137\/1.9781611976991"},{"key":"2230_CR7","doi-asserted-by":"publisher","unstructured":"Cartis C., Zhu, W.: Cubic-quartic regularization models for solving polynomial subproblems in third-order tensor methods. Math. Program. (2025). https:\/\/doi.org\/10.1007\/s10107-024-02176-y","DOI":"10.1007\/s10107-024-02176-y"},{"key":"2230_CR8","doi-asserted-by":"publisher","unstructured":"Cartis, C., Zhu, W.: Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods (2025). https:\/\/doi.org\/10.48550\/arXiv.2308.15336","DOI":"10.48550\/arXiv.2308.15336"},{"key":"2230_CR9","doi-asserted-by":"crossref","unstructured":"Curtis, F.E., Wang, Q.: Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization. arXiv:2204.11322 [math] (2022)","DOI":"10.1137\/22M1492428"},{"issue":"1","key":"2230_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","volume":"162","author":"FE Curtis","year":"2017","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: A trust region algorithm with a worst-case iteration complexity of $$\\cal{O} (\\epsilon ^{-3\/2})$$ for nonconvex optimization. Math. Program. 162(1), 1\u201332 (2017)","journal-title":"Math. Program."},{"key":"2230_CR11","doi-asserted-by":"crossref","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: An inexact regularized Newton framework with a worst-case iteration complexity of for nonconvex optimization. IMA Journal of Numerical Analysis 39(3), 1296\u20131327 (2019). Publisher: Oxford University Press","DOI":"10.1093\/imanum\/dry022"},{"issue":"1","key":"2230_CR12","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1137\/19M130563X","volume":"31","author":"FE Curtis","year":"2021","unstructured":"Curtis, F.E., Robinson, D.P., Royer, C.W., Wright, S.J.: Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization. SIAM J. Optim. 31(1), 518\u2013544 (2021). (Publisher: Society for Industrial and Applied Mathematics)","journal-title":"SIAM J. Optim."},{"key":"2230_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF01585553","volume":"69","author":"D den Hertog","year":"1995","unstructured":"den Hertog, D., Jarre, F., Roos, C., Terlaky, T.: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems. Math. Program. 69, 75\u201388 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"2230_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-023-01943-7","volume":"204","author":"N Doikov","year":"2024","unstructured":"Doikov, N., Nesterov, Y.: Gradient regularization of Newton method with Bregman distances. Math. Program. 204(1), 1\u201325 (2024)","journal-title":"Math. Program."},{"issue":"1","key":"2230_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1137\/22M1519444","volume":"34","author":"N Doikov","year":"2024","unstructured":"Doikov, N., Mishchenko, K., Nesterov, Y.: Super-universal regularized Newton method. SIAM J. Optim. 34(1), 27\u201356 (2024). (Publisher: Society for Industrial and Applied Mathematics)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2230_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-023-02007-6","volume":"207","author":"J-P Dussault","year":"2024","unstructured":"Dussault, J.-P., Migot, T., Orban, D.: Scalable adaptive cubic regularization methods. Math. Program. 207(1), 191\u2013225 (2024)","journal-title":"Math. Program."},{"key":"2230_CR17","unstructured":"Foster, D.J., Sekhari, A., Shamir, O., Srebro, N., Sridharan, K., Woodworth, B.: The complexity of making the gradient small in stochastic convex optimization. In: Conference on Learning Theory, pp. 1319\u20131345 (2019). PMLR"},{"key":"2230_CR18","unstructured":"Gallier, J.: The schur complement and symmetric positive semidefinite (and definite) matrices (2019). https:\/\/www.cis.upenn.edu\/jean\/schur-comp.pdf (2020)"},{"key":"2230_CR19","volume-title":"Matrix Computations","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th edn. The Johns Hopkins University Press, Baltimore (2013)","edition":"4"},{"key":"2230_CR20","first-page":"25320","volume":"35","author":"S Hanzely","year":"2022","unstructured":"Hanzely, S., Kamzolov, D., Pasechnyuk, D., Gasnikov, A., Richtarik, P., Takac, M.: A damped newton method achieves global $$\\cal{O} \\left(\\frac{1}{k^2}\\right)$$ and local quadratic convergence rate. Adv. Neural. Inf. Process. Syst. 35, 25320\u201325334 (2022)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"2230_CR21","unstructured":"He, C., Jiang, B., Zhu, X.: Quaternion matrix decomposition and its theoretical implications. J. Glob. Optim. 1\u201318 (2022). Publisher: Springer"},{"key":"2230_CR22","unstructured":"He, C., Jiang, Y., Zhang, C., Ge, D., Jiang, B., Ye, Y.: Technical Report: The Homogeneous Second-Order Descent Framework with Inexact Eigenvalue Computations (2024). https:\/\/bzhangcw.github.io\/assets\/pdfs\/bisection.pdf"},{"key":"2230_CR23","doi-asserted-by":"crossref","unstructured":"Hilbert, D.: Ein Beitrag zur Theorie des Legendreschen Polynoms. In: Hilbert, D. (ed.) Algebra $$\\cdot $$ Invariantentheorie Geometrie, Berlin, Heidelberg, pp. 367\u2013370 (1970)","DOI":"10.1007\/978-3-662-26737-0_21"},{"issue":"2","key":"2230_CR24","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1137\/21M1436324","volume":"43","author":"X Jia","year":"2022","unstructured":"Jia, X., Liang, X., Shen, C., Zhang, L.-H.: Solving the cubic regularization model by a nested restarting lanczos method. SIAM J. Matrix Anal. Appl. 43(2), 812\u2013839 (2022)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2230_CR25","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1287\/moor.18.1.116","volume":"18","author":"KO Kortanek","year":"1993","unstructured":"Kortanek, K.O., Zhu, J.: A polynomial barrier algorithm for linearly constrained convex programming problems. Math. Oper. Res. 18(1), 116\u2013127 (1993)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"2230_CR26","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1137\/0613066","volume":"13","author":"J Kuczy\u0144ski","year":"1992","unstructured":"Kuczy\u0144ski, J., Wo\u017aniakowski, H.: Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start. SIAM J. Matrix Anal. Appl. 13(4), 1094\u20131122 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"4","key":"2230_CR27","doi-asserted-by":"publisher","first-page":"3345","DOI":"10.1137\/19M1291388","volume":"30","author":"F Lieder","year":"2020","unstructured":"Lieder, F.: Solving large-scale cubic regularization by a generalized eigenvalue problem. SIAM J. Optim. 30(4), 3345\u20133358 (2020)","journal-title":"SIAM J. Optim."},{"key":"2230_CR28","doi-asserted-by":"crossref","unstructured":"Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming. International Series in Operations Research & Management Science, vol. 228. Cham (2021)","DOI":"10.1007\/978-3-030-85450-8"},{"key":"2230_CR29","unstructured":"Masiha, S., Salehkaleybar, S., He, N., Kiyavash, N., Thiran, P.: Stochastic Second-Order Methods Provably Beat SGD For Gradient-Dominated Functions. arXiv preprint arXiv:2205.12856 (2022)"},{"issue":"3","key":"2230_CR30","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1137\/22M1488752","volume":"33","author":"K Mishchenko","year":"2023","unstructured":"Mishchenko, K.: Regularized Newton Method with Global $$\\cal{O} (1\/k^2)$$ Convergence. SIAM J. Optim. 33(3), 1440\u20131462 (2023)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2230_CR31","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4(3), 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"1","key":"2230_CR32","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-006-0089-x","volume":"112","author":"Y Nesterov","year":"2008","unstructured":"Nesterov, Y.: Accelerating the cubic regularization of newton\u2019s method on convex problems. Math. Program. 112(1), 159\u2013181 (2008)","journal-title":"Math. Program."},{"key":"2230_CR33","first-page":"10","volume":"88","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: How to make the gradients small. Optima. Math. Optim. Soc. Newslett. 88, 10\u201311 (2012)","journal-title":"Optima. Math. Optim. Soc. Newslett."},{"key":"2230_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization. Springer, Cham (2018)"},{"key":"2230_CR35","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming (1994)","DOI":"10.1137\/1.9781611970791"},{"issue":"1","key":"2230_CR36","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."},{"issue":"1","key":"2230_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-021-01930-y","volume":"191","author":"Y Nesterov","year":"2021","unstructured":"Nesterov, Y.: Superfast second-order methods for unconstrained convex optimization. J. Optim. Theory Appl. 191(1), 1\u201330 (2021). https:\/\/doi.org\/10.1007\/s10957-021-01930-y","journal-title":"J. Optim. Theory Appl."},{"key":"2230_CR38","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization (2006)"},{"issue":"3","key":"2230_CR39","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1137\/S105262349928887X","volume":"11","author":"M Rojas","year":"2001","unstructured":"Rojas, M., Santos, S.A., Sorensen, D.C.: A new matrix-free algorithm for the large-scale trust-region subproblem. SIAM J. Optim. 11(3), 611\u2013646 (2001). (Publisher: Society for Industrial and Applied Mathematics)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2230_CR40","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1137\/17M1134329","volume":"28","author":"CW Royer","year":"2018","unstructured":"Royer, C.W., Wright, S.J.: Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim. 28(2), 1448\u20131477 (2018). (Publisher: SIAM)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2230_CR41","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10107-019-01362-7","volume":"180","author":"CW Royer","year":"2020","unstructured":"Royer, C.W., O\u2019Neill, M., Wright, S.J.: A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization. Math. Program. 180(1), 451\u2013488 (2020)","journal-title":"Math. Program."},{"key":"2230_CR42","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems, Rev. ed edn. Classics in applied mathematics, vol. 66. Society for Industrial and Applied Mathematics, Philadelphia (2011)","DOI":"10.1137\/1.9781611970739"},{"issue":"2","key":"2230_CR43","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(2), 409\u2013426 (1982). (Publisher: SIAM)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"2230_CR44","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1287\/moor.28.2.246.14485","volume":"28","author":"JF Sturm","year":"2003","unstructured":"Sturm, J.F., Zhang, S.: On cones of nonnegative quadratic functions. Math. Oper. Res. 28(2), 246\u2013267 (2003). (Publisher: INFORMS)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2230_CR45","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1006\/jcom.1994.1014","volume":"10","author":"Y Ye","year":"1994","unstructured":"Ye, Y.: Combining binary search and newton\u2019s method to compute real roots for a class of real functions. J. Complex. 10(3), 271\u2013280 (1994)","journal-title":"J. Complex."},{"key":"2230_CR46","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley, New York Weinheim (1997)"},{"issue":"2","key":"2230_CR47","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"Y Ye","year":"1999","unstructured":"Ye, Y.: Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84(2), 219\u2013226 (1999)","journal-title":"Math. Program."},{"key":"2230_CR48","unstructured":"Ye, Y.: A second-order path-following algorithm for unconstrained convex optimization (2017)"},{"key":"2230_CR49","unstructured":"Zhang, C., Ge, D., He, C., Jiang, B., Jiang, Y., Xue, C., Ye, Y.: A homogenous second-order descent method for nonconvex optimization. arXiv:2211.08212 [math] (2022)"},{"key":"2230_CR50","first-page":"359","volume":"36","author":"J Zhu","year":"1992","unstructured":"Zhu, J.: A path following algorithm for a class of convex programming problems. Z. Oper. Res. 36, 359\u2013377 (1992)","journal-title":"Z. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02230-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-025-02230-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02230-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T12:21:08Z","timestamp":1768047668000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-025-02230-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,15]]},"references-count":50,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["2230"],"URL":"https:\/\/doi.org\/10.1007\/s10107-025-02230-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,15]]},"assertion":[{"value":"30 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}