{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:26Z","timestamp":1740145166656,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T00:00:00Z","timestamp":1517788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771210","11701283"],"award-info":[{"award-number":["11771210","11701283"]}],"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":["11471159","11571169"],"award-info":[{"award-number":["11471159","11571169"]}],"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":["61661136001"],"award-info":[{"award-number":["61661136001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11590-018-1236-z","type":"journal-article","created":{"date-parts":[[2018,2,5]],"date-time":"2018-02-05T05:15:20Z","timestamp":1517807720000},"page":"1639-1658","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A new regularized quasi-Newton method for unconstrained optimization"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3090-8944","authenticated-orcid":false,"given":"Hao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Ni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,5]]},"reference":[{"issue":"1","key":"1236_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-Newton matrices and their use in limited memory methods. Math. Program. 63(1), 129\u2013156 (1994)","journal-title":"Math. Program."},{"issue":"1","key":"1236_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s12532-016-0109-7","volume":"9","author":"O Burdakov","year":"2017","unstructured":"Burdakov, O., Gong, L., Zikrin, S., et al.: On efficiently combining limited-memory and trust-region techniques. Math. Program. Comput. 9(1), 101\u2013134 (2017)","journal-title":"Math. Program. Comput."},{"key":"1236_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF00939608","volume":"26","author":"NY Deng","year":"1993","unstructured":"Deng, N.Y., Xiao, Y., Zhou, F.J.: Nonmonotone trust region algorithm. J. Optim. Theory Appl. 26, 259\u2013285 (1993)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1236_CR4","doi-asserted-by":"publisher","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(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"1236_CR5","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/140997737","volume":"36","author":"JB Erway","year":"2015","unstructured":"Erway, J.B., Marcia, R.F.: On efficiently computing the eigenvalues of limited-memory quasi-newton matrices. SIAM J. Matrix Anal. A. 36(3), 1338\u20131359 (2015)","journal-title":"SIAM J. Matrix Anal. A."},{"issue":"3","key":"1236_CR6","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3), 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1236_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23(4), 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"issue":"9","key":"1236_CR8","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.1016\/j.camwa.2007.08.038","volume":"55","author":"NZ Gu","year":"2008","unstructured":"Gu, N.Z., Mo, J.T.: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization. Comput. Math. Appl. 55(9), 2158\u20132172 (2008)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"1236_CR9","doi-asserted-by":"publisher","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., et al.: Regularized newton methods for convex minimization problems with singular solutions. Comput. Optim. Appl. 28(2), 131\u2013147 (2004)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1236_CR10","doi-asserted-by":"publisher","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(1), 119\u2013131 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"1236_CR11","unstructured":"Mor\n                    \n                      \n                    \n                    $$\\acute{e}$$\n                    \n                      \n                        \n                          e\n                          \u00b4\n                        \n                      \n                    \n                  , J.J., Sorensen, D. C.: Computing a Trust Region Step. SIAM J. Sci. Stat. Comput. 4(3), 553\u2013572 (1983)"},{"issue":"1","key":"1236_CR12","doi-asserted-by":"publisher","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(1), 125\u2013145 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"1236_CR13","doi-asserted-by":"publisher","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(1), 27\u201346 (2010)","journal-title":"Appl. Math. Optim."},{"issue":"1","key":"1236_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10589-014-9656-x","volume":"59","author":"K Ueda","year":"2014","unstructured":"Ueda, K., Yamashita, N.: A regularized Newton method without line search for unconstrained optimization. Comput. Optim. Appl. 59(1), 321\u2013351 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1236_CR15","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"12","author":"HC Zhang","year":"2004","unstructured":"Zhang, H.C., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 12, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"1236_CR16","first-page":"460","volume":"259","author":"H Zhang","year":"2015","unstructured":"Zhang, H., Ni, Q.: A new regularized quasi-Newton algorithm for unconstrained optimization. Appl. Math. Comput. 259, 460\u2013469 (2015)","journal-title":"Appl. Math. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1236-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1236-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1236-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T19:24:38Z","timestamp":1549308278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1236-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,5]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["1236"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1236-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2018,2,5]]},"assertion":[{"value":"13 July 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}