{"id":"https://openalex.org/W2045319544","doi":"https://doi.org/10.1080/10556780802393326","title":"Another nonlinear conjugate gradient algorithm for unconstrained optimization","display_name":"Another nonlinear conjugate gradient algorithm for unconstrained optimization","publication_year":2008,"publication_date":"2008-12-12","ids":{"openalex":"https://openalex.org/W2045319544","doi":"https://doi.org/10.1080/10556780802393326","mag":"2045319544"},"language":"en","primary_location":{"id":"doi:10.1080/10556780802393326","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780802393326","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/I4210089412","display_name":"Applied Optimization (United States)","ror":"https://ror.org/004b0n253","country_code":"US","type":"company","lineage":["https://openalex.org/I4210089412"]},{"id":"https://openalex.org/I4210114681","display_name":"National Institute for Research and Development in Informatics - ICI Bucharest","ror":"https://ror.org/028rq5v79","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210114681"]}],"countries":["RO","US"],"is_corresponding":true,"raw_author_name":"Neculai Andrei","raw_affiliation_strings":["Research Institute for Informatics, Centre for Advanced Modelling and Optimization","Research Institute for Informatics, Centre for Advanced Modelling and Optimization, Bucharest, Romania#TAB#"],"affiliations":[{"raw_affiliation_string":"Research Institute for Informatics, Centre for Advanced Modelling and Optimization","institution_ids":["https://openalex.org/I4210089412"]},{"raw_affiliation_string":"Research Institute for Informatics, Centre for Advanced Modelling and Optimization, Bucharest, Romania#TAB#","institution_ids":["https://openalex.org/I4210114681"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010606032"],"corresponding_institution_ids":["https://openalex.org/I4210089412","https://openalex.org/I4210114681"],"apc_list":null,"apc_paid":null,"fwci":3.0862,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.90808314,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"24","issue":"1","first_page":"89","last_page":"104"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9912999868392944,"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/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.93351149559021},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.9039913415908813},{"id":"https://openalex.org/keywords/derivation-of-the-conjugate-gradient-method","display_name":"Derivation of the conjugate gradient method","score":0.8457546830177307},{"id":"https://openalex.org/keywords/conjugate-residual-method","display_name":"Conjugate residual method","score":0.7711532115936279},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.767393946647644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6751965880393982},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5889391899108887},{"id":"https://openalex.org/keywords/conjugacy-class","display_name":"Conjugacy class","score":0.5852194428443909},{"id":"https://openalex.org/keywords/biconjugate-gradient-method","display_name":"Biconjugate gradient method","score":0.5441854596138},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5419948101043701},{"id":"https://openalex.org/keywords/conjugate","display_name":"Conjugate","score":0.518337607383728},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.49103665351867676},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.4191170930862427},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3732295632362366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20834165811538696},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.156306654214859},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12498453259468079},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.08968067169189453},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.058771371841430664}],"concepts":[{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.93351149559021},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.9039913415908813},{"id":"https://openalex.org/C198562538","wikidata":"https://www.wikidata.org/wiki/Q5262612","display_name":"Derivation of the conjugate gradient method","level":5,"score":0.8457546830177307},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.7711532115936279},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.767393946647644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6751965880393982},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5889391899108887},{"id":"https://openalex.org/C87945829","wikidata":"https://www.wikidata.org/wiki/Q1353233","display_name":"Conjugacy class","level":2,"score":0.5852194428443909},{"id":"https://openalex.org/C89408827","wikidata":"https://www.wikidata.org/wiki/Q855169","display_name":"Biconjugate gradient method","level":5,"score":0.5441854596138},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5419948101043701},{"id":"https://openalex.org/C197336794","wikidata":"https://www.wikidata.org/wiki/Q5161150","display_name":"Conjugate","level":2,"score":0.518337607383728},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.49103665351867676},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.4191170930862427},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3732295632362366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20834165811538696},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.156306654214859},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12498453259468079},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.08968067169189453},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.058771371841430664},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780802393326","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780802393326","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":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W89654658","https://openalex.org/W150175414","https://openalex.org/W640673894","https://openalex.org/W1565013069","https://openalex.org/W1578471822","https://openalex.org/W1968098332","https://openalex.org/W1968553199","https://openalex.org/W1979347641","https://openalex.org/W1981556389","https://openalex.org/W1986914969","https://openalex.org/W1988849934","https://openalex.org/W1999855318","https://openalex.org/W2004669532","https://openalex.org/W2010647796","https://openalex.org/W2012231377","https://openalex.org/W2012960907","https://openalex.org/W2014851363","https://openalex.org/W2018215034","https://openalex.org/W2061378719","https://openalex.org/W2066743741","https://openalex.org/W2069752241","https://openalex.org/W2085694061","https://openalex.org/W2086108341","https://openalex.org/W2091549324","https://openalex.org/W2091874256","https://openalex.org/W2095927088","https://openalex.org/W2108560279","https://openalex.org/W2122565324","https://openalex.org/W2123019231","https://openalex.org/W2136780394","https://openalex.org/W2146580410","https://openalex.org/W2230977749","https://openalex.org/W2257235728","https://openalex.org/W2316564661","https://openalex.org/W2340930132","https://openalex.org/W3193463891"],"related_works":["https://openalex.org/W3159557833","https://openalex.org/W2183734858","https://openalex.org/W4319027779","https://openalex.org/W3107945686","https://openalex.org/W2358414513","https://openalex.org/W2355738879","https://openalex.org/W2797447965","https://openalex.org/W2384571804","https://openalex.org/W2371381925","https://openalex.org/W4233179678"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"nonlinear":[2,16,116],"conjugate":[3,17,33,77,117,127,137,148,182,189],"gradient":[4,18,34,118,128,138,149,183,190,195],"algorithm":[5,35,63,94,98,139,184],"which":[6,64],"is":[7,47,53,65,95,135],"a":[8,21,37,43,66,169],"modification":[9,69],"of":[10,57,70,76,106,172],"the":[11,58,71,107,136,187],"Dai":[12,108],"and":[13,73,109,114,144,154],"Yuan":[14],"[A":[15,146],"method":[19,150],"with":[20,42,151],"strong":[22],"global":[23],"convergence":[24],"property,":[25],"SIAM":[26,159],"J.":[27,83,160],"Optim.":[28,122,161],"10":[29],"(1999),":[30],"pp.":[31,92,125,164],"177\u2013182]":[32],"satisfying":[36],"parameterized":[38],"sufficient":[39],"descent":[40,153,197],"condition":[41],"parameter":[44,50],"\u03b4":[45,51],"k":[46,52],"proposed.":[48],"The":[49,97],"computed":[54],"by":[55,142],"means":[56],"conjugacy":[59,112],"condition,":[60],"thus":[61],"an":[62,103,155],"positive":[67],"multiplicative":[68],"Hestenes":[72],"Stiefel":[74],"[Methods":[75],"gradients":[78],"for":[79,168],"solving":[80],"linear":[81],"systems,":[82],"Res.":[84],"Nat.":[85],"Bur.":[86],"Standards":[87],"Sec.":[88],"B":[89],"48":[90],"(1952),":[91],"409\u2013436]":[93],"obtained.":[96],"can":[99],"be":[100],"viewed":[101],"as":[102],"adaptive":[104],"version":[105],"Liao":[110],"[New":[111],"conditions":[113],"related":[115],"methods,":[119],"Appl.":[120],"Math.":[121],"43":[123],"(2001),":[124],"87\u2013101]":[126],"algorithm.":[129],"Close":[130],"to":[131],"our":[132],"computational":[133],"scheme":[134],"recently":[140],"proposed":[141],"Hager":[143],"Zhang":[145],"new":[147,181],"guaranteed":[152],"efficient":[156],"line":[157],"search,":[158],"16":[162],"(2005),":[163],"170\u2013192].":[165],"Computational":[166],"results,":[167],"set":[170],"consisting":[171],"750":[173],"unconstrained":[174,193],"optimization":[175],"test":[176],"problems,":[177],"show":[178],"that":[179],"this":[180],"substantially":[185],"outperforms":[186],"known":[188],"algorithms.":[191],"Keywords:":[192],"optimizationconjugate":[194],"methodsufficient":[196],"conditionconjugacy":[198],"conditionnumerical":[199],"comparisons":[200],"AMS":[201],"Subject":[202],"Classification":[203],":":[204],"49M0749M1090C0665Kxx":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}