{"id":"https://openalex.org/W2081241643","doi":"https://doi.org/10.1007/s11075-009-9321-0","title":"Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization","display_name":"Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization","publication_year":2009,"publication_date":"2009-07-24","ids":{"openalex":"https://openalex.org/W2081241643","doi":"https://doi.org/10.1007/s11075-009-9321-0","mag":"2081241643"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-009-9321-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-009-9321-0","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 Independentei, Bucharest 5, 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, 54, Splaiul Independentei, Bucharest 5, 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":3.8183,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.93011494,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"54","issue":"1","first_page":"23","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9950000047683716,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9782000184059143,"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/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.7975499033927917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7705912590026855},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5797905325889587},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4790552854537964},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.4770511984825134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4711923599243164},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.43708282709121704},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.35776668787002563},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.3423241376876831},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.21704062819480896}],"concepts":[{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.7975499033927917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7705912590026855},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5797905325889587},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4790552854537964},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.4770511984825134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4711923599243164},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.43708282709121704},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.35776668787002563},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3423241376876831},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.21704062819480896},{"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/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11075-009-9321-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-009-9321-0","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":61,"referenced_works":["https://openalex.org/W89654658","https://openalex.org/W150175414","https://openalex.org/W185532673","https://openalex.org/W186175500","https://openalex.org/W640673894","https://openalex.org/W1482298744","https://openalex.org/W1563835996","https://openalex.org/W1565013069","https://openalex.org/W1602183298","https://openalex.org/W1967077838","https://openalex.org/W1968098332","https://openalex.org/W1968553199","https://openalex.org/W1979347641","https://openalex.org/W1981556389","https://openalex.org/W1985088446","https://openalex.org/W1987327258","https://openalex.org/W1988849934","https://openalex.org/W1989566487","https://openalex.org/W1999855318","https://openalex.org/W2004081181","https://openalex.org/W2004669532","https://openalex.org/W2012231377","https://openalex.org/W2012960907","https://openalex.org/W2014851363","https://openalex.org/W2018215034","https://openalex.org/W2029493470","https://openalex.org/W2032668178","https://openalex.org/W2033947507","https://openalex.org/W2043382734","https://openalex.org/W2045454144","https://openalex.org/W2049244328","https://openalex.org/W2051434435","https://openalex.org/W2059327787","https://openalex.org/W2062106836","https://openalex.org/W2066743741","https://openalex.org/W2077658674","https://openalex.org/W2083770700","https://openalex.org/W2084277536","https://openalex.org/W2085694061","https://openalex.org/W2086108341","https://openalex.org/W2090016606","https://openalex.org/W2091549324","https://openalex.org/W2091874256","https://openalex.org/W2106965455","https://openalex.org/W2108560279","https://openalex.org/W2123019231","https://openalex.org/W2130092997","https://openalex.org/W2136780394","https://openalex.org/W2142738245","https://openalex.org/W2149454052","https://openalex.org/W2230977749","https://openalex.org/W2316564661","https://openalex.org/W2325195382","https://openalex.org/W2340930132","https://openalex.org/W2493960429","https://openalex.org/W2775740332","https://openalex.org/W2985272081","https://openalex.org/W3012317737","https://openalex.org/W3193463891","https://openalex.org/W4237753401","https://openalex.org/W6812042197"],"related_works":["https://openalex.org/W2098528027","https://openalex.org/W3197592642","https://openalex.org/W2625259661","https://openalex.org/W2388344948","https://openalex.org/W2069731254","https://openalex.org/W2005717169","https://openalex.org/W2393037300","https://openalex.org/W2356977358","https://openalex.org/W2045319544","https://openalex.org/W3159907817"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}