{"id":"https://openalex.org/W2000359198","doi":"https://doi.org/10.1137/0916069","title":"A Limited Memory Algorithm for Bound Constrained Optimization","display_name":"A Limited Memory Algorithm for Bound Constrained Optimization","publication_year":1995,"publication_date":"1995-09-01","ids":{"openalex":"https://openalex.org/W2000359198","doi":"https://doi.org/10.1137/0916069","mag":"2000359198"},"language":"en","primary_location":{"id":"doi:10.1137/0916069","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0916069","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","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/A5110661221","display_name":"Richard H. Byrd","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Richard H. Byrd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024947654","display_name":"Peihuang Lu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peihuang Lu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081856145","display_name":"Jorge Nocedal","orcid":"https://orcid.org/0000-0002-9662-2730"},"institutions":[{"id":"https://openalex.org/I4210155590","display_name":"Management Sciences (United States)","ror":"https://ror.org/05shz5j84","country_code":"US","type":"company","lineage":["https://openalex.org/I4210155590"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jorge Nocedal","raw_affiliation_strings":["Industrial Engineering and Management Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Industrial Engineering and Management Sciences","institution_ids":["https://openalex.org/I4210155590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002468787","display_name":"Ciyou Zhu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ciyou Zhu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5110661221"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.2686,"has_fulltext":false,"cited_by_count":6136,"citation_normalized_percentile":{"value":0.976295,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"16","issue":"5","first_page":"1190","last_page":"1208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9965999722480774,"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.9911999702453613,"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/hessian-matrix","display_name":"Hessian matrix","score":0.8623487949371338},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.7924946546554565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6791815757751465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5681661367416382},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5423515439033508},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5106270909309387},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.49814701080322266},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4721909761428833},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4542945921421051},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4456435739994049},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4455627501010895},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.4231048822402954},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41788148880004883},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.36656561493873596},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3343814015388489},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2689661979675293},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.22713318467140198},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.08009707927703857}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.8623487949371338},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.7924946546554565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6791815757751465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5681661367416382},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5423515439033508},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5106270909309387},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.49814701080322266},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4721909761428833},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4542945921421051},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4456435739994049},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4455627501010895},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.4231048822402954},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41788148880004883},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.36656561493873596},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3343814015388489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2689661979675293},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.22713318467140198},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.08009707927703857},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0916069","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0916069","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W291003596","https://openalex.org/W1655990431","https://openalex.org/W1981648990","https://openalex.org/W2008063657","https://openalex.org/W2013243898","https://openalex.org/W2040006905","https://openalex.org/W2048221927","https://openalex.org/W2051434435","https://openalex.org/W2051669046","https://openalex.org/W2058839679","https://openalex.org/W2098132613","https://openalex.org/W2130844535","https://openalex.org/W2148589597","https://openalex.org/W2162988958","https://openalex.org/W3118870036","https://openalex.org/W4252894371","https://openalex.org/W4299512035"],"related_works":["https://openalex.org/W1983117412","https://openalex.org/W2026245502","https://openalex.org/W4221162014","https://openalex.org/W1964096161","https://openalex.org/W3091576739","https://openalex.org/W2981801659","https://openalex.org/W4318192194","https://openalex.org/W4307537123","https://openalex.org/W2039312875","https://openalex.org/W2056914158"],"abstract_inverted_index":{"An":[0],"algorithm":[1,54],"for":[2],"solving":[3],"large":[4,65],"nonlinear":[5],"optimization":[6],"problems":[7,66],"with":[8],"simple":[9],"bounds":[10],"is":[11,14,37],"described.":[12],"It":[13,36],"based":[15],"on":[16,61],"the":[17,30,33,44,47,53],"gradient":[18],"projection":[19],"method":[20],"and":[21],"uses":[22],"a":[23,62],"limited":[24,48],"memory":[25,49],"BFGS":[26],"matrix":[27],"to":[28,40,51],"approximate":[29],"Hessian":[31],"of":[32,43,46,58,64],"objective":[34],"function.":[35],"shown":[38],"how":[39],"take":[41],"advantage":[42],"form":[45],"approximation":[50],"implement":[52],"efficiently.":[55],"The":[56],"results":[57],"numerical":[59],"tests":[60],"set":[63],"are":[67],"reported.":[68]},"counts_by_year":[{"year":2026,"cited_by_count":155},{"year":2025,"cited_by_count":455},{"year":2024,"cited_by_count":473},{"year":2023,"cited_by_count":422},{"year":2022,"cited_by_count":481},{"year":2021,"cited_by_count":529},{"year":2020,"cited_by_count":461},{"year":2019,"cited_by_count":393},{"year":2018,"cited_by_count":325},{"year":2017,"cited_by_count":312},{"year":2016,"cited_by_count":317},{"year":2015,"cited_by_count":272},{"year":2014,"cited_by_count":246},{"year":2013,"cited_by_count":203},{"year":2012,"cited_by_count":178}],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2025-10-10T00:00:00"}