{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:29:42Z","timestamp":1787333382997,"version":"build-2736575974"},"reference-count":32,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1998,11]]},"abstract":"<jats:p>We give conditions under which limited-memory quasi-Newton methods with exact line searches will terminate in n steps when minimizing n-dimensional quadratic functions. We show that although all Broyden family methods terminate in n steps in their full-memory versions, only BFGS does so with limited-memory. Additionally, we show that full-memory Broyden family methods with exact line searches terminate in at most n + p steps when p matrix updates are skipped. We introduce new limited-memory BFGS variants and test them on nonquadratic minimization problems.<\/jats:p>","DOI":"10.1137\/s1052623496306450","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1060-1083","source":"Crossref","is-referenced-by-count":29,"title":["BFGS with Update Skipping and Varying Memory"],"prefix":"10.1137","volume":"8","author":[{"given":"Tamara G.","family":"Kolda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dianne P.","family":"O'Leary","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Larry","family":"Nazareth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","unstructured":"I. Bongartz, A. R. Conn, N. Gould, and P. L. Toint, CUTE ftp site, ftp:\/\/thales.math.fundp.ac.be\/pub\/cute."},{"key":"R2","unstructured":"I. Bongartz, A. R. Conn, N. Gould, and P. L. Toint, CUTE home page, http:\/\/www.dci.clrc.ac.uk\/Activity.asp?CUTE."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/200979.201043"},{"key":"R4","unstructured":"A. Buckley,\n                      Test functions for unconstrained minimization\n                      , Tech. Report TR 1989CS\u20103, Mathematics, Statistics and Computing Centre, Dalhousie University, Halifax (CDN), 1989."},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582063"},{"key":"R6","unstructured":"A.Conn, NickGould, M.Lescrenier, Ph.Toint, Performance of a multifrontal scheme for partially separable optimization, Math. Appl., Vol. 275, Kluwer Acad. Publ., Dordrecht, 1994, 79\u20139695a:90118"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592055"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971200"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/0805010"},{"key":"R10","unstructured":"T. Gibson, D. O\u2019Leary, and L. Nazareth, L\u2010BFGS with Variations home page, http:\/\/www.cs.umd.edu\/users\/oleary\/LBFGS\/index.html (1996)."},{"key":"R11","unstructured":"P. E. Gill and W. Murray,\n                      Conjugate\u2010gradient methods for large\u2010scale nonlinear optimization\n                      , Tech. Report SOL 79\u201015, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA, 1979."},{"key":"R12","unstructured":"G. H. Golub and C. F. Van Loan,\n                      Matrix Computations\n                      , 2nd ed., The Johns Hopkins University Press, Baltimore, 1989."},{"key":"R13","unstructured":"N. Gould, Private communication to authors of [3]\u2010paper, 1989."},{"key":"R13","unstructured":"Cited in [1, 2]\u2010ftp, cute\u2010www."},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01399316"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/0803001"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589116"},{"key":"R17","unstructured":"D. G. Luenberger,\n                      Linear and Nonlinear Programming\n                      , 2nd ed., Addison\u2010Wesley, Reading, MA, 1984."},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1145\/355934.355936"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0721052"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/0801023"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1137\/0716059"},{"key":"R22","unstructured":"L. Nazareth,\n                      On the BFGS Method\n                      , unpublished manuscript, University of California at Berkeley, Berkeley, CA, 1981."},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1980-0572855-7"},{"key":"R24","unstructured":"JorgeNocedal, Theory of algorithms for unconstrained optimization, Acta Numer., Cambridge Univ. Press, Cambridge, 1992, 199\u201324293b:90087"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01583777"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.20.5.863"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/10.3.333"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.244"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1978-0483452-7"},{"key":"R30","unstructured":"P. Toint,\n                      Test problems for partially separable optimization and results for the routine PSPMIN\n                      , Tech. Report 83\/4, Department of Mathematics, FUNDP, Namur, Belgium, 1983."},{"key":"R30","unstructured":"Cited in [1, 2]\u2010ftp, cute\u2010www."}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1052623496306450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:55:23Z","timestamp":1787331323000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1052623496306450"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["10.1137\/S1052623496306450"],"URL":"https:\/\/doi.org\/10.1137\/s1052623496306450","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}