{"id":"https://openalex.org/W2617455158","doi":"https://doi.org/10.1051/ro/2017043","title":"Rapidly convergent Steffensen-based methods for unconstrained optimization","display_name":"Rapidly convergent Steffensen-based methods for unconstrained optimization","publication_year":2017,"publication_date":"2017-05-23","ids":{"openalex":"https://openalex.org/W2617455158","doi":"https://doi.org/10.1051/ro/2017043","mag":"2617455158"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2017043","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2017043","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2019/02/ro170001.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.rairo-ro.org/articles/ro/pdf/2019/02/ro170001.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022746204","display_name":"Mohammad Afzalinejad","orcid":"https://orcid.org/0000-0003-1130-1573"},"institutions":[{"id":"https://openalex.org/I9570713","display_name":"Tafresh University","ror":"https://ror.org/040f6ar92","country_code":"IR","type":"education","lineage":["https://openalex.org/I9570713"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mohammad Afzalinejad","raw_affiliation_strings":["Department of Mathematics, Tafresh University, Tafresh, Iran"],"raw_orcid":"https://orcid.org/0000-0003-1130-1573","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Tafresh University, Tafresh, Iran","institution_ids":["https://openalex.org/I9570713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022746204"],"corresponding_institution_ids":["https://openalex.org/I9570713"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.08448687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"53","issue":"2","first_page":"657","last_page":"666"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","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/T12661","display_name":"Iterative Methods for Nonlinear Equations","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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9656999707221985,"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/derivative","display_name":"Derivative (finance)","score":0.6022228598594666},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5813843011856079},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5733284950256348},{"id":"https://openalex.org/keywords/steffensens-method","display_name":"Steffensen's method","score":0.5364172458648682},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5101521611213684},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5088298916816711},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.507838785648346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48819953203201294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48793622851371765},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.4776153266429901},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4707679748535156},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.44331586360931396},{"id":"https://openalex.org/keywords/derivative-free-optimization","display_name":"Derivative-free optimization","score":0.4285157322883606},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3693270683288574},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.3685530424118042},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.36020877957344055},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3487904667854309},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.1896301507949829},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.1489374339580536},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09691029787063599},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.07290077209472656}],"concepts":[{"id":"https://openalex.org/C111771559","wikidata":"https://www.wikidata.org/wiki/Q66295","display_name":"Derivative (finance)","level":2,"score":0.6022228598594666},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5813843011856079},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5733284950256348},{"id":"https://openalex.org/C173443657","wikidata":"https://www.wikidata.org/wiki/Q7606635","display_name":"Steffensen's method","level":5,"score":0.5364172458648682},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5101521611213684},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5088298916816711},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.507838785648346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48819953203201294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48793622851371765},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.4776153266429901},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4707679748535156},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.44331586360931396},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.4285157322883606},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3693270683288574},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.3685530424118042},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.36020877957344055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3487904667854309},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.1896301507949829},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.1489374339580536},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09691029787063599},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.07290077209472656},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","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},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro/2017043","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2017043","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2019/02/ro170001.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2019__53_2_657_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2017043/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1051/ro/2017043","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2017043","pdf_url":"https://www.rairo-ro.org/articles/ro/pdf/2019/02/ro170001.pdf","source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2008249171","https://openalex.org/W2015856668","https://openalex.org/W2025340576","https://openalex.org/W2025986106","https://openalex.org/W2064542388","https://openalex.org/W2075194837","https://openalex.org/W2140622762","https://openalex.org/W2142887070","https://openalex.org/W2162737890","https://openalex.org/W2502655619","https://openalex.org/W4293775970"],"related_works":["https://openalex.org/W2259043954","https://openalex.org/W2110100614","https://openalex.org/W2095039379","https://openalex.org/W2102312852","https://openalex.org/W2124994687","https://openalex.org/W2094765216","https://openalex.org/W2116996080","https://openalex.org/W2042383140","https://openalex.org/W2394245792","https://openalex.org/W2354939793"],"abstract_inverted_index":{"A":[0],"problem":[1],"with":[2,80],"rapidly":[3],"convergent":[4],"methods":[5,29,46,76,97],"for":[6,30,54,67,101],"unconstrained":[7,32],"optimization":[8,33],"like":[9],"the":[10,14,20,68,72,91,102,105,123],"Newton\u2019s":[11],"method":[12,53],"is":[13,35,47],"computational":[15],"difficulties":[16],"arising":[17],"specially":[18],"from":[19],"second":[21,73],"derivative.":[22,74],"In":[23],"this":[24,78,127],"paper,":[25],"a":[26,50,58,64],"class":[27,44,128],"of":[28,45,57,77,90,95,126,129],"solving":[31],"problems":[34],"proposed":[36,84],"which":[37,85],"implicitly":[38],"applies":[39],"approximations":[40],"to":[41,62,113],"derivatives.":[42],"This":[43],"based":[48],"on":[49],"modified":[51],"Steffensen":[52],"finding":[55],"roots":[56],"function":[59,69],"and":[60],"attempts":[61],"make":[63],"quadratic":[65],"model":[66],"without":[70],"using":[71],"Two":[75],"kind":[79],"non-expensive":[81],"computations":[82],"are":[83,98,108],"just":[86],"use":[87],"first":[88],"derivative":[89],"function.":[92],"Derivative-free":[93],"versions":[94],"these":[96],"also":[99],"suggested":[100],"cases":[103],"where":[104],"gradient":[106],"formulas":[107],"not":[109],"available":[110],"or":[111],"difficult":[112],"evaluate.":[114],"The":[115],"theory":[116],"as":[117,119],"well":[118],"numerical":[120],"examinations":[121],"confirm":[122],"rapid":[124],"convergence":[125],"methods.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}