{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T01:23:48Z","timestamp":1760232228580,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["11901118","62073087"],"award-info":[{"award-number":["11901118","62073087"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The adaptive cubic regularization method solves an unconstrained optimization model by using a three-order regularization term to approximate the objective function at each iteration. Similar to the trust-region method, the calculation of the sub-problem highly affects the computing efficiency. The Lanczos method is an useful tool for simplifying the objective function in the sub-problem. In this paper, we implement the adaptive cubic regularization method with the aid of the Lanczos method, and analyze the error of Lanczos approximation. We show that both the error between the Lanczos objective function and the original cubic term, and the error between the solution of the Lanczos approximation and the solution of the original cubic sub-problem are bounded up by the condition number of the optimal Hessian matrix. Furthermore, we compare the numerical performances of the adaptive cubic regularization algorithm when using the Lanczos approximation method and the adaptive cubic regularization algorithm without using the Lanczos approximation for unconstrained optimization problems. Numerical experiments show that the Lanczos method improves the computation efficiency of the adaptive cubic method remarkably.<\/jats:p>","DOI":"10.3390\/sym14102191","type":"journal-article","created":{"date-parts":[[2022,10,19]],"date-time":"2022-10-19T02:54:25Z","timestamp":1666148065000},"page":"2191","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the Adaptive Cubic Regularization Sub-Problem Using the Lanczos Method"],"prefix":"10.3390","volume":"14","author":[{"given":"Zhi","family":"Zhu","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Guangdong University of Technology, Guangzhou 510520, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5296-2813","authenticated-orcid":false,"given":"Jingya","family":"Chang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Guangdong University of Technology, Guangzhou 510520, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,10,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","article-title":"Adaptive cubic regularisation methods for unconstrained optimization. Part I: Motivation, convergence and numerical results","volume":"127","author":"Cartis","year":"2011","journal-title":"Math. Program."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","article-title":"Computing a trust region step","volume":"4","author":"Sorensen","year":"1983","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1137\/S1052623494274374","article-title":"Minimization of a large-scale quadratic functionsubject to a spherical constraint","volume":"7","author":"Sorensen","year":"1997","journal-title":"SIAM J. Optim."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1137\/S105262349928887X","article-title":"A new matrix-free algorithm for the large-scale trust-region subproblem","volume":"11","author":"Rojas","year":"2000","journal-title":"SIAM J. Optim."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF02614438","article-title":"A semidefinite framework for trust region subproblems with applications to large scale minimization","volume":"77","author":"Rendl","year":"1997","journal-title":"Math. Program."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/S1052623499356071","article-title":"Minimizing a quadratic over a sphere","volume":"12","author":"Hager","year":"2001","journal-title":"SIAM J. Optim."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/070708494","article-title":"Iterative methods for finding a trust-region step","volume":"20","author":"Erway","year":"2009","journal-title":"SIAM J. Optim."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/S1052623497322735","article-title":"Solving the trust-region subproblem using the Lanczos method","volume":"9","author":"Gould","year":"1999","journal-title":"SIAM J. Optim."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Gould, N.I., and Toint, P.L. (2000). Trust Region Methods, SIAM.","DOI":"10.1137\/1.9780898719857"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/0720042","article-title":"The conjugate gradient method and trust regions in large scale optimization","volume":"20","author":"Steihaug","year":"1983","journal-title":"SIAM J. Numer. Anal."},{"key":"ref_11","unstructured":"Toint, P. (1981). Towards an efficient sparsity exploiting Newton method for minimization. Sparse Matrices and Their Uses, Academic Press."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2110","DOI":"10.1137\/16M1095056","article-title":"On the generalized Lanczos trust-region method","volume":"27","author":"Zhang","year":"2017","journal-title":"SIAM J. Optim."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s11464-018-0687-y","article-title":"Error bounds of Lanczos approach for trust-region subproblem","volume":"13","author":"Zhang","year":"2018","journal-title":"Front. Math. China"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2146","DOI":"10.1137\/17M1113898","article-title":"Gradient descent finds the cubic-regularized nonconvex Newton step","volume":"29","author":"Carmon","year":"2019","journal-title":"SIAM J. Optim."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/s10589-019-00089-7","article-title":"A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization","volume":"73","author":"Birgin","year":"2019","journal-title":"Comput. Optim. Appl."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10589-019-00138-1","article-title":"Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization","volume":"75","author":"Raydan","year":"2020","journal-title":"Comput. Optim. Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10589-021-00274-7","article-title":"An accelerated first-order method with complexity analysis for solving cubic regularization subproblems","volume":"79","author":"Jiang","year":"2021","journal-title":"Comput. Optim. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","article-title":"Adaptive cubic regularisation methods for unconstrained optimization. Part II: Worst-case function-and derivative-evaluation complexity","volume":"130","author":"Cartis","year":"2011","journal-title":"Math. Program."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Nocedal, J., and Wright, S.J. (1999). Numerical Optimization, Springer.","DOI":"10.1007\/b98874"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1093\/imanum\/1.2.135","article-title":"Tracking the Progress of the Lanczos Algorithm for Large Symmetric Eigenproblems","volume":"1","author":"Parlett","year":"1981","journal-title":"IMA J. Numer. Anal."},{"key":"ref_21","first-page":"147","article-title":"An unconstrained optimization test functions collection","volume":"10","author":"Andrei","year":"2008","journal-title":"Adv. Model. Optim."},{"key":"ref_22","unstructured":"Chang, J., and Zhu, Z. (2022). An adaptive cubic regularization method for computing extreme eigenvalues of tensors. arXiv."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1016\/j.jsc.2005.05.007","article-title":"Eigenvalues of a real supersymmetric tensor","volume":"40","author":"Qi","year":"2005","journal-title":"J. Symb. Comput."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/10\/2191\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:56:25Z","timestamp":1760144185000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/10\/2191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,18]]},"references-count":23,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2022,10]]}},"alternative-id":["sym14102191"],"URL":"https:\/\/doi.org\/10.3390\/sym14102191","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2022,10,18]]}}}