{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T18:06:55Z","timestamp":1774375615786,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,21]],"date-time":"2011-12-21T00:00:00Z","timestamp":1324425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10589-011-9446-7","type":"journal-article","created":{"date-parts":[[2011,12,20]],"date-time":"2011-12-20T17:19:37Z","timestamp":1324401577000},"page":"1-22","source":"Crossref","is-referenced-by-count":35,"title":["Updating the regularization parameter in the adaptive cubic regularization algorithm"],"prefix":"10.1007","volume":"53","author":[{"given":"N. I. M.","family":"Gould","sequence":"first","affiliation":[]},{"given":"M.","family":"Porcelli","sequence":"additional","affiliation":[]},{"given":"P. L.","family":"Toint","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,21]]},"reference":[{"issue":"3","key":"9446_CR1","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1137\/040620886","volume":"17","author":"C. Audet","year":"2006","unstructured":"Audet, C., Orban, D.: Finding optimal algorithmic parameters using derivative-free optimization. SIAM J. Control Optim. 17(3), 642\u2013664 (2006)","journal-title":"SIAM J. Control Optim."},{"key":"9446_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/080732432","volume":"48","author":"S. Bellavia","year":"2010","unstructured":"Bellavia, S., Cartis, C., Gould, N.I.M., Morini, B., Toint, Ph.L.: Convergence of a regularized Euclidean residual algorithm for nonlinear least-squares. SIAM J. Numer. Anal. 48, 1\u201329 (2010)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"9446_CR3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C. Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic overestimation methods for unconstrained optimization. Part I: Motivation, convergence and numerical results. Math. Program., Ser. A 127(2), 245\u2013295 (2011)","journal-title":"Math. Program., Ser. A"},{"issue":"2","key":"9446_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C. Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic overestimation methods for unconstrained optimization. Part II: Worst-case function- and derivative-evaluation complexity. Math. Program. Ser. A 130(2), 295\u2013319 (2011). doi: 10.1007\/s10107-009-0337-y","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"9446_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.jco.2011.06.001","volume":"28","author":"C. Cartis","year":"2012","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Complexity bounds for second-order optimality in unconstrained optimization. J. Complex 28(1), 93\u2013108 (2012). doi: 10.1016\/j.jco.2011.06.001","journal-title":"J. Complex"},{"issue":"6","key":"9446_CR6","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C. Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization. SIAM J. Control Optim. 20(6), 2833\u20132852 (2010)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"9446_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10543-008-0206-8","volume":"49","author":"C. Cartis","year":"2009","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Trust-region and other regularisations of linear least-squares problems. BIT 49(1), 21\u201353 (2009)","journal-title":"BIT"},{"key":"9446_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"A.R. Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, Ph.L.: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"key":"9446_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9446_CR10","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis","year":"1983","unstructured":"Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice Hall, Englewood Cliffs (1983)"},{"key":"9446_CR11","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1137\/08072440X","volume":"20","author":"J.B. Erway","year":"2009","unstructured":"Erway, J.B., Gill, P.E.: A subspace minimization method for the trust-region step. SIAM J. Control Optim. 20, 1439\u20131461 (2009)","journal-title":"SIAM J. Control Optim."},{"key":"9446_CR12","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/070708494","volume":"20","author":"J.B. Erway","year":"2009","unstructured":"Erway, J.B., Gill, P.E., Griffin, J.D.: Iterative methods for finding a trust-region step. SIAM J. Control Optim. 20, 1110\u20131131 (2009)","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"9446_CR13","first-page":"205","volume":"2","author":"G.H. Golub","year":"1965","unstructured":"Golub, G.H., Kahan, W.: Calculating the singular values and pseudo-inverse of a matrix. SIAM J. Numer. Anal. 2(2), 205\u2013224 (1965)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"9446_CR14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10288-005-0065-y","volume":"3","author":"N.I.M. Gould","year":"2005","unstructured":"Gould, N.I.M., Orban, D., Sartenaer, A., Toint, Ph.L.: Sensitivity of trust-region algorithms to their parameters. 4OR 3(3), 227\u2013241 (2005)","journal-title":"4OR"},{"issue":"2","key":"9446_CR15","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"N.I.M. Gould","year":"1999","unstructured":"Gould, N.I.M., Lucidi, S., Roma, M., Toint, Ph.L.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Control Optim. 9(2), 504\u2013525 (1999)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"9446_CR16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: CUTEr, a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"9446_CR17","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/962437.962438","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: GALAHAD\u2014a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4), 353\u2013372 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"9446_CR18","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms. Technical Report NA\/12 (1981), Department of Applied Mathematics and Theoretical Physics, University of Cambridge, United Kingdom (1981)"},{"key":"9446_CR19","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1090\/S0025-5718-04-01731-4","volume":"74","author":"W.W. Hager","year":"2005","unstructured":"Hager, W.W., Park, S.C.: Global convergence of SSM for minimizing a quadratic over a sphere. Math. Comput. 74, 1413\u20131423 (2005)","journal-title":"Math. Comput."},{"key":"9446_CR20","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/S1052623499356071","volume":"12","author":"W.W. Hager","year":"2001","unstructured":"Hager, W.W.: Minimizing a quadratic over a sphere. SIAM J. Control Optim. 12, 188\u2013208 (2001)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"9446_CR21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Yu. Nesterov","year":"2006","unstructured":"Nesterov, Yu., Polyak, B.T.: Cubic regularization of Newton\u2019s method and its global performance. Math. Program. 108(1), 177\u2013205 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"9446_CR22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/355993.356000","volume":"8","author":"C.C. Paige","year":"1982","unstructured":"Paige, C.C., Saunders, M.A.: ALGORITHM 583: LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8(2), 195\u2013209 (1982)","journal-title":"ACM Trans. Math. Softw."},{"issue":"6","key":"9446_CR23","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1137\/S1064827595286955","volume":"18","author":"A. Sartenaer","year":"1997","unstructured":"Sartenaer, A.: Automatic determination of an initial trust region in nonlinear programming. SIAM J. Sci. Comput. 18(6), 1788\u20131803 (1997)","journal-title":"SIAM J. Sci. Comput."},{"key":"9446_CR24","doi-asserted-by":"crossref","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."},{"issue":"3","key":"9446_CR25","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1080\/10556780600605129","volume":"22","author":"M. Weiser","year":"2007","unstructured":"Weiser, M., Deuflhard, P., Erdmann, B.: Affine conjugate adaptive Newton methods for nonlinear elastomechanics. Optim. Methods Softw. 22(3), 413\u2013431 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9446_CR26","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s101070050012","volume":"87","author":"Y. Yuan","year":"1999","unstructured":"Yuan, Y.: On the truncated conjugate-gradient method. Math. Program., Ser. A 87(3), 561\u2013573 (1999)","journal-title":"Math. Program., Ser. A"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9446-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9446-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9446-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:41Z","timestamp":1559302601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9446-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,21]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9446"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9446-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,21]]}}}