{"id":"https://openalex.org/W2126217185","doi":"https://doi.org/10.1007/s11075-014-9845-9","title":"A new three-term conjugate gradient algorithm for unconstrained optimization","display_name":"A new three-term conjugate gradient algorithm for unconstrained optimization","publication_year":2014,"publication_date":"2014-04-10","ids":{"openalex":"https://openalex.org/W2126217185","doi":"https://doi.org/10.1007/s11075-014-9845-9","mag":"2126217185"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-014-9845-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-014-9845-9","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, Splaiul Independenei Nr. 54, Sector 5, Bucharest, Romania","Research Institute for Informatics, Center for Advanced Modeling and Optimization, 8-10, Averescu Avenue, Bucharest 1, Romania"],"affiliations":[{"raw_affiliation_string":"Academy of Romanian Scientists, Splaiul Independenei Nr. 54, Sector 5, Bucharest, Romania","institution_ids":["https://openalex.org/I33800924"]},{"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"]}]}],"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":2.953,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.9061973,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"68","issue":"2","first_page":"305","last_page":"321"},"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.983299970626831,"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.9829999804496765,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8330243825912476},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.7497155070304871},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.6540480256080627},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.6034200191497803},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.5849471688270569},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5466471314430237},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4621172249317169},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.44097819924354553},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.435266375541687},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.43090397119522095},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.42288699746131897},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.42270731925964355},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39838907122612},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37008464336395264},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09940430521965027}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8330243825912476},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.7497155070304871},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.6540480256080627},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.6034200191497803},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.5849471688270569},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5466471314430237},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4621172249317169},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.44097819924354553},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.435266375541687},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.43090397119522095},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.42288699746131897},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.42270731925964355},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39838907122612},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37008464336395264},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09940430521965027},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","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/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11075-014-9845-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-014-9845-9","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1602183298","https://openalex.org/W1968098332","https://openalex.org/W1978386996","https://openalex.org/W1978621794","https://openalex.org/W1981556389","https://openalex.org/W1986579476","https://openalex.org/W1987327258","https://openalex.org/W1988849934","https://openalex.org/W2000942978","https://openalex.org/W2009999380","https://openalex.org/W2012960907","https://openalex.org/W2018215034","https://openalex.org/W2018332842","https://openalex.org/W2039084584","https://openalex.org/W2050888558","https://openalex.org/W2051434435","https://openalex.org/W2051669046","https://openalex.org/W2075313995","https://openalex.org/W2076396137","https://openalex.org/W2084064041","https://openalex.org/W2091549324","https://openalex.org/W2091874256","https://openalex.org/W2094175538","https://openalex.org/W2124812425","https://openalex.org/W2130844535","https://openalex.org/W2136780394","https://openalex.org/W2137900593","https://openalex.org/W2149454052","https://openalex.org/W2165159418","https://openalex.org/W2230977749","https://openalex.org/W2316564661","https://openalex.org/W2775740332","https://openalex.org/W3134771994"],"related_works":["https://openalex.org/W2002303885","https://openalex.org/W4311361601","https://openalex.org/W2018215034","https://openalex.org/W1991750265","https://openalex.org/W2615612939","https://openalex.org/W1993453088","https://openalex.org/W2761098424","https://openalex.org/W2067207573","https://openalex.org/W2010088179","https://openalex.org/W2563719283"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}