{"id":"https://openalex.org/W2943853279","doi":"https://doi.org/10.1137/16m1065100","title":"Adaptive, Limited-Memory BFGS Algorithms for Unconstrained Optimization","display_name":"Adaptive, Limited-Memory BFGS Algorithms for Unconstrained Optimization","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2943853279","doi":"https://doi.org/10.1137/16m1065100","mag":"2943853279"},"language":"en","primary_location":{"id":"doi:10.1137/16m1065100","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1065100","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055227859","display_name":"Paul T. Boggs","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paul T. Boggs","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110661221","display_name":"Richard H. Byrd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard H. Byrd","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055227859"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5763,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.88854341,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"29","issue":"2","first_page":"1282","last_page":"1299"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.9643287658691406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6152743101119995},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5704834461212158},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.464111864566803},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4430122971534729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34358131885528564},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.136782705783844}],"concepts":[{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.9643287658691406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6152743101119995},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5704834461212158},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.464111864566803},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4430122971534729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34358131885528564},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.136782705783844},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1065100","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1065100","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3746155094","display_name":null,"funder_award_id":"DMS-1620070","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W51269470","https://openalex.org/W1968553199","https://openalex.org/W1985302366","https://openalex.org/W2000359198","https://openalex.org/W2022916138","https://openalex.org/W2051434435","https://openalex.org/W2051669046","https://openalex.org/W2058839679","https://openalex.org/W2062294426","https://openalex.org/W2081927732","https://openalex.org/W2091917610","https://openalex.org/W2109551514","https://openalex.org/W2149454052"],"related_works":["https://openalex.org/W2016852760","https://openalex.org/W1972403393","https://openalex.org/W2960088919","https://openalex.org/W3078710903","https://openalex.org/W2787890441","https://openalex.org/W2050511877","https://openalex.org/W3114286735","https://openalex.org/W3128946703","https://openalex.org/W2375120501","https://openalex.org/W2059808679"],"abstract_inverted_index":{"The":[0],"limited-memory":[1],"BFGS":[2],"method":[3],"(L-BFGS)":[4],"has":[5],"become":[6],"the":[7,25,67,90,118,121],"workhorse":[8],"optimization":[9,15],"strategy":[10],"for":[11,131],"many":[12],"large-scale":[13],"nonlinear":[14],"problems.":[16],"A":[17],"major":[18],"difficulty":[19],"with":[20],"L-BFGS":[21,80,122],"is":[22,37,63],"that,":[23],"although":[24],"memory":[26,42,94,104],"size":[27,43,105],"$m$":[28,50],"can":[29],"have":[30],"a":[31,48,102],"significant":[32],"effect":[33],"on":[34,69],"performance,":[35,55],"it":[36],"difficult":[38],"to":[39,71,88,99],"know":[40],"what":[41],"will":[44],"work":[45],"best.":[46],"Importantly,":[47],"larger":[49],"does":[51],"not":[52],"necessarily":[53],"improve":[54],"but":[56],"may,":[57],"in":[58,66],"fact,":[59],"degrade":[60],"it.":[61],"There":[62],"no":[64],"guidance":[65],"literature":[68],"how":[70],"choose":[72,101],"$m$.":[73],"In":[74],"this":[75],"paper,":[76],"we":[77],"briefly":[78],"review":[79],"and":[81],"then":[82],"suggest":[83],"two":[84],"computationally":[85],"efficient":[86],"ways":[87],"measure":[89],"effectiveness":[91],"of":[92,120],"various":[93],"sizes,":[95],"thus":[96],"allowing":[97],"us":[98],"adaptively":[100],"different":[103],"at":[106],"each":[107],"iteration.":[108],"Our":[109],"overall":[110],"numerical":[111],"results":[112,125],"illustrate":[113],"that":[114],"our":[115],"approach":[116],"improves":[117],"performance":[119],"method.":[123],"These":[124],"also":[126],"indicate":[127],"some":[128],"further":[129],"directions":[130],"research.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}