{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:27:12Z","timestamp":1770989232413,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4095,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics Letters"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0893-9659(01)00162-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:21:05Z","timestamp":1027642865000},"page":"481-487","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":58,"title":["A numerical study of limited memory BFGS methods"],"prefix":"10.1016","volume":"15","author":[{"given":"J.L.","family":"Morales","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0893-9659(01)00162-8_BIB1","author":"Dennis","year":"1983"},{"key":"10.1016\/S0893-9659(01)00162-8_BIB2","author":"Fletcher","year":"1987"},{"key":"10.1016\/S0893-9659(01)00162-8_BIB3","author":"Nocedal","year":"1999"},{"key":"10.1016\/S0893-9659(01)00162-8_BIB4","unstructured":"P.E. Gill, W. Murray, and M.A. Saunders, SNOPT: An SQP algorithm for large-scale constrained optimization, Report NA 97-2, Dept. of Mathematics, University of California, San Diego, CA."},{"key":"10.1016\/S0893-9659(01)00162-8_BIB5","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","article-title":"Updating quasi-Newton matrices with limited storage","volume":"35","author":"Nocedal","year":"1980","journal-title":"Math. Comput."},{"key":"10.1016\/S0893-9659(01)00162-8_BIB6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","article-title":"CUTE: Constrained and Unconstrained Testing Environment","volume":"21","author":"Bongartz","year":"1995","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0893-9659(01)00162-8_BIB7","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/192115.192132","article-title":"Line search algorithms with guaranteed sufficient decrease","volume":"20","author":"Mor\u00e9","year":"1994","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0893-9659(01)00162-8_BIB8","unstructured":"J. Nocedal, Personal communication."}],"container-title":["Applied Mathematics Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901001628?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893965901001628?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:02:01Z","timestamp":1760238121000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893965901001628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0893965901001628"],"URL":"https:\/\/doi.org\/10.1016\/s0893-9659(01)00162-8","relation":{},"ISSN":["0893-9659"],"issn-type":[{"value":"0893-9659","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A numerical study of limited memory BFGS methods","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0893-9659(01)00162-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}