{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:16:33Z","timestamp":1776287793821,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T00:00:00Z","timestamp":1491177600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s11075-017-0321-1","type":"journal-article","created":{"date-parts":[[2017,4,3]],"date-time":"2017-04-03T03:28:39Z","timestamp":1491190119000},"page":"413-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["An adaptive scaled BFGS method for unconstrained optimization"],"prefix":"10.1007","volume":"77","author":[{"given":"Neculai","family":"Andrei","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,3]]},"reference":[{"key":"321_CR1","unstructured":"Al-Baali, M.: Analysis of a family of self-scaling quasi-Newton methods. Technical Report, Department of Mathematics and Computer Science. United Arab Emirates University (1993)"},{"key":"321_CR2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1018315205474","volume":"9","author":"M Al-Baali","year":"1998","unstructured":"Al-Baali, M.: Global and superlinear convergence of a class of self-scaling methods with inexact line searches. Comput. Optim. Appl. 9, 191\u2013203 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"321_CR3","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1023\/A:1022608410710","volume":"96","author":"M Al-Baali","year":"1998","unstructured":"Al-Baali, M.: Numerical experience with a class of self-scaling quasi-Newton algorithms. J. Optim. Theory Appl. 96, 533\u2013553 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"321_CR4","first-page":"147","volume":"10","author":"N Andrei","year":"2008","unstructured":"Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim.\u2014an Electronic International Journal 10, 147\u2013161 (2008)","journal-title":"Adv. Model. Optim.\u2014an Electronic International Journal"},{"key":"321_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-points step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"321_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1093\/imamat\/8.3.315","volume":"8","author":"MC Biggs","year":"1971","unstructured":"Biggs, M.C.: Minimization algorithms making use of non-quadratic properties of the objective function. J. Inst. Math. Appl. 8, 315\u2013327 (1971)","journal-title":"J. Inst. Math. Appl."},{"key":"321_CR7","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1093\/imamat\/12.3.337","volume":"12","author":"MC Biggs","year":"1973","unstructured":"Biggs, M.C.: A note on minimization algorithms making use of non-quadratic properties of the objective function. J. Inst. Math. Appl. 12, 337\u2013338 (1973)","journal-title":"J. Inst. Math. Appl."},{"key":"321_CR8","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","volume":"6","author":"CG Broyden","year":"1970","unstructured":"Broyden, C.G.: The convergence of a class of double-rank minimization algorithms. I. General considerations. J. Inst. Math. Appl. 6, 76\u201390 (1970)","journal-title":"J. Inst. Math. Appl."},{"key":"321_CR9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0802026","volume":"2","author":"RH Byrd","year":"1992","unstructured":"Byrd, R.H., Liu, D.C., Nocedal, J.: On the behavior of Broyden\u2019s class of quasi-Newton methods. SIAM J. Optim. 2, 533\u2013557 (1992)","journal-title":"SIAM J. Optim."},{"key":"321_CR10","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/0724077","volume":"24","author":"R Byrd","year":"1987","unstructured":"Byrd, R., Nocedal, J., Yuan, Y.: Global convergence of a class of quasi-Newton methods on convex problems. SIAM J. Numer. Anal. 24, 1171\u20131189 (1987)","journal-title":"SIAM J. Numer. Anal."},{"key":"321_CR11","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1137\/0726042","volume":"26","author":"R Byrd","year":"1989","unstructured":"Byrd, R., Nocedal, J.: A tool for the analysis of quasi-Newton methods with application to unconstrained minimization. SIAM J. Numer. Anal. 26, 727\u2013739 (1989)","journal-title":"SIAM J. Numer. Anal."},{"key":"321_CR12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10957-010-9652-y","volume":"146","author":"WY Cheng","year":"2010","unstructured":"Cheng, W.Y., Li, D.H.: Spectral scaling BFGS method. J. Optim. Theory Appl. 146, 305\u2013319 (2010)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"321_CR13","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1137\/S1052623401383455","volume":"13","author":"Y-H Dai","year":"2002","unstructured":"Dai, Y.-H.: Convergence properties of the BFGS Algorithm. SIAM J. Optim. 13(3), 693\u2013701 (2002)","journal-title":"SIAM J. Optim."},{"key":"321_CR14","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1090\/S0025-5718-1974-0343581-1","volume":"28","author":"JE Dennis","year":"1974","unstructured":"Dennis, J.E., Mor\u00e9, J.J.: A characterization of superlinear convergence and its application to quasi-Newton methods. Math. Comput. 28, 549\u2013560 (1974)","journal-title":"Math. Comput."},{"key":"321_CR15","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"JE Dennis","year":"1977","unstructured":"Dennis, J.E., Mor\u00e9, J.J.: Quasi-Newton methods, motivation and theory. SIAM Rev. 19, 46\u201389 (1977)","journal-title":"SIAM Rev."},{"key":"321_CR16","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF00934961","volume":"10","author":"LCW Dixon","year":"1972","unstructured":"Dixon, L.C.W.: Variable metric algorithms: necessary and sufficient conditions for identical behavior on nonquadratic functions. J. Optim. Theory Appl. 10, 34\u201340 (1972)","journal-title":"J. Optim. Theory Appl."},{"key":"321_CR17","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":"321_CR18","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","volume":"13","author":"R Fletcher","year":"1970","unstructured":"Fletcher, R.: A new approach to variable metric algorithms. Comput. J. 13, 317\u2013322 (1970)","journal-title":"Comput. J."},{"key":"321_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-94-009-0369-2_5","volume-title":"Algorithms for Continuous Optimization: The State of the Art","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R.: An overview of unconstrained optimization. In: Spedicato, E. (ed.) Algorithms for Continuous Optimization: The State of the Art, pp. 109\u2013143. Kluwer Academic Publishers, Boston (1994)"},{"key":"321_CR20","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/S1052623400307950","volume":"12","author":"PE Gill","year":"2001","unstructured":"Gill, P.E., Leonard, M.W.: Reduced-Hessian quasi Newton methods for unconstrained optimization. SIAM J. Optim. 12, 209\u2013237 (2001)","journal-title":"SIAM J. Optim."},{"key":"321_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","volume":"23","author":"D Goldfarb","year":"1970","unstructured":"Goldfarb, D.: A family of variable metric methods derived by variation mean. Math. Comput. 23, 23\u201326 (1970)","journal-title":"Math. Comput."},{"key":"321_CR22","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01594933","volume":"50","author":"A Griewank","year":"1991","unstructured":"Griewank, A.: The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients. Math. Program. 50, 141\u2013175 (1991)","journal-title":"Math. Program."},{"key":"321_CR23","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.L.: Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"321_CR24","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0377-0427(00)00540-9","volume":"129","author":"D-H 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":"321_CR25","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0167-6377(96)00050-8","volume":"20","author":"A Liao","year":"1997","unstructured":"Liao, A.: Modifying BFGS method. Oper. Res. Lett. 20, 171\u2013177 (1997)","journal-title":"Oper. Res. Lett."},{"key":"321_CR26","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0421-7","volume":"99","author":"WF Mascarenhas","year":"2004","unstructured":"Mascarenhas, W.F.: The BFGS method with exact line searches fails for non-convex objective functions. Math. Program. Ser. A 99, 49\u201361 (2004)","journal-title":"Math. Program. Ser. A"},{"key":"321_CR27","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1017\/S0962492900002270","volume":"1","author":"J Nocedal","year":"1992","unstructured":"Nocedal, J.: Theory of algorithms for unconstrained optimization. Acta Numer. 1, 199\u2013242 (1992)","journal-title":"Acta Numer."},{"key":"321_CR28","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01582136","volume":"61","author":"J Nocedal","year":"1993","unstructured":"Nocedal, J., Yuan, Y.: Analysis of self-scaling quasi-Newton method. Math. Program. 61, 19\u201337 (1993)","journal-title":"Math. Program."},{"key":"321_CR29","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1287\/mnsc.20.5.845","volume":"20","author":"SS Oren","year":"1974","unstructured":"Oren, S.S., Luenberger, G.G.: Self-scaling variable metric (SSVM) algorithms, part I: criteria and sufficient conditions for scaling a class of algorithms. Manag. Sci. 20, 845\u2013862 (1974)","journal-title":"Manag. Sci."},{"key":"321_CR30","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1093\/imamat\/7.1.21","volume":"7","author":"MJD Powell","year":"1971","unstructured":"Powell, M.J.D.: On the convergence of the variable metric algorithm. J. Inst. Math. Appl. 7, 21\u201336 (1971)","journal-title":"J. Inst. Math. Appl."},{"key":"321_CR31","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF01582161","volume":"34","author":"MJD Powell","year":"1986","unstructured":"Powell, M.J.D.: How bad are the BFGS and DFP methods when the objective function is quadratic. Math. Program. 34, 34\u201347 (1986)","journal-title":"Math. Program."},{"key":"321_CR32","first-page":"693","volume":"38","author":"MJD Powell","year":"1987","unstructured":"Powell, M.J.D.: Updating conjugate directions by the BFGS formula. Math. Program. 38, 693\u2013726 (1987)","journal-title":"Math. Program."},{"key":"321_CR33","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","volume":"24","author":"DF Shanno","year":"1970","unstructured":"Shanno, D.F.: Conditioning of quasi-Newton methods for function minimization. Math. Comput. 24, 647\u2013656 (1970)","journal-title":"Math. Comput."},{"key":"321_CR34","volume-title":"Optimization theory and methods. Nonlinear programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.X.: Optimization theory and methods. Nonlinear programming. Springer Science + Business Media, New York (2006)"},{"key":"321_CR35","first-page":"1","volume":"11","author":"HJ Wang","year":"1992","unstructured":"Wang, H.J., Yuan, Y.: A quadratic convergence method for one-dimensional optimization. Chin. J. Oper. Res. 11, 1\u201310 (1992)","journal-title":"Chin. J. Oper. Res."},{"key":"321_CR36","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1093\/imanum\/11.3.325","volume":"11","author":"Y Yuan","year":"1991","unstructured":"Yuan, Y.: A modified BFGS algorithm for unconstrained optimization. IMA J. Numer. Anal. 11, 325\u2013332 (1991)","journal-title":"IMA J. Numer. Anal."},{"key":"321_CR37","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0377-0427(00)00713-5","volume":"139","author":"JZ Zhang","year":"2001","unstructured":"Zhang, J.Z., Xu, C.X.: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations. J. Comput. Appl. Math. 139, 269\u2013278 (2001)","journal-title":"J. Comput. Appl. Math."},{"key":"321_CR38","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"P Wolfe","year":"1969","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. SIAM Rev. 11, 226\u2013235 (1969)","journal-title":"SIAM Rev."},{"key":"321_CR39","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"P Wolfe","year":"1971","unstructured":"Wolfe, P.: Convergence conditions for ascent methods. II: some corrections. SIAM Rev. 13, 185\u2013188 (1971)","journal-title":"SIAM Rev."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0321-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0321-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0321-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T06:40:25Z","timestamp":1516430425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0321-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,3]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["321"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0321-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,3]]}}}