{"id":"https://openalex.org/W2789787065","doi":"https://doi.org/10.1080/10556788.2017.1414813","title":"A new conjugate gradient algorithm with cubic Barzilai\u2013Borwein stepsize for unconstrained optimization","display_name":"A new conjugate gradient algorithm with cubic Barzilai\u2013Borwein stepsize for unconstrained optimization","publication_year":2018,"publication_date":"2018-01-31","ids":{"openalex":"https://openalex.org/W2789787065","doi":"https://doi.org/10.1080/10556788.2017.1414813","mag":"2789787065"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2017.1414813","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1414813","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/A5031990660","display_name":"Mojgan Momeni","orcid":null},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Momeni","raw_affiliation_strings":["Faculty of Mathematics, K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","Scientific Computations in OPtimization and Systems Engineering (SCOPE), K.N. Toosi Univ. of Tech., Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]},{"raw_affiliation_string":"Scientific Computations in OPtimization and Systems Engineering (SCOPE), K.N. Toosi Univ. of Tech., Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044356249","display_name":"M. Reza Peyghami","orcid":"https://orcid.org/0000-0003-0360-040X"},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"M.R. Peyghami","raw_affiliation_strings":["Faculty of Mathematics, K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","Scientific Computations in OPtimization and Systems Engineering (SCOPE), K.N. Toosi Univ. of Tech., Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, K.N. Toosi Univ. of Tech., P.O. Box 16315-1618, Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]},{"raw_affiliation_string":"Scientific Computations in OPtimization and Systems Engineering (SCOPE), K.N. Toosi Univ. of Tech., Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044356249"],"corresponding_institution_ids":["https://openalex.org/I80543232"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.03583454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"34","issue":"3","first_page":"650","last_page":"664"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9955999851226807,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9922999739646912,"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/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.6883096694946289},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6473457217216492},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.6073200106620789},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.5674870014190674},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5489969849586487},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5254135131835938},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.47182685136795044},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.45998257398605347},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4594190716743469},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.4501788020133972},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35451143980026245},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2596759796142578},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07352709770202637}],"concepts":[{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.6883096694946289},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6473457217216492},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.6073200106620789},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.5674870014190674},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5489969849586487},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5254135131835938},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.47182685136795044},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.45998257398605347},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4594190716743469},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.4501788020133972},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35451143980026245},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2596759796142578},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07352709770202637},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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/10556788.2017.1414813","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1414813","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":15,"referenced_works":["https://openalex.org/W1982067912","https://openalex.org/W1983230696","https://openalex.org/W2010647796","https://openalex.org/W2012341322","https://openalex.org/W2012604196","https://openalex.org/W2018215034","https://openalex.org/W2045423624","https://openalex.org/W2050096287","https://openalex.org/W2063771481","https://openalex.org/W2075313995","https://openalex.org/W2076605490","https://openalex.org/W2091874256","https://openalex.org/W2140163944","https://openalex.org/W2149454052","https://openalex.org/W4301909677"],"related_works":["https://openalex.org/W2098528027","https://openalex.org/W3197592642","https://openalex.org/W2356977358","https://openalex.org/W2846499288","https://openalex.org/W2069731254","https://openalex.org/W2388344948","https://openalex.org/W2302465375","https://openalex.org/W2625259661","https://openalex.org/W2393037300","https://openalex.org/W2088605360"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3],"new":[4,87,103],"conjugate":[5],"gradient":[6],"(CG)":[7],"algorithm":[8,22,104],"in":[9],"Dai\u2013Liao":[10],"(DL)":[11],"family":[12],"is":[13,53,60,66,108],"presented":[14],"for":[15,28],"solving":[16],"unconstrained":[17],"optimization":[18],"problems.":[19],"The":[20,98],"proposed":[21,88],"tries":[23],"to":[24],"adjust":[25],"positive":[26],"values":[27],"the":[29,40,45,50,57,63,70,82,86,102],"so-called":[30],"DL":[31],"parameter":[32,65],"by":[33],"using":[34],"quadratic":[35],"and/or":[36],"cubic":[37,46],"models":[38],"of":[39,49,85],"objective":[41,51],"function.":[42],"More":[43],"precisely,":[44],"regularization":[47],"model":[48],"function":[52],"properly":[54],"employed":[55],"when":[56],"non-positive":[58],"curvature":[59],"detected.":[61],"Besides,":[62],"CG":[64,72],"introduced":[67],"so":[68],"that":[69,101],"generated":[71],"directions":[73],"are":[74,96],"descent.":[75],"Under":[76],"some":[77,93],"standard":[78],"assumptions,":[79],"we":[80],"establish":[81],"convergence":[83],"property":[84],"algorithm.":[89],"Numerical":[90],"results":[91,99],"on":[92],"test":[94],"problems":[95],"reported.":[97],"show":[100],"performs":[105],"well":[106],"and":[107],"competitive":[109],"with":[110],"CG_DESCENT":[111],"method.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}