{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:58:53Z","timestamp":1775080733517,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771157"],"award-info":[{"award-number":["11771157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10589-022-00353-3","type":"journal-article","created":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T03:02:31Z","timestamp":1644980551000},"page":"829-856","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Diagonal BFGS updates and applications to the limited memory BFGS method"],"prefix":"10.1007","volume":"81","author":[{"given":"Donghui","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4514-0421","authenticated-orcid":false,"given":"Xiaozhou","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajian","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,16]]},"reference":[{"key":"353_CR1","doi-asserted-by":"publisher","first-page":"1553","DOI":"10.1080\/02331934.2018.1482298","volume":"67","author":"N Andrei","year":"2018","unstructured":"Andrei, N.: A diagonal quasi-Newton method based on minimizing the measure function of Byrd and Nocedal for unconstatined optimization. Optimization 67, 1553\u20131568 (2018)","journal-title":"Optimization"},{"key":"353_CR2","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1080\/01630563.2018.1552293","volume":"40","author":"N Andrei","year":"2019","unstructured":"Andrei, N.: A new diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization. Numer. Funct. Anal. Optim. 40, 1467\u20131488 (2019)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"353_CR3","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s11075-018-0562-7","volume":"81","author":"N Andrei","year":"2019","unstructured":"Andrei, N.: A diagonal quasi-Newton updating method for unconstrained optimization. Numer. Algor. 81, 575\u2013590 (2019)","journal-title":"Numer. Algor."},{"key":"353_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1019142304382","volume":"22","author":"M Al-Baali","year":"1999","unstructured":"Al-Baali, M.: Improved Hessian approximations for the limited memory BFGS method. Numer. Algor. 22, 99\u2013112 (1999)","journal-title":"Numer. Algor."},{"key":"353_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, L.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"353_CR6","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.-J., Zikrin, S., Yuan, Y.-X.: On efficiently combining limited-memory and trust-region techniques. Math. Progr. Comput. 9, 101\u2013134 (2017)","journal-title":"Math. Progr. Comput."},{"key":"353_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1080\/02331930310001611547","volume":"52","author":"Y Dai","year":"2003","unstructured":"Dai, Y.: Alternate step gradient method. Optimization 52, 395\u2013415 (2003)","journal-title":"Optimization"},{"key":"353_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"Y Dai","year":"2005","unstructured":"Dai, Y., Fletcher, R.: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming. Numer. Mathematik 100, 21\u201347 (2005)","journal-title":"Numer. Mathematik"},{"key":"353_CR9","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1093\/imanum\/drl006","volume":"26","author":"Y Dai","year":"2006","unstructured":"Dai, Y., Hager, W.W., Zhang, H.: The cyclic Barzilai-Borwein method for unconstrained optimization. IMA J. Numer. Anal. 26, 604\u2013627 (2006)","journal-title":"IMA J. Numer. Anal."},{"key":"353_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H., Liao, L.-Z.: R-linear convergence of the barzilai and borwein gradient method. IMA J. Numer. Anal. 22, 1\u201310 (2002)","journal-title":"IMA J. Numer. Anal."},{"key":"353_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1023\/A:1014838419611","volume":"22","author":"Y Dai","year":"2002","unstructured":"Dai, Y., Yuan, J., Yuan, Y.-X.: Modified two-point step size gradient methods for unconstrained optimization. Comput. Optim. Appl. 22, 103\u2013109 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"353_CR12","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":"353_CR13","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1137\/0730067","volume":"30","author":"JE Dennis Jr","year":"1993","unstructured":"Dennis, J.E., Jr., Wolkowicz, H.: Sizing and least change secant update. SIAM J. Numer. Anal. 30, 1291\u20131314 (1993)","journal-title":"SIAM J. Numer. Anal."},{"key":"353_CR14","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. Progr. 91, 201\u2013213 (2002)","journal-title":"Math. Progr."},{"key":"353_CR15","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1080\/10556788.2016.1196205","volume":"31","author":"S Enshaei","year":"2016","unstructured":"Enshaei, S., Leong, W.J., Farid, M.: Diagonal quasi-Newton method via variational principle under generalized Frobenius norm. Optim. Methods Softw. 31, 1258\u20131271 (2016)","journal-title":"Optim. Methods Softw."},{"key":"353_CR16","first-page":"165","volume-title":"Low storage methods for unconstrained optimization, in lectures in applied mathematics (AMS)","author":"R Fletcher","year":"1990","unstructured":"Fletcher, R.: Low storage methods for unconstrained optimization, in lectures in applied mathematics (AMS), vol. 26, pp. 165\u2013179. American Mathematical Society, Providence, RI (1990)"},{"key":"353_CR17","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S003614299427315X","volume":"36","author":"A Friedlander","year":"1999","unstructured":"Friedlander, A., Mart\u0142nez, J.M., Raydan, M.: Gradient method with retards and generalizations. SIAM J. Numer. Anal. 36, 275\u2013289 (1999)","journal-title":"SIAM J. Numer. Anal."},{"key":"353_CR18","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01589113","volume":"45","author":"J-Ch Gilbert","year":"1989","unstructured":"Gilbert, J.-Ch., Lemar\u00e9chal, C.: Some numerical experiments with variable storage quasi-Newton algorithms. Math. Progr. 45, 407\u2013435 (1989)","journal-title":"Math. Progr."},{"key":"353_CR19","doi-asserted-by":"crossref","unstructured":"Gill, P.E., Murray, W., Conjugate gradient methods for large-scale nonlinear optimization, Technical Report SOL,: 79\u201315. Stanford University, Stanford, CA, USA, Department of Operations Research (1979)","DOI":"10.21236\/ADA078713"},{"key":"353_CR20","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NI Gould","year":"2015","unstructured":"Gould, N.I., Orban, D., Toint, Ph.: Cutest: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"353_CR21","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/S1052623499354242","volume":"11","author":"DH Li","year":"2001","unstructured":"Li, D.H., Fukushima, M.: On the global convergence of BFGS method for nonconvex unconstrained optimization problems. SIAM J. Optim. 11, 1054\u20131064 (2001)","journal-title":"SIAM J. Optim."},{"key":"353_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"DH Li","year":"2001","unstructured":"Li, D.H., Fukushima, M.: A modified BFGS method and its global convergence in nonconvex minimization. J. Comput. Appl. Math. 129, 15\u201335 (2001)","journal-title":"J. Comput. Appl. Math."},{"key":"353_CR23","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. Progr. 45, 503\u2013528 (1989)","journal-title":"Math. Progr."},{"key":"353_CR24","volume-title":"Linear and nonlinear programming","author":"DG Luenberger","year":"1994","unstructured":"Luenberger, D.G.: Linear and nonlinear programming, 2nd edn. Addison-Wesley, Reading, MA (1994)","edition":"2"},{"key":"353_CR25","first-page":"247","volume":"35","author":"WJ Leong","year":"2012","unstructured":"Leong, W.J., Farid, M., Hassan, M.A.: Scaling on diagonal quasi-Newton update for large-scale unconstrained optimization. Bull. Malay. Math. Sci. Soc. 35, 247\u2013256 (2012)","journal-title":"Bull. Malay. Math. Sci. Soc."},{"key":"353_CR26","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":"353_CR27","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, 2nd edn. Springer-Verlag, New York Inc (1999)","edition":"2"},{"key":"353_CR28","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1093\/imanum\/13.3.321","volume":"13","author":"M Raydan","year":"1993","unstructured":"Raydan, M.: On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13, 321\u2013326 (1993)","journal-title":"IMA J. Numer. Anal."},{"key":"353_CR29","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 the large scale unconstrained minimization problem. SIAM J. Optim. 7, 26\u201333 (1997)","journal-title":"SIAM J. Optim."},{"key":"353_CR30","unstructured":"Schmidt,M.: minFunc: unconstrained differentiable multivariate optimization in Matlab, http:\/\/www.cs.ubc.ca\/\u00a0schmidtm\/Software\/minFunc.html, (2005)"},{"key":"353_CR31","first-page":"149","volume":"24","author":"Y-X Yuan","year":"2006","unstructured":"Yuan, Y.-X.: A new step size for the steepest descent method. J. Comput. Math. 24, 149\u2013156 (2006)","journal-title":"J. Comput. Math."},{"key":"353_CR32","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1137\/S1052623498331793","volume":"9","author":"M Zhu","year":"1999","unstructured":"Zhu, M., Nazareth, J.L., Wolkowicz, H.: The quasi-Cauchy relation and diagonal updating. SIAM J. Optim. 9, 1192\u20131204 (1999)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00353-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00353-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00353-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T17:27:00Z","timestamp":1646674020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00353-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,16]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["353"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00353-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,16]]},"assertion":[{"value":"4 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}