{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:28:25Z","timestamp":1780385305110,"version":"3.54.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,4,4]],"date-time":"2014-04-04T00:00:00Z","timestamp":1396569600000},"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":[[2014,10]]},"DOI":"10.1007\/s10589-014-9656-x","type":"journal-article","created":{"date-parts":[[2014,4,3]],"date-time":"2014-04-03T16:16:04Z","timestamp":1396541764000},"page":"321-351","source":"Crossref","is-referenced-by-count":26,"title":["A regularized Newton method without line search for unconstrained optimization"],"prefix":"10.1007","volume":"59","author":[{"given":"Kenji","family":"Ueda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nobuo","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,4,4]]},"reference":[{"key":"9656_CR1","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/S0895479896296921","volume":"20","author":"C Ashcraft","year":"1998","unstructured":"Ashcraft, C., Grimes, R.G., Lewis, J.G.: Accurate symmetric indefinite linear equation solvers. SIAM J. Matrix Anal. Appl. 20, 513\u2013561 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9656_CR2","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, P.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization problems. SIAM J. Optim. 20, 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"key":"9656_CR3","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1137\/S0895479896302898","volume":"19","author":"SH Cheng","year":"1998","unstructured":"Cheng, S.H., Higham, N.J.: A modified Cholesky algorithm based on a symmetric indefinite factorization. SIAM J. Matrix Anal. Appl. 19, 1097\u20131110 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9656_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SIAM, Philadelphia (2000)"},{"key":"9656_CR5","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01588330","volume":"18","author":"JP Crouzeix","year":"1980","unstructured":"Crouzeix, J.P.: On second order conditions for quasiconvexity. Math. Program. 18, 349\u2013352 (1980)","journal-title":"Math. Program."},{"key":"9656_CR6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED 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":"9656_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEr (and SifDec), a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29, 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"9656_CR8","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/050623012","volume":"19","author":"S Gratton","year":"2008","unstructured":"Gratton, S., Sartenaer, A., Toint, P.L.: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19, 414\u2013444 (2008)","journal-title":"SIAM J. Optim."},{"key":"9656_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/B:COAP.0000026881.96694.32","volume":"28","author":"DH Li","year":"2004","unstructured":"Li, D.H., Fukushima, M., Qi, L., Yamashita, N.: Regularized Newton methods for convex minimization problems with singular solutions. Comput. Optim. Appl. 28, 131\u2013147 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"9656_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s10589-007-9128-7","volume":"43","author":"YJ Li","year":"2009","unstructured":"Li, Y.J., Li, D.H.: Truncated regularized Newton method for convex minimizations. Comput. Optim. Appl. 43, 119\u2013131 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"9656_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Kluwer Academic, Dordrecht (2004)"},{"key":"9656_CR12","doi-asserted-by":"crossref","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, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"9656_CR13","first-page":"299","volume":"79","author":"JS Pang","year":"1997","unstructured":"Pang, J.S.: Error bounds in mathematical programming. Math. Program. 79, 299\u2013332 (1997)","journal-title":"Math. Program."},{"key":"9656_CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-007-0143-3","volume":"120","author":"RA Polyak","year":"2009","unstructured":"Polyak, R.A.: Regularized Newton method for unconstrained convex optimization. Math. Program. 120, 125\u2013145 (2009)","journal-title":"Math. Program."},{"key":"9656_CR15","doi-asserted-by":"crossref","first-page":"1913","DOI":"10.1007\/s11590-011-0386-z","volume":"6","author":"C Shen","year":"2012","unstructured":"Shen, C., Chen, X., Liang, Y.: A regularized Newton method for degenerate unconstrained optimization problems. Optim. Lett. 6, 1913\u20131933 (2012)","journal-title":"Optim. Lett."},{"key":"9656_CR16","unstructured":"Ueda, K.: A regularized Newton method without line search for unconstrained optimization. Master\u2019s thesis, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University (2009). http:\/\/www-optima.amp.i.kyoto-u.ac.jp\/result\/masterdoc\/20ueda.pdf"},{"key":"9656_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00245-009-9094-9","volume":"62","author":"K Ueda","year":"2010","unstructured":"Ueda, K., Yamashita, N.: Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization. Appl. Math. Optim. 62, 27\u201346 (2010)","journal-title":"Appl. Math. Optim."},{"key":"9656_CR18","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/978-3-7091-6217-0_17","volume":"15","author":"N Yamashita","year":"2001","unstructured":"Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg\u2013Marquardt method. Computing Supplementum(Wien) 15, 227\u2013238 (2001)","journal-title":"Computing Supplementum(Wien)"}],"updated-by":[{"DOI":"10.1007\/s10589-016-9859-4","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000}}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9656-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9656-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9656-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:36Z","timestamp":1559241456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9656-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,4]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9656"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9656-x","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10589-016-9859-4","asserted-by":"object"}]},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,4]]}}}