{"id":"https://openalex.org/W2032668178","doi":"https://doi.org/10.1007/s11075-007-9152-9","title":"Another hybrid conjugate gradient algorithm for unconstrained optimization","display_name":"Another hybrid conjugate gradient algorithm for unconstrained optimization","publication_year":2008,"publication_date":"2008-01-18","ids":{"openalex":"https://openalex.org/W2032668178","doi":"https://doi.org/10.1007/s11075-007-9152-9","mag":"2032668178"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-007-9152-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-007-9152-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"]}],"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","Center for Advanced Modeling and Optimization"],"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":"Center for Advanced Modeling and Optimization","institution_ids":[]}]}],"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":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":2.567,"has_fulltext":false,"cited_by_count":98,"citation_normalized_percentile":{"value":0.88526434,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"47","issue":"2","first_page":"143","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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":1.0,"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.9940999746322632,"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.9879000186920166,"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.9085158109664917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7629284858703613},{"id":"https://openalex.org/keywords/derivation-of-the-conjugate-gradient-method","display_name":"Derivation of the conjugate gradient method","score":0.6099276542663574},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.5837317705154419},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5582674741744995},{"id":"https://openalex.org/keywords/conjugate-residual-method","display_name":"Conjugate residual method","score":0.5285410284996033},{"id":"https://openalex.org/keywords/conjugate","display_name":"Conjugate","score":0.5000026226043701},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.49696972966194153},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.47676926851272583},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4746337831020355},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.44901061058044434},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4377462863922119},{"id":"https://openalex.org/keywords/biconjugate-gradient-method","display_name":"Biconjugate gradient method","score":0.4363837242126465},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.42311859130859375},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42267847061157227},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.41101184487342834},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.30037450790405273},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.2991393804550171},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.18232882022857666},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09369176626205444}],"concepts":[{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.9085158109664917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7629284858703613},{"id":"https://openalex.org/C198562538","wikidata":"https://www.wikidata.org/wiki/Q5262612","display_name":"Derivation of the conjugate gradient method","level":5,"score":0.6099276542663574},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.5837317705154419},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5582674741744995},{"id":"https://openalex.org/C91394653","wikidata":"https://www.wikidata.org/wiki/Q5161159","display_name":"Conjugate residual method","level":4,"score":0.5285410284996033},{"id":"https://openalex.org/C197336794","wikidata":"https://www.wikidata.org/wiki/Q5161150","display_name":"Conjugate","level":2,"score":0.5000026226043701},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.49696972966194153},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.47676926851272583},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4746337831020355},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.44901061058044434},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4377462863922119},{"id":"https://openalex.org/C89408827","wikidata":"https://www.wikidata.org/wiki/Q855169","display_name":"Biconjugate gradient method","level":5,"score":0.4363837242126465},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.42311859130859375},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42267847061157227},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.41101184487342834},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.30037450790405273},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2991393804550171},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.18232882022857666},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09369176626205444},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11075-007-9152-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-007-9152-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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W89654658","https://openalex.org/W186175500","https://openalex.org/W1565013069","https://openalex.org/W1968098332","https://openalex.org/W1968553199","https://openalex.org/W1979347641","https://openalex.org/W1981556389","https://openalex.org/W1999855318","https://openalex.org/W2004081181","https://openalex.org/W2004669532","https://openalex.org/W2012231377","https://openalex.org/W2014851363","https://openalex.org/W2018215034","https://openalex.org/W2066743741","https://openalex.org/W2077658674","https://openalex.org/W2085694061","https://openalex.org/W2086108341","https://openalex.org/W2091549324","https://openalex.org/W2091874256","https://openalex.org/W2108560279","https://openalex.org/W2123019231","https://openalex.org/W2136780394","https://openalex.org/W2149454052","https://openalex.org/W2230977749","https://openalex.org/W2316564661","https://openalex.org/W3012317737","https://openalex.org/W3193463891","https://openalex.org/W4237753401"],"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":null,"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-07T14:57:38.498316","created_date":"2025-10-10T00:00:00"}