{"id":"https://openalex.org/W2601243475","doi":"https://doi.org/10.1007/s11075-017-0321-1","title":"An adaptive scaled BFGS method for unconstrained optimization","display_name":"An adaptive scaled BFGS method for unconstrained optimization","publication_year":2017,"publication_date":"2017-04-03","ids":{"openalex":"https://openalex.org/W2601243475","doi":"https://doi.org/10.1007/s11075-017-0321-1","mag":"2601243475"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-017-0321-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-017-0321-1","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","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/A5010606032","display_name":"Neculai Andrei","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114681","display_name":"National Institute for Research & Development in Informatics","ror":"https://ror.org/028rq5v79","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210114681"]},{"id":"https://openalex.org/I33800924","display_name":"Academy of Romanian Scientists","ror":"https://ror.org/04ybnj478","country_code":"RO","type":"facility","lineage":["https://openalex.org/I33800924"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Neculai Andrei","raw_affiliation_strings":["Academy of Romanian Scientists, 54 Splaiul Independen\u0163ei, Sector 5, Bucharest, Romania","Research Institute for Informatics, Center for Advanced Modeling and Optimization, 8\u201310 Averescu Avenue, Sector 1, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Academy of Romanian Scientists, 54 Splaiul Independen\u0163ei, Sector 5, Bucharest, Romania","institution_ids":["https://openalex.org/I33800924"]},{"raw_affiliation_string":"Research Institute for Informatics, Center for Advanced Modeling and Optimization, 8\u201310 Averescu Avenue, Sector 1, Bucharest, Romania","institution_ids":["https://openalex.org/I4210114681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010606032"],"corresponding_institution_ids":["https://openalex.org/I33800924","https://openalex.org/I4210114681"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":6.7315,"has_fulltext":false,"cited_by_count":46,"citation_normalized_percentile":{"value":0.97670509,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"77","issue":"2","first_page":"413","last_page":"432"},"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.995199978351593,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.9892302751541138},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.883228600025177},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.7245951890945435},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.6576962471008301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6059311032295227},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.5862813591957092},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5801037549972534},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5744432806968689},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5149765610694885},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5099712610244751},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.4379340708255768},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3544241189956665},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2786714732646942},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.16396275162696838},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.07488524913787842}],"concepts":[{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.9892302751541138},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.883228600025177},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.7245951890945435},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.6576962471008301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6059311032295227},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.5862813591957092},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5801037549972534},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5744432806968689},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5149765610694885},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5099712610244751},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.4379340708255768},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3544241189956665},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2786714732646942},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.16396275162696838},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.07488524913787842},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11075-017-0321-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-017-0321-1","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","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":39,"referenced_works":["https://openalex.org/W63600712","https://openalex.org/W75734479","https://openalex.org/W613054787","https://openalex.org/W1864714722","https://openalex.org/W1969637950","https://openalex.org/W1969791456","https://openalex.org/W1970255220","https://openalex.org/W1988849934","https://openalex.org/W1992328986","https://openalex.org/W1998749910","https://openalex.org/W2003809942","https://openalex.org/W2005136695","https://openalex.org/W2012960907","https://openalex.org/W2023018956","https://openalex.org/W2024524305","https://openalex.org/W2033947507","https://openalex.org/W2037258733","https://openalex.org/W2038210983","https://openalex.org/W2045968916","https://openalex.org/W2051247543","https://openalex.org/W2062294426","https://openalex.org/W2064851697","https://openalex.org/W2069752241","https://openalex.org/W2076605490","https://openalex.org/W2078409719","https://openalex.org/W2092087339","https://openalex.org/W2095133175","https://openalex.org/W2103111465","https://openalex.org/W2105957130","https://openalex.org/W2112820497","https://openalex.org/W2129616681","https://openalex.org/W2149454052","https://openalex.org/W2152009788","https://openalex.org/W2152422232","https://openalex.org/W2153532571","https://openalex.org/W2316564661","https://openalex.org/W2340930132","https://openalex.org/W2989128237","https://openalex.org/W3175721619"],"related_works":["https://openalex.org/W2026245502","https://openalex.org/W3012383564","https://openalex.org/W4318192194","https://openalex.org/W2070932288","https://openalex.org/W4221162014","https://openalex.org/W2937637171","https://openalex.org/W2572889128","https://openalex.org/W3091576739","https://openalex.org/W2892976100","https://openalex.org/W1964096161"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}