{"id":"https://openalex.org/W2136780394","doi":"https://doi.org/10.1080/10556780600822260","title":"Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization","display_name":"Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization","publication_year":2006,"publication_date":"2006-10-12","ids":{"openalex":"https://openalex.org/W2136780394","doi":"https://doi.org/10.1080/10556780600822260","mag":"2136780394"},"language":"en","primary_location":{"id":"doi:10.1080/10556780600822260","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780600822260","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Neculai Andrei","raw_affiliation_strings":["Research Institute for Informatics, Center for Advanced Modeling and Optimization , 8-10, Averescu Avenue, Bucharest 1, Romania","Research Institute for Informatics, Center for Advanced Modeling and Optimization, Romania#TAB#"],"affiliations":[{"raw_affiliation_string":"Research Institute for Informatics, Center for Advanced Modeling and Optimization , 8-10, Averescu Avenue, Bucharest 1, Romania","institution_ids":["https://openalex.org/I4210114681"]},{"raw_affiliation_string":"Research Institute for Informatics, Center for Advanced Modeling and Optimization, Romania#TAB#","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/I4210114681"],"apc_list":null,"apc_paid":null,"fwci":5.8931,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.96374777,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"22","issue":"4","first_page":"561","last_page":"571"},"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9914000034332275,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9907000064849854,"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.9103286266326904},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.9032644033432007},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.7568647861480713},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.7486384510993958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7095144987106323},{"id":"https://openalex.org/keywords/derivation-of-the-conjugate-gradient-method","display_name":"Derivation of the conjugate gradient method","score":0.6794502139091492},{"id":"https://openalex.org/keywords/conjugate-residual-method","display_name":"Conjugate residual method","score":0.6292089223861694},{"id":"https://openalex.org/keywords/preconditioner","display_name":"Preconditioner","score":0.5507923364639282},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5495962500572205},{"id":"https://openalex.org/keywords/biconjugate-gradient-method","display_name":"Biconjugate gradient method","score":0.4773397743701935},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.44304051995277405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4263962507247925},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3540436625480652},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33703967928886414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16790974140167236},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.1398209035396576}],"concepts":[{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.9103286266326904},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.9032644033432007},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.7568647861480713},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.7486384510993958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7095144987106323},{"id":"https://openalex.org/C198562538","wikidata":"https://www.wikidata.org/wiki/Q5262612","display_name":"Derivation of the conjugate gradient method","level":5,"score":0.6794502139091492},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.6292089223861694},{"id":"https://openalex.org/C167431342","wikidata":"https://www.wikidata.org/wiki/Q1754327","display_name":"Preconditioner","level":3,"score":0.5507923364639282},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5495962500572205},{"id":"https://openalex.org/C89408827","wikidata":"https://www.wikidata.org/wiki/Q855169","display_name":"Biconjugate gradient method","level":5,"score":0.4773397743701935},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.44304051995277405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4263962507247925},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3540436625480652},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33703967928886414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16790974140167236},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.1398209035396576},{"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/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780600822260","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780600822260","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323899","display_name":"Academia Rom\u00e2na","ror":"https://ror.org/0561n6946"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W150175414","https://openalex.org/W1578471822","https://openalex.org/W1892919230","https://openalex.org/W1968098332","https://openalex.org/W1968553199","https://openalex.org/W1988849934","https://openalex.org/W2010647796","https://openalex.org/W2012231377","https://openalex.org/W2012341322","https://openalex.org/W2012960907","https://openalex.org/W2016518303","https://openalex.org/W2018215034","https://openalex.org/W2028736557","https://openalex.org/W2043382734","https://openalex.org/W2061054410","https://openalex.org/W2085690530","https://openalex.org/W2085694061","https://openalex.org/W2091874256","https://openalex.org/W2122565324","https://openalex.org/W2316564661","https://openalex.org/W3175721619"],"related_works":["https://openalex.org/W2098528027","https://openalex.org/W3159557833","https://openalex.org/W3159907817","https://openalex.org/W4319027779","https://openalex.org/W4362580740","https://openalex.org/W3210179682","https://openalex.org/W2067422909","https://openalex.org/W2008374458","https://openalex.org/W1984722404","https://openalex.org/W2051800432"],"abstract_inverted_index":{"A":[0,126,191,217],"scaled":[1,22,44,100],"memoryless":[2,23,45],"BFGS":[3,24,46],"preconditioned":[4],"conjugate":[5,35,101,108,114,128,141,175,193,218],"gradient":[6,36,60,102,109,115,129,142,176,194,219],"algorithm":[7,80,103],"for":[8,75,86,131],"solving":[9],"unconstrained":[10,92,132],"optimization":[11,93],"problems":[12,95],"is":[13,18,41,48,61,72,81],"presented.":[14],"The":[15,38,56],"basic":[16],"idea":[17],"to":[19],"combine":[20],"the":[21,27,31,34,51,59,64,79,106,112,140,172],"method":[25,130,177,195,220],"and":[26,118,122,136,145,149,183,187,199,212],"preconditioning":[28],"technique":[29],"in":[30],"frame":[32],"of":[33,90],"method.":[37],"preconditioner,":[39],"which":[40],"also":[42],"a":[43,87],"matrix,":[47],"reset":[49],"when":[50],"Beale\u2013Powell":[52],"restart":[53],"criterion":[54],"holds.":[55],"parameter":[57],"scaling":[58],"selected":[62],"as":[63,169,171],"spectral":[65,113,127],"gradient.":[66],"In":[67],"very":[68],"mild":[69],"conditions,":[70],"it":[71],"shown":[73],"that,":[74],"strongly":[76],"convex":[77],"functions,":[78],"globally":[82],"convergent.":[83],"Computational":[84],"results":[85],"set":[88],"consisting":[89],"750":[91],"test":[94],"show":[96],"that":[97],"this":[98],"new":[99,192],"substantially":[104],"outperforms":[105],"known":[107],"methods":[110],"including":[111],"by":[116,143,181],"Birgin":[117],"Mart\u00ednez":[119],"[Birgin,":[120],"E.":[121,148],"Mart\u00ednez,":[123],"J.M.,":[124],"2001,":[125],"optimization.":[133],"Applied":[134],"Mathematics":[135],"Optimization,":[137,207],"43,":[138],"117\u2013128],":[139],"Polak":[144],"Ribi\u00e8re":[146],"[Polak,":[147],"Ribi\u00e8re,":[150],"G.,":[151],"1969,":[152],"Note":[153],"sur":[154],"la":[155],"convergence":[156],"de":[157,159],"m\u00e9thodes":[158],"directions":[160],"conjugu\u00e9es.":[161],"Revue":[162],"Francaise":[163],"Informat.":[164],"Reserche":[165],"Op\u00e9rationnelle,":[166],"16,":[167,208],"35\u201343],":[168],"well":[170],"most":[173],"recent":[174],"with":[178,196,221],"guaranteed":[179,197,222],"descent":[180,198,223],"Hager":[182],"Zhang":[184],"[Hager,":[185],"W.W.":[186,211],"Zhang,":[188,213],"H.,":[189,214],"2005,":[190],"an":[200],"efficient":[201],"line":[202],"search.":[203],"SIAM":[204],"Journal":[205],"on":[206,226],"170\u2013192;":[209],"Hager,":[210],"2004,":[215],"CG-DESCENT,":[216],"ACM":[224],"Transactions":[225],"Mathematical":[227],"Software,":[228],"32,":[229],"113\u2013137].":[230]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}