{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:44:16Z","timestamp":1774964656683,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T00:00:00Z","timestamp":1645488000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10589-022-00351-5","type":"journal-article","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T10:02:59Z","timestamp":1645524179000},"page":"61-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations"],"prefix":"10.1007","volume":"82","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7635-0873","authenticated-orcid":false,"given":"Hardik","family":"Tankaria","sequence":"first","affiliation":[]},{"given":"Shinji","family":"Sugimoto","sequence":"additional","affiliation":[]},{"given":"Nobuo","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,22]]},"reference":[{"key":"351_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barazilai","year":"1988","unstructured":"Barazilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"351_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., Yuan, Y.X.: On efficiently combining limited-memory and trust-region techniques. Math. Program. Comput. 9, 101\u2013134 (2017)","journal-title":"Math. Program. Comput."},{"key":"351_CR3","unstructured":"Burke, J. V., Wiegmann, A.: Notes on limited memory BFGS updating in a trust-region framework, Technical report, Department of Mathematics, University of Washington, (1996)"},{"key":"351_CR4","unstructured":"Burke, J. V., Wiegmann, A., Xu, L.: Limited memory BFGS updating in a trust-region framework, Technical report, Department of Mathematics, University of Washington, (2008)"},{"key":"351_CR5","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, 129\u2013156 (1994)","journal-title":"Math. Program."},{"key":"351_CR6","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"JE Dennis Jr","year":"1977","unstructured":"Dennis, J.E., Jr., Mor\u00e9, J.J.: Quasi-Newton methods, motivation and theory. SIAM Rev. 19, 46\u201389 (1977)","journal-title":"SIAM Rev."},{"key":"351_CR7","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, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"351_CR8","doi-asserted-by":"publisher","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":"351_CR9","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, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"351_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45, 503\u2013528 (1989)","journal-title":"Math. Program."},{"key":"351_CR11","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J.J., Sorenson, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"351_CR12","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35, 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"351_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"351_CR14","unstructured":"Nocedal, J.: Software for Large-scale Unconstrained Optimization: L-BFGS distribution, Available at: http:\/\/users.iems.northwestern.edu\/~nocedal\/lbfgs.html"},{"key":"351_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1093\/comjnl\/12.2.171","volume":"12","author":"JD Pearson","year":"1969","unstructured":"Pearson, J.D.: Variable metric methods of minimisation. Comput. J. 12, 171\u2013178 (1969)","journal-title":"Comput. J."},{"key":"351_CR16","unstructured":"Powell, M. J. D.: Some global convergence properties of a variable metric algorithm for minimization without exact line search, in: Cottle, R. W., Lemke, C. E. eds., Nonlinear Programming, SIAM-AMS Proceedings IX, SIAM Publications, (1976)"},{"key":"351_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S1052623494266365","volume":"7","author":"M Raydan","year":"1997","unstructured":"Raydan, M.: The Barzilai and Borwein gradient method for large scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"351_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01588962","volume":"14","author":"DF Shanno","year":"1978","unstructured":"Shanno, D.F., Kang-Hoh, P.A.: Matrix conditioning and nonlinear optimization. Math. Program. 14, 149\u2013160 (1978)","journal-title":"Math. Program."},{"key":"351_CR19","unstructured":"Steck, D., Kanzow, C.: Regularization of limited memory quasi-newton methods for large-scale nonconvex minimization. arXiv preprint arXiv:1911.04584 (2019)"},{"key":"351_CR20","unstructured":"Sugimoto, S., Yamashita, N.: A regularized limited-memory BFGS method for unconstrained minimization problems, Technical report, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan, (2014). Available at: http:\/\/www.optimization-online.org\/DB_HTML\/2014\/08\/4479.html"},{"key":"351_CR21","first-page":"159","volume":"156","author":"W Sun","year":"2004","unstructured":"Sun, W.: Nonmonotone trust region method for solving optimization problems. Appl. Math. Comput. 156, 159\u2013174 (2004)","journal-title":"Appl. Math. Comput."},{"key":"351_CR22","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s10898-015-0310-7","volume":"63","author":"DA Tarzangh","year":"2015","unstructured":"Tarzangh, D.A., Peyghami, M.R.: A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems. J. Global Optim. 63, 709\u2013728 (2015)","journal-title":"J. Global Optim."},{"key":"351_CR23","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, 27\u201346 (2010)","journal-title":"Appl. Math. Optim."},{"key":"351_CR24","unstructured":"Ueda, K., Yamashita, N.: A regularized Newton method without line search for unconstrained optimization, Technical Report, Department of Applied Mathematics and Physics, Kyoto University, (2009)"},{"key":"351_CR25","unstructured":"Ueda, K.: Studies on Regularized Newton-type methods for unconstrained minimization problems and their global complexity bounds, Doctoral thesis, Department of Applied Mathematics and Physics, Kyoto University, (2012)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00351-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00351-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00351-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,9]],"date-time":"2022-04-09T12:07:10Z","timestamp":1649506030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00351-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,22]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["351"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00351-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,22]]},"assertion":[{"value":"17 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}