{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T14:55:18Z","timestamp":1769612118575,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T00:00:00Z","timestamp":1735776000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T00:00:00Z","timestamp":1735776000000},"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":["12271518"],"award-info":[{"award-number":["12271518"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10444-024-10217-5","type":"journal-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T22:57:18Z","timestamp":1735858638000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On convergence of the generalized Lanczos trust-region method for trust-region subproblems"],"prefix":"10.1007","volume":"51","author":[{"given":"Bo","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,2]]},"reference":[{"key":"10217_CR1","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, 269\u2013291 (2017)","journal-title":"SIAM J. Optim."},{"key":"10217_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10589-014-9672-x","volume":"60","author":"T Bianconcini","year":"2015","unstructured":"Bianconcini, T., Liuzzi, G., Morini, B., Sciandrone, M.: On the use of iterative methods in cubic regularization for unconstrained optimization. Comput. Optim. Appl. 60, 35\u201357 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"10217_CR3","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1137\/20M1321759","volume":"62","author":"Y Carmon","year":"2020","unstructured":"Carmon, Y., Duchi, J.: First-order method for nonconvex quadratic minimization. SIAM Rev. 62, 395\u2013436 (2020)","journal-title":"SIAM Rev."},{"key":"10217_CR4","unstructured":"Carmon, Y., Duchi, J.: Analysis of Krylov subspace solutions of regularized nonconvex quadratic problems. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, pp. 10728\u201310738 (2018)"},{"key":"10217_CR5","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N., Toint, P.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: Motivation, convergence and numerical results, Math. Program. 127, 245\u2013295 (2011)","DOI":"10.1007\/s10107-009-0286-5"},{"key":"10217_CR6","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10543-019-00791-2","volume":"60","author":"C Cartis","year":"2020","unstructured":"Cartis, C., Gould, N., Lange, M.: On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces. BIT Numer. Math. 60, 583\u2013589 (2020)","journal-title":"BIT Numer. Math."},{"key":"10217_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-region methods","author":"A Conn","year":"2000","unstructured":"Conn, A., Gould, N., Toint, P.: Trust-region methods. SIAM, Philadelphia, PA (2000)"},{"key":"10217_CR8","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1137\/070708494","volume":"20","author":"J Erway","year":"2009","unstructured":"Erway, J., Gill, P., Griffin, J.: Iterative methods for finding a trust-region step. SIAM J. Optim. 20, 1110\u20131131 (2009)","journal-title":"SIAM J. Optim."},{"key":"10217_CR9","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/0024-3795(89)90494-1","volume":"114","author":"W Gander","year":"1989","unstructured":"Gander, W., Golub, G.H., von Matt, U.: A constrained eigenvalue problem. Linear Algebra Appl. 114, 815\u2013839 (1989)","journal-title":"Linear Algebra Appl."},{"key":"10217_CR10","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BF01385796","volume":"59","author":"GH Golub","year":"1991","unstructured":"Golub, G.H., von Matt, U.: Quadratically constrained least squares and quadratic problems. Numer. Math. 59, 561\u2013580 (1991)","journal-title":"Numer. Math."},{"key":"10217_CR11","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, 504\u2013525 (1999)","journal-title":"SIAM J. Optim."},{"key":"10217_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s12532-010-0011-7","volume":"2","author":"N Gould","year":"2010","unstructured":"Gould, N., Robinson, D., Thorne, H.: On solving trust-region and other regularised subproblems in optimization. Math. Program. Comput. 2, 21\u201357 (2010)","journal-title":"Math. Program. Comput."},{"key":"10217_CR13","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1080\/10556788.2019.1670177","volume":"35","author":"N Gould","year":"2020","unstructured":"Gould, N., Simoncini, V.: Error estimates for iterative algorithms for minimizing regularized quadratic subproblems. Optim. Methods Softw. 35, 304\u2013328 (2020)","journal-title":"Optim. Methods Softw."},{"key":"10217_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/S1052623499356071","volume":"12","author":"W Hager","year":"2001","unstructured":"Hager, W.: Minimizing a quadratic over a sphere. SIAM J. Optim. 12, 188\u2013208 (2001)","journal-title":"SIAM J. Optim."},{"key":"10217_CR15","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/S0895480199335829","volume":"12","author":"W Hager","year":"1999","unstructured":"Hager, W., Krylyuk, Y.: Graph partitioning and continuous quadratic programming. SIAM J. Discrete Math. 12, 500\u2013523 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"10217_CR16","volume-title":"Matrix analysis","author":"R Horn","year":"2013","unstructured":"Horn, R., Johnson, C.: Matrix analysis, 2nd edn. Cambridge University Press, Cambridge, UK (2013)","edition":"2"},{"key":"10217_CR17","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.: Solving the cubic regularization model by a nested restarting Lanczos method. SIAM J. Matrix Anal. Appl. 43, 812\u2013839 (2022)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10217_CR18","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1137\/S0895479893246753","volume":"16","author":"Z Jia","year":"1995","unstructured":"Jia, Z.: The convergence of generalized Lanczos methods for large unsymmetric eigenproblems. SIAM J. Matrix Anal. Appl. 16, 843\u2013862 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10217_CR19","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1137\/19M1279691","volume":"31","author":"Z Jia","year":"2021","unstructured":"Jia, Z., Wang, F.: The convergence of the generalized Lanczos trust-region method for the trust-region subproblem. SIAM J. Optim. 31, 887\u2013914 (2021)","journal-title":"SIAM J. Optim."},{"key":"10217_CR20","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, 3345\u20133358 (2020)","journal-title":"SIAM J. Optim."},{"key":"10217_CR21","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s10543-008-0197-5","volume":"48","author":"L Luk\u0161an","year":"2008","unstructured":"Luk\u0161an, L., Matonoha, C., Vl\u010dek, J.: On Lagrange multipliers of trust-region subproblems. BIT 48, 763\u2013768 (2008)","journal-title":"BIT"},{"key":"10217_CR22","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J., Sorensen, D.: Computing a trust region step. SIAM J. Sci. Statist. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10217_CR23","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.: Cubic regularization of Newton method and its global performance. Math. Program. 108, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"10217_CR24","volume-title":"Numerical optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Writht, S.: Numerical optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"10217_CR25","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF02614438","volume":"77","author":"F Rendl","year":"1997","unstructured":"Rendl, F., Wolkowicz, H.: A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. 77, 273\u2013299 (1997)","journal-title":"Math. Program."},{"key":"10217_CR26","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1137\/S105262349928887X","volume":"11","author":"M Rojas","year":"2000","unstructured":"Rojas, M., Santos, S., Sorensen, D.: A new matrix-free algorithm for the large-scale trust-region subproblem. SIAM J. Optim. 11, 611\u2013646 (2000)","journal-title":"SIAM J. Optim."},{"key":"10217_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1326548.1326553","volume":"34","author":"M Rojas","year":"2008","unstructured":"Rojas, M., Santos, S., Sorensen, D.: Algorithm 873: LSTRS: MATLAB software for large-scale trust-region subproblems and regularization. ACM Trans. Math. Software 34, 1\u201328 (2008)","journal-title":"ACM Trans. Math. Software"},{"key":"10217_CR28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003","volume-title":"Iterative methods for sparse linear systems","author":"Y Saad","year":"2003","unstructured":"Saad, Y.: Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelphia, PA (2003)","edition":"2"},{"key":"10217_CR29","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0719026","volume":"19","author":"D Sorensen","year":"1982","unstructured":"Sorensen, D.: Newton\u2019s method with a model trust region modification. SIAM J. Numer. Anal. 19, 409\u2013426 (1982)","journal-title":"SIAM J. Numer. Anal."},{"key":"10217_CR30","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1137\/S1052623494274374","volume":"7","author":"D Sorensen","year":"1997","unstructured":"Sorensen, D.: Minimization of a large-scale quadratic function subject to a spherical constraint. SIAM J. Optim. 7, 141\u2013161 (1997)","journal-title":"SIAM J. Optim."},{"key":"10217_CR31","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20, 626\u2013637 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"10217_CR32","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"P Tao","year":"1998","unstructured":"Tao, P., An, L.: A DC optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"10217_CR33","first-page":"57","volume-title":"Sparse Matrices and Their Uses","author":"P Toint","year":"1981","unstructured":"Toint, P.: Towards an efficient sparsity exploiting Newton method for minimization. In: Duff, I. (ed.) Sparse Matrices and Their Uses, pp. 57\u201388. Academic Press, London (1981)"},{"key":"10217_CR34","doi-asserted-by":"publisher","first-page":"2110","DOI":"10.1137\/16M1095056","volume":"27","author":"L Zhang","year":"2017","unstructured":"Zhang, L., Shen, C., Li, R.: On the generalized Lanczos trust-region method. SIAM J. Optim. 27, 2110\u20132142 (2017)","journal-title":"SIAM J. Optim."},{"key":"10217_CR35","doi-asserted-by":"crossref","unstructured":"Zhang, L., Shen, C.: A nested Lanczos method for the trust-region subproblem, SIAM J. Sci. Comput. 40, A2005\u2013A2032 (2018)","DOI":"10.1137\/17M1145914"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-024-10217-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-024-10217-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-024-10217-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T10:23:54Z","timestamp":1740392634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-024-10217-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,2]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["10217"],"URL":"https:\/\/doi.org\/10.1007\/s10444-024-10217-5","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,2]]},"assertion":[{"value":"3 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 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 declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"4"}}